./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_linked_list_pop_front_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 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/aws-c-common/aws_linked_list_pop_front_harness.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash 0a45241a50bca97d16f2ca30787e76783488e633dbd3fde1131a60622cf8ee85 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 17:22:01,883 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 17:22:01,940 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-01-09 17:22:01,945 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 17:22:01,945 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 17:22:01,972 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 17:22:01,974 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 17:22:01,974 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 17:22:01,974 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 17:22:01,974 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 17:22:01,975 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 17:22:01,975 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 17:22:01,975 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 17:22:01,975 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 17:22:01,975 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 17:22:01,975 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 17:22:01,976 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 17:22:01,976 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 17:22:01,976 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 17:22:01,976 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 17:22:01,976 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 17:22:01,976 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 17:22:01,976 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 17:22:01,976 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 17:22:01,976 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 17:22:01,976 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 17:22:01,976 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 17:22:01,976 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 17:22:01,976 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 17:22:01,977 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 17:22:01,977 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 17:22:01,977 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 17:22:01,977 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 17:22:01,977 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 17:22:01,977 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 17:22:01,977 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 17:22:01,977 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 17:22:01,977 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 17:22:01,977 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 17:22:01,979 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 17:22:01,979 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 17:22:01,979 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 17:22:01,979 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 17:22:01,979 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 17:22:01,980 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 17:22:01,980 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0a45241a50bca97d16f2ca30787e76783488e633dbd3fde1131a60622cf8ee85 [2025-01-09 17:22:02,269 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 17:22:02,280 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 17:22:02,283 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 17:22:02,284 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 17:22:02,285 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 17:22:02,287 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_linked_list_pop_front_harness.i [2025-01-09 17:22:02,866 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0841296cd/e90c80a8605a48168b4f8b2d27c0b229/FLAG1324cce4f [2025-01-09 17:22:04,731 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 17:22:04,732 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_pop_front_harness.i [2025-01-09 17:22:04,772 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0841296cd/e90c80a8605a48168b4f8b2d27c0b229/FLAG1324cce4f [2025-01-09 17:22:04,791 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0841296cd/e90c80a8605a48168b4f8b2d27c0b229 [2025-01-09 17:22:04,793 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 17:22:04,795 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 17:22:04,796 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 17:22:04,797 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 17:22:04,800 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 17:22:04,802 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:22:04" (1/1) ... [2025-01-09 17:22:04,802 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cf098e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:22:04, skipping insertion in model container [2025-01-09 17:22:04,803 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:22:04" (1/1) ... [2025-01-09 17:22:04,878 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 17:22:05,083 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/aws-c-common/aws_linked_list_pop_front_harness.i[4499,4512] [2025-01-09 17:22:05,091 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/aws-c-common/aws_linked_list_pop_front_harness.i[4559,4572] [2025-01-09 17:22:05,619 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:22:05,620 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:22:05,621 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:22:05,621 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:22:05,626 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:22:05,640 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:22:05,640 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:22:05,642 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:22:05,642 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:22:05,643 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:22:05,644 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:22:05,646 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:22:05,646 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:22:06,010 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/aws-c-common/aws_linked_list_pop_front_harness.i[150662,150675] [2025-01-09 17:22:06,011 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 17:22:06,031 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 17:22:06,050 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/aws-c-common/aws_linked_list_pop_front_harness.i[4499,4512] [2025-01-09 17:22:06,051 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/aws-c-common/aws_linked_list_pop_front_harness.i[4559,4572] [2025-01-09 17:22:06,108 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:22:06,112 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:22:06,112 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:22:06,113 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:22:06,113 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:22:06,123 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:22:06,123 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:22:06,124 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:22:06,124 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:22:06,126 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:22:06,127 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:22:06,127 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:22:06,127 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:22:06,214 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/aws-c-common/aws_linked_list_pop_front_harness.i[150662,150675] [2025-01-09 17:22:06,215 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 17:22:06,375 INFO L204 MainTranslator]: Completed translation [2025-01-09 17:22:06,376 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:22:06 WrapperNode [2025-01-09 17:22:06,376 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 17:22:06,377 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 17:22:06,377 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 17:22:06,377 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 17:22:06,383 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:22:06" (1/1) ... [2025-01-09 17:22:06,433 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:22:06" (1/1) ... [2025-01-09 17:22:06,480 INFO L138 Inliner]: procedures = 668, calls = 1044, calls flagged for inlining = 53, calls inlined = 8, statements flattened = 219 [2025-01-09 17:22:06,481 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 17:22:06,482 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 17:22:06,482 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 17:22:06,482 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 17:22:06,491 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:22:06" (1/1) ... [2025-01-09 17:22:06,492 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:22:06" (1/1) ... [2025-01-09 17:22:06,496 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:22:06" (1/1) ... [2025-01-09 17:22:06,534 INFO L175 MemorySlicer]: Split 43 memory accesses to 3 slices as follows [2, 5, 36]. 84 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5, 0]. The 9 writes are split as follows [0, 0, 9]. [2025-01-09 17:22:06,534 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:22:06" (1/1) ... [2025-01-09 17:22:06,535 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:22:06" (1/1) ... [2025-01-09 17:22:06,559 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:22:06" (1/1) ... [2025-01-09 17:22:06,560 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:22:06" (1/1) ... [2025-01-09 17:22:06,563 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:22:06" (1/1) ... [2025-01-09 17:22:06,566 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:22:06" (1/1) ... [2025-01-09 17:22:06,568 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:22:06" (1/1) ... [2025-01-09 17:22:06,576 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 17:22:06,577 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 17:22:06,577 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 17:22:06,577 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 17:22:06,578 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:22:06" (1/1) ... [2025-01-09 17:22:06,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 17:22:06,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 17:22:06,616 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-01-09 17:22:06,620 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-01-09 17:22:06,640 INFO L130 BoogieDeclarations]: Found specification of procedure aws_is_mem_zeroed [2025-01-09 17:22:06,641 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_is_mem_zeroed [2025-01-09 17:22:06,641 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_remove [2025-01-09 17:22:06,642 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_remove [2025-01-09 17:22:06,642 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 17:22:06,642 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 17:22:06,642 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 17:22:06,642 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 17:22:06,642 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-01-09 17:22:06,642 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-01-09 17:22:06,642 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2025-01-09 17:22:06,643 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2025-01-09 17:22:06,643 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 17:22:06,643 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2025-01-09 17:22:06,643 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2025-01-09 17:22:06,643 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 17:22:06,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 17:22:06,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 17:22:06,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-09 17:22:06,643 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 17:22:06,643 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 17:22:06,643 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_empty [2025-01-09 17:22:06,643 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_empty [2025-01-09 17:22:06,643 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-01-09 17:22:06,643 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-01-09 17:22:06,643 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-01-09 17:22:06,643 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-01-09 17:22:06,643 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-01-09 17:22:06,643 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-01-09 17:22:06,643 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 17:22:06,643 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 17:22:06,643 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 17:22:06,643 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 17:22:06,643 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 17:22:06,643 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-09 17:22:06,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-01-09 17:22:06,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-01-09 17:22:06,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-01-09 17:22:06,644 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2025-01-09 17:22:06,644 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2025-01-09 17:22:06,644 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_prev_is_valid [2025-01-09 17:22:06,644 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_prev_is_valid [2025-01-09 17:22:06,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 17:22:06,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 17:22:06,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 17:22:06,933 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 17:22:06,935 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 17:22:07,381 INFO L? ?]: Removed 104 outVars from TransFormulas that were not future-live. [2025-01-09 17:22:07,381 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 17:22:07,397 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 17:22:07,399 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 17:22:07,399 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:22:07 BoogieIcfgContainer [2025-01-09 17:22:07,399 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 17:22:07,402 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 17:22:07,402 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 17:22:07,408 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 17:22:07,408 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 05:22:04" (1/3) ... [2025-01-09 17:22:07,409 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d9f1ec4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:22:07, skipping insertion in model container [2025-01-09 17:22:07,409 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:22:06" (2/3) ... [2025-01-09 17:22:07,409 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d9f1ec4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:22:07, skipping insertion in model container [2025-01-09 17:22:07,409 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:22:07" (3/3) ... [2025-01-09 17:22:07,410 INFO L128 eAbstractionObserver]: Analyzing ICFG aws_linked_list_pop_front_harness.i [2025-01-09 17:22:07,424 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 17:22:07,425 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG aws_linked_list_pop_front_harness.i that has 13 procedures, 141 locations, 1 initial locations, 7 loop locations, and 1 error locations. [2025-01-09 17:22:07,480 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 17:22:07,490 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;@7328d5c4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 17:22:07,490 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 17:22:07,494 INFO L276 IsEmpty]: Start isEmpty. Operand has 133 states, 85 states have (on average 1.2823529411764707) internal successors, (109), 86 states have internal predecessors, (109), 37 states have call successors, (37), 10 states have call predecessors, (37), 10 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2025-01-09 17:22:07,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-01-09 17:22:07,508 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:22:07,509 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1] [2025-01-09 17:22:07,509 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:22:07,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:22:07,514 INFO L85 PathProgramCache]: Analyzing trace with hash 622833282, now seen corresponding path program 1 times [2025-01-09 17:22:07,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:22:07,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738433463] [2025-01-09 17:22:07,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:22:07,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:22:07,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-01-09 17:22:07,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-01-09 17:22:07,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:22:07,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:22:07,924 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2025-01-09 17:22:07,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:22:07,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738433463] [2025-01-09 17:22:07,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738433463] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 17:22:07,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [152016674] [2025-01-09 17:22:07,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:22:07,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:22:07,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 17:22:07,941 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-01-09 17:22:07,942 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-01-09 17:22:08,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-01-09 17:22:08,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-01-09 17:22:08,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:22:08,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:22:08,182 INFO L256 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 17:22:08,191 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 17:22:08,215 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2025-01-09 17:22:08,215 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 17:22:08,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [152016674] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:22:08,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 17:22:08,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 17:22:08,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839766006] [2025-01-09 17:22:08,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:22:08,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 17:22:08,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:22:08,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 17:22:08,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 17:22:08,240 INFO L87 Difference]: Start difference. First operand has 133 states, 85 states have (on average 1.2823529411764707) internal successors, (109), 86 states have internal predecessors, (109), 37 states have call successors, (37), 10 states have call predecessors, (37), 10 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 17:22:08,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:22:08,282 INFO L93 Difference]: Finished difference Result 258 states and 381 transitions. [2025-01-09 17:22:08,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 17:22:08,285 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 115 [2025-01-09 17:22:08,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:22:08,293 INFO L225 Difference]: With dead ends: 258 [2025-01-09 17:22:08,295 INFO L226 Difference]: Without dead ends: 128 [2025-01-09 17:22:08,299 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 116 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-01-09 17:22:08,304 INFO L435 NwaCegarLoop]: 179 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, 179 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-01-09 17:22:08,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 17:22:08,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2025-01-09 17:22:08,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2025-01-09 17:22:08,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 80 states have (on average 1.2625) internal successors, (101), 81 states have internal predecessors, (101), 37 states have call successors, (37), 10 states have call predecessors, (37), 10 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-01-09 17:22:08,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 174 transitions. [2025-01-09 17:22:08,360 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 174 transitions. Word has length 115 [2025-01-09 17:22:08,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:22:08,361 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 174 transitions. [2025-01-09 17:22:08,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 17:22:08,362 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 174 transitions. [2025-01-09 17:22:08,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-01-09 17:22:08,365 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:22:08,366 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1] [2025-01-09 17:22:08,375 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 17:22:08,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 17:22:08,567 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:22:08,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:22:08,567 INFO L85 PathProgramCache]: Analyzing trace with hash 332023088, now seen corresponding path program 1 times [2025-01-09 17:22:08,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:22:08,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920796558] [2025-01-09 17:22:08,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:22:08,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:22:08,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-01-09 17:22:08,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-01-09 17:22:08,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:22:08,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:22:09,500 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 20 proven. 8 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2025-01-09 17:22:09,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:22:09,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920796558] [2025-01-09 17:22:09,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920796558] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 17:22:09,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [729301514] [2025-01-09 17:22:09,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:22:09,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:22:09,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 17:22:09,505 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-01-09 17:22:09,508 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-01-09 17:22:09,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-01-09 17:22:09,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-01-09 17:22:09,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:22:09,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:22:09,740 INFO L256 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-01-09 17:22:09,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 17:22:09,931 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 24 treesize of output 32 [2025-01-09 17:22:09,940 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 11 [2025-01-09 17:22:09,949 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 47 treesize of output 18 [2025-01-09 17:22:09,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-01-09 17:22:09,958 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 12 treesize of output 1 [2025-01-09 17:22:09,994 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2025-01-09 17:22:09,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 15 [2025-01-09 17:22:13,405 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2025-01-09 17:22:13,405 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 17:22:13,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [729301514] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:22:13,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 17:22:13,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [6] total 17 [2025-01-09 17:22:13,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219761753] [2025-01-09 17:22:13,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:22:13,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 17:22:13,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:22:13,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 17:22:13,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2025-01-09 17:22:13,410 INFO L87 Difference]: Start difference. First operand 128 states and 174 transitions. Second operand has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 6 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) [2025-01-09 17:22:17,432 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 17:22:21,524 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 17:22:25,584 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 17:22:29,696 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 17:22:33,729 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 17:22:39,057 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 17:22:43,074 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 17:22:47,090 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 17:22:47,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:22:47,194 INFO L93 Difference]: Finished difference Result 336 states and 465 transitions. [2025-01-09 17:22:47,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 17:22:47,195 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 6 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) Word has length 115 [2025-01-09 17:22:47,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:22:47,198 INFO L225 Difference]: With dead ends: 336 [2025-01-09 17:22:47,199 INFO L226 Difference]: Without dead ends: 214 [2025-01-09 17:22:47,202 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 86 SyntacticMatches, 20 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=122, Invalid=634, Unknown=0, NotChecked=0, Total=756 [2025-01-09 17:22:47,206 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 349 mSDsluCounter, 918 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 112 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 33.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 1054 SdHoareTripleChecker+Invalid, 668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 33.3s IncrementalHoareTripleChecker+Time [2025-01-09 17:22:47,206 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 1054 Invalid, 668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 548 Invalid, 8 Unknown, 0 Unchecked, 33.3s Time] [2025-01-09 17:22:47,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2025-01-09 17:22:47,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 209. [2025-01-09 17:22:47,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 132 states have (on average 1.2727272727272727) internal successors, (168), 134 states have internal predecessors, (168), 60 states have call successors, (60), 17 states have call predecessors, (60), 16 states have return successors, (59), 57 states have call predecessors, (59), 59 states have call successors, (59) [2025-01-09 17:22:47,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 287 transitions. [2025-01-09 17:22:47,248 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 287 transitions. Word has length 115 [2025-01-09 17:22:47,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:22:47,248 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 287 transitions. [2025-01-09 17:22:47,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 6 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) [2025-01-09 17:22:47,248 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 287 transitions. [2025-01-09 17:22:47,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-01-09 17:22:47,251 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:22:47,251 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1] [2025-01-09 17:22:47,263 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 17:22:47,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:22:47,458 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:22:47,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:22:47,459 INFO L85 PathProgramCache]: Analyzing trace with hash 691399286, now seen corresponding path program 1 times [2025-01-09 17:22:47,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:22:47,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648481523] [2025-01-09 17:22:47,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:22:47,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:22:47,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-01-09 17:22:47,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-01-09 17:22:47,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:22:47,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:22:47,937 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 20 proven. 8 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2025-01-09 17:22:47,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:22:47,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648481523] [2025-01-09 17:22:47,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648481523] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 17:22:47,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2109170338] [2025-01-09 17:22:47,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:22:47,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:22:47,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 17:22:47,942 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 17:22:47,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 17:22:48,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-01-09 17:22:48,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-01-09 17:22:48,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:22:48,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:22:48,131 INFO L256 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 62 conjuncts are in the unsatisfiable core [2025-01-09 17:22:48,138 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 17:22:48,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2025-01-09 17:22:48,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2025-01-09 17:22:48,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 17:22:48,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 17:22:48,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 17:22:48,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 32 [2025-01-09 17:22:48,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 17:22:48,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 17:22:48,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 17:22:48,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 39 [2025-01-09 17:22:50,357 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-01-09 17:22:50,357 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 17:22:50,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2109170338] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:22:50,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 17:22:50,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [6] total 15 [2025-01-09 17:22:50,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351981533] [2025-01-09 17:22:50,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:22:50,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 17:22:50,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:22:50,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 17:22:50,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2025-01-09 17:22:50,362 INFO L87 Difference]: Start difference. First operand 209 states and 287 transitions. Second operand has 11 states, 10 states have (on average 6.1) internal successors, (61), 11 states have internal predecessors, (61), 6 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (15), 5 states have call predecessors, (15), 6 states have call successors, (15) [2025-01-09 17:22:51,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:22:51,678 INFO L93 Difference]: Finished difference Result 362 states and 492 transitions. [2025-01-09 17:22:51,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 17:22:51,679 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.1) internal successors, (61), 11 states have internal predecessors, (61), 6 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (15), 5 states have call predecessors, (15), 6 states have call successors, (15) Word has length 115 [2025-01-09 17:22:51,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:22:51,682 INFO L225 Difference]: With dead ends: 362 [2025-01-09 17:22:51,685 INFO L226 Difference]: Without dead ends: 215 [2025-01-09 17:22:51,686 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 95 SyntacticMatches, 12 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2025-01-09 17:22:51,687 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 97 mSDsluCounter, 758 mSDsCounter, 0 mSdLazyCounter, 513 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 900 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 17:22:51,687 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 900 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 513 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 17:22:51,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2025-01-09 17:22:51,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 210. [2025-01-09 17:22:51,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 133 states have (on average 1.2706766917293233) internal successors, (169), 135 states have internal predecessors, (169), 60 states have call successors, (60), 17 states have call predecessors, (60), 16 states have return successors, (59), 57 states have call predecessors, (59), 59 states have call successors, (59) [2025-01-09 17:22:51,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 288 transitions. [2025-01-09 17:22:51,748 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 288 transitions. Word has length 115 [2025-01-09 17:22:51,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:22:51,748 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 288 transitions. [2025-01-09 17:22:51,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.1) internal successors, (61), 11 states have internal predecessors, (61), 6 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (15), 5 states have call predecessors, (15), 6 states have call successors, (15) [2025-01-09 17:22:51,749 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 288 transitions. [2025-01-09 17:22:51,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-01-09 17:22:51,754 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:22:51,755 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1] [2025-01-09 17:22:51,765 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 17:22:51,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:22:51,955 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:22:51,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:22:51,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1431119510, now seen corresponding path program 1 times [2025-01-09 17:22:51,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:22:51,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122794850] [2025-01-09 17:22:51,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:22:51,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:22:51,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-01-09 17:22:52,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-01-09 17:22:52,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:22:52,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:22:52,301 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 20 proven. 8 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2025-01-09 17:22:52,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:22:52,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122794850] [2025-01-09 17:22:52,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122794850] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 17:22:52,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [662488346] [2025-01-09 17:22:52,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:22:52,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:22:52,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 17:22:52,304 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 17:22:52,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 17:22:52,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-01-09 17:22:52,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-01-09 17:22:52,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:22:52,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:22:52,490 INFO L256 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-01-09 17:22:52,494 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 17:22:52,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2025-01-09 17:22:52,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2025-01-09 17:22:52,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 17:22:52,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 17:22:52,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 17:22:52,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 47 [2025-01-09 17:22:52,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 17:22:52,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 17:22:52,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 17:22:52,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 40 [2025-01-09 17:22:55,522 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2025-01-09 17:22:55,522 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 17:22:55,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [662488346] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:22:55,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 17:22:55,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [6] total 16 [2025-01-09 17:22:55,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474179539] [2025-01-09 17:22:55,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:22:55,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 17:22:55,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:22:55,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 17:22:55,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2025-01-09 17:22:55,524 INFO L87 Difference]: Start difference. First operand 210 states and 288 transitions. Second operand has 12 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 6 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) [2025-01-09 17:22:59,780 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 17:23:02,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:23:02,040 INFO L93 Difference]: Finished difference Result 378 states and 517 transitions. [2025-01-09 17:23:02,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 17:23:02,040 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 6 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) Word has length 115 [2025-01-09 17:23:02,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:23:02,043 INFO L225 Difference]: With dead ends: 378 [2025-01-09 17:23:02,043 INFO L226 Difference]: Without dead ends: 217 [2025-01-09 17:23:02,044 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 86 SyntacticMatches, 20 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=72, Invalid=390, Unknown=0, NotChecked=0, Total=462 [2025-01-09 17:23:02,044 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 101 mSDsluCounter, 885 mSDsCounter, 0 mSdLazyCounter, 642 mSolverCounterSat, 46 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 1036 SdHoareTripleChecker+Invalid, 689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 642 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2025-01-09 17:23:02,045 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 1036 Invalid, 689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 642 Invalid, 1 Unknown, 0 Unchecked, 5.9s Time] [2025-01-09 17:23:02,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2025-01-09 17:23:02,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 212. [2025-01-09 17:23:02,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 135 states have (on average 1.2666666666666666) internal successors, (171), 137 states have internal predecessors, (171), 60 states have call successors, (60), 17 states have call predecessors, (60), 16 states have return successors, (59), 57 states have call predecessors, (59), 59 states have call successors, (59) [2025-01-09 17:23:02,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 290 transitions. [2025-01-09 17:23:02,087 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 290 transitions. Word has length 115 [2025-01-09 17:23:02,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:23:02,088 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 290 transitions. [2025-01-09 17:23:02,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 6 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) [2025-01-09 17:23:02,088 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 290 transitions. [2025-01-09 17:23:02,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-01-09 17:23:02,090 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:23:02,090 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1] [2025-01-09 17:23:02,099 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 17:23:02,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:23:02,295 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:23:02,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:23:02,295 INFO L85 PathProgramCache]: Analyzing trace with hash 700925732, now seen corresponding path program 1 times [2025-01-09 17:23:02,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:23:02,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712606499] [2025-01-09 17:23:02,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:23:02,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:23:02,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-01-09 17:23:02,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-01-09 17:23:02,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:23:02,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:23:03,315 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2025-01-09 17:23:03,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:23:03,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712606499] [2025-01-09 17:23:03,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712606499] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 17:23:03,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [528830250] [2025-01-09 17:23:03,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:23:03,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:23:03,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 17:23:03,318 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 17:23:03,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 17:23:03,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-01-09 17:23:03,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-01-09 17:23:03,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:23:03,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:23:03,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-01-09 17:23:03,499 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 17:23:03,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 14 treesize of output 15 [2025-01-09 17:23:04,847 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2025-01-09 17:23:04,847 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 17:23:04,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [528830250] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:23:04,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 17:23:04,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [11] total 20 [2025-01-09 17:23:04,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371996166] [2025-01-09 17:23:04,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:23:04,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 17:23:04,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:23:04,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 17:23:04,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2025-01-09 17:23:04,849 INFO L87 Difference]: Start difference. First operand 212 states and 290 transitions. Second operand has 12 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 6 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) [2025-01-09 17:23:05,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:23:05,768 INFO L93 Difference]: Finished difference Result 386 states and 526 transitions. [2025-01-09 17:23:05,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 17:23:05,769 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 6 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) Word has length 115 [2025-01-09 17:23:05,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:23:05,771 INFO L225 Difference]: With dead ends: 386 [2025-01-09 17:23:05,771 INFO L226 Difference]: Without dead ends: 219 [2025-01-09 17:23:05,772 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 90 SyntacticMatches, 20 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=82, Invalid=518, Unknown=0, NotChecked=0, Total=600 [2025-01-09 17:23:05,774 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 122 mSDsluCounter, 912 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 1065 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 17:23:05,774 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 1065 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 17:23:05,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2025-01-09 17:23:05,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 214. [2025-01-09 17:23:05,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 137 states have (on average 1.2627737226277371) internal successors, (173), 139 states have internal predecessors, (173), 60 states have call successors, (60), 17 states have call predecessors, (60), 16 states have return successors, (59), 57 states have call predecessors, (59), 59 states have call successors, (59) [2025-01-09 17:23:05,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 292 transitions. [2025-01-09 17:23:05,814 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 292 transitions. Word has length 115 [2025-01-09 17:23:05,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:23:05,814 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 292 transitions. [2025-01-09 17:23:05,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 6 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) [2025-01-09 17:23:05,815 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 292 transitions. [2025-01-09 17:23:05,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-01-09 17:23:05,816 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:23:05,816 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1] [2025-01-09 17:23:05,825 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-09 17:23:06,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:23:06,017 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:23:06,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:23:06,017 INFO L85 PathProgramCache]: Analyzing trace with hash 897003102, now seen corresponding path program 1 times [2025-01-09 17:23:06,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:23:06,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376377251] [2025-01-09 17:23:06,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:23:06,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:23:06,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-01-09 17:23:06,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-01-09 17:23:06,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:23:06,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:23:06,200 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2025-01-09 17:23:06,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:23:06,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376377251] [2025-01-09 17:23:06,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376377251] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 17:23:06,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1197971116] [2025-01-09 17:23:06,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:23:06,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:23:06,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 17:23:06,203 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 17:23:06,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 17:23:06,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-01-09 17:23:06,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-01-09 17:23:06,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:23:06,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:23:06,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 17:23:06,412 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 17:23:06,560 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2025-01-09 17:23:06,561 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 17:23:06,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1197971116] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:23:06,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 17:23:06,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2025-01-09 17:23:06,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759743831] [2025-01-09 17:23:06,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:23:06,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 17:23:06,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:23:06,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 17:23:06,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-01-09 17:23:06,562 INFO L87 Difference]: Start difference. First operand 214 states and 292 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2025-01-09 17:23:06,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:23:06,937 INFO L93 Difference]: Finished difference Result 431 states and 594 transitions. [2025-01-09 17:23:06,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 17:23:06,938 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) Word has length 115 [2025-01-09 17:23:06,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:23:06,940 INFO L225 Difference]: With dead ends: 431 [2025-01-09 17:23:06,940 INFO L226 Difference]: Without dead ends: 244 [2025-01-09 17:23:06,941 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2025-01-09 17:23:06,942 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 212 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 17:23:06,942 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 581 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 17:23:06,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2025-01-09 17:23:06,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 244. [2025-01-09 17:23:06,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 163 states have (on average 1.294478527607362) internal successors, (211), 167 states have internal predecessors, (211), 62 states have call successors, (62), 17 states have call predecessors, (62), 18 states have return successors, (65), 59 states have call predecessors, (65), 61 states have call successors, (65) [2025-01-09 17:23:06,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 338 transitions. [2025-01-09 17:23:06,996 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 338 transitions. Word has length 115 [2025-01-09 17:23:06,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:23:06,996 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 338 transitions. [2025-01-09 17:23:06,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2025-01-09 17:23:06,996 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 338 transitions. [2025-01-09 17:23:06,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-01-09 17:23:06,998 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:23:06,998 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1] [2025-01-09 17:23:07,007 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-09 17:23:07,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-01-09 17:23:07,200 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:23:07,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:23:07,200 INFO L85 PathProgramCache]: Analyzing trace with hash -272627548, now seen corresponding path program 1 times [2025-01-09 17:23:07,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:23:07,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335438290] [2025-01-09 17:23:07,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:23:07,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:23:07,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-09 17:23:07,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-09 17:23:07,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:23:07,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:23:07,525 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 20 proven. 8 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2025-01-09 17:23:07,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:23:07,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335438290] [2025-01-09 17:23:07,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335438290] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 17:23:07,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [433723646] [2025-01-09 17:23:07,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:23:07,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:23:07,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 17:23:07,528 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 17:23:07,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-09 17:23:07,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-09 17:23:07,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-09 17:23:07,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:23:07,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:23:07,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-01-09 17:23:07,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 17:23:07,836 INFO L349 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2025-01-09 17:23:07,837 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 17 [2025-01-09 17:23:07,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 26 treesize of output 34 [2025-01-09 17:23:07,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 53 [2025-01-09 17:23:07,893 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset| 24))) (let ((.cse0 (select .cse3 .cse2))) (let ((.cse1 (= |c_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base| .cse0))) (or (and (not (= .cse0 0)) (not .cse1) (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int) (v_arrayElimArr_3 (Array Int Int))) (and (= |c_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base| (select v_arrayElimArr_3 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|)) (= (store (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base| v_DerPreprocessor_1) .cse0 v_arrayElimArr_3) |c_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base|) .cse2 .cse0) .cse3)))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int)) (= |c_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base| (select .cse3 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|))) .cse1 (not (= |c_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base| 0))))))) is different from true [2025-01-09 17:23:07,950 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_23| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_19| Int)) (let ((.cse0 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_23|))) (and (not (= 0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_23|)) (= (select .cse0 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_19| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_23|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int)) (= (select .cse0 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_23|))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int) (v_arrayElimArr_3 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_19| Int)) (let ((.cse2 (select v_arrayElimArr_3 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|))) (let ((.cse3 (select |c_#memory_$Pointer$#2.base| .cse2)) (.cse4 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_19| 24))) (let ((.cse1 (select .cse3 .cse4))) (and (not (= .cse1 0)) (not (= .cse2 .cse1)) (= .cse3 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse2 v_DerPreprocessor_1) .cse1 v_arrayElimArr_3) .cse2) .cse4 .cse1)))))))) is different from true [2025-01-09 17:23:08,204 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_23| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_19| Int)) (let ((.cse0 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_23|))) (and (not (= 0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_23|)) (= (select .cse0 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_19| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_23|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int)) (= (select .cse0 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_23|))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int) (v_arrayElimArr_3 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_19| Int)) (let ((.cse2 (select v_arrayElimArr_3 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|))) (let ((.cse3 (select |c_#memory_$Pointer$#2.base| .cse2)) (.cse4 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_19| 24))) (let ((.cse1 (select .cse3 .cse4))) (and (not (= .cse1 0)) (not (= .cse2 .cse1)) (= .cse3 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse2 v_DerPreprocessor_1) .cse1 v_arrayElimArr_3) .cse2) .cse4 .cse1)))))))) (let ((.cse8 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base|)) (.cse7 (+ |c_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset| 24))) (let ((.cse5 (select .cse8 .cse7))) (let ((.cse6 (= |c_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base| .cse5))) (or (and (not (= .cse5 0)) (not .cse6) (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int) (v_arrayElimArr_3 (Array Int Int))) (and (= |c_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base| (select v_arrayElimArr_3 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|)) (= (store (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base| v_DerPreprocessor_1) .cse5 v_arrayElimArr_3) |c_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base|) .cse7 .cse5) .cse8)))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int)) (= |c_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base| (select .cse8 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|))) .cse6 (not (= |c_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base| 0)))))))) is different from true [2025-01-09 17:23:08,261 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_23| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_19| Int)) (let ((.cse0 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_23|))) (and (not (= 0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_23|)) (= (select .cse0 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_19| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_23|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int)) (= (select .cse0 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_23|))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int) (v_arrayElimArr_3 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_19| Int)) (let ((.cse2 (select v_arrayElimArr_3 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|))) (let ((.cse3 (select |c_#memory_$Pointer$#2.base| .cse2)) (.cse4 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_19| 24))) (let ((.cse1 (select .cse3 .cse4))) (and (not (= .cse1 0)) (not (= .cse2 .cse1)) (= .cse3 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse2 v_DerPreprocessor_1) .cse1 v_arrayElimArr_3) .cse2) .cse4 .cse1)))))))) (or (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_20| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse6 (select v_arrayElimArr_3 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|))) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| .cse6)) (.cse8 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_20| 24))) (let ((.cse7 (select .cse5 .cse8))) (and (= .cse5 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse6 v_DerPreprocessor_1) .cse7 v_arrayElimArr_3) .cse6) .cse8 .cse7)) (not (= .cse6 .cse7)) (not (= .cse7 0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_24| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_20| Int)) (let ((.cse9 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_24|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int)) (= (select .cse9 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_24|)) (= (select .cse9 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_20| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_24|) (not (= 0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_24|))))))) is different from true [2025-01-09 17:23:08,462 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_23| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_19| Int)) (let ((.cse0 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_23|))) (and (not (= 0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_23|)) (= (select .cse0 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_19| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_23|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int)) (= (select .cse0 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_23|))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int) (v_arrayElimArr_3 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_19| Int)) (let ((.cse2 (select v_arrayElimArr_3 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|))) (let ((.cse3 (select |c_#memory_$Pointer$#2.base| .cse2)) (.cse4 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_19| 24))) (let ((.cse1 (select .cse3 .cse4))) (and (not (= .cse1 0)) (not (= .cse2 .cse1)) (= .cse3 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse2 v_DerPreprocessor_1) .cse1 v_arrayElimArr_3) .cse2) .cse4 .cse1)))))))) (let ((.cse8 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base|)) (.cse7 (+ |c_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset| 24))) (let ((.cse5 (select .cse8 .cse7))) (let ((.cse6 (= |c_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base| .cse5))) (or (and (not (= .cse5 0)) (not .cse6) (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int) (v_arrayElimArr_3 (Array Int Int))) (and (= |c_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base| (select v_arrayElimArr_3 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|)) (= (store (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base| v_DerPreprocessor_1) .cse5 v_arrayElimArr_3) |c_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base|) .cse7 .cse5) .cse8)))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int)) (= |c_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base| (select .cse8 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|))) .cse6 (not (= |c_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base| 0))))))) (or (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_20| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse10 (select v_arrayElimArr_3 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|))) (let ((.cse9 (select |c_#memory_$Pointer$#2.base| .cse10)) (.cse12 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_20| 24))) (let ((.cse11 (select .cse9 .cse12))) (and (= .cse9 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse10 v_DerPreprocessor_1) .cse11 v_arrayElimArr_3) .cse10) .cse12 .cse11)) (not (= .cse10 .cse11)) (not (= .cse11 0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_24| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_20| Int)) (let ((.cse13 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_24|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int)) (= (select .cse13 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_24|)) (= (select .cse13 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_20| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_24|) (not (= 0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_24|))))))) is different from true [2025-01-09 17:23:08,546 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_23| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_19| Int)) (let ((.cse0 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_23|))) (and (not (= 0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_23|)) (= (select .cse0 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_19| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_23|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int)) (= (select .cse0 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_23|))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int) (v_arrayElimArr_3 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_19| Int)) (let ((.cse2 (select v_arrayElimArr_3 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|))) (let ((.cse3 (select |c_#memory_$Pointer$#2.base| .cse2)) (.cse4 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_19| 24))) (let ((.cse1 (select .cse3 .cse4))) (and (not (= .cse1 0)) (not (= .cse2 .cse1)) (= .cse3 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse2 v_DerPreprocessor_1) .cse1 v_arrayElimArr_3) .cse2) .cse4 .cse1)))))))) (or (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_20| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse6 (select v_arrayElimArr_3 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|))) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| .cse6)) (.cse8 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_20| 24))) (let ((.cse7 (select .cse5 .cse8))) (and (= .cse5 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse6 v_DerPreprocessor_1) .cse7 v_arrayElimArr_3) .cse6) .cse8 .cse7)) (not (= .cse6 .cse7)) (not (= .cse7 0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_24| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_20| Int)) (let ((.cse9 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_24|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int)) (= (select .cse9 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_24|)) (= (select .cse9 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_20| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_24|) (not (= 0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_24|)))))) (let ((.cse10 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base|)) (.cse12 (+ |c_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset| 24))) (let ((.cse11 (select .cse10 .cse12))) (let ((.cse13 (= .cse11 |c_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base|))) (or (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int) (v_arrayElimArr_3 (Array Int Int))) (and (= .cse10 (store (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base| v_DerPreprocessor_1) .cse11 v_arrayElimArr_3) |c_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base|) .cse12 .cse11)) (= (select v_arrayElimArr_3 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|) |c_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base|))) (not (= .cse11 0)) (not .cse13)) (and (not (= |c_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base| 0)) .cse13 (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int)) (= (select .cse10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|) |c_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base|)))))))) is different from true [2025-01-09 17:23:08,624 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_23| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_19| Int)) (let ((.cse0 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_23|))) (and (not (= 0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_23|)) (= (select .cse0 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_19| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_23|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int)) (= (select .cse0 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_23|))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int) (v_arrayElimArr_3 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_19| Int)) (let ((.cse2 (select v_arrayElimArr_3 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|))) (let ((.cse3 (select |c_#memory_$Pointer$#2.base| .cse2)) (.cse4 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_19| 24))) (let ((.cse1 (select .cse3 .cse4))) (and (not (= .cse1 0)) (not (= .cse2 .cse1)) (= .cse3 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse2 v_DerPreprocessor_1) .cse1 v_arrayElimArr_3) .cse2) .cse4 .cse1)))))))) (or (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_20| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse6 (select v_arrayElimArr_3 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|))) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| .cse6)) (.cse8 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_20| 24))) (let ((.cse7 (select .cse5 .cse8))) (and (= .cse5 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse6 v_DerPreprocessor_1) .cse7 v_arrayElimArr_3) .cse6) .cse8 .cse7)) (not (= .cse6 .cse7)) (not (= .cse7 0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_24| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_20| Int)) (let ((.cse9 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_24|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int)) (= (select .cse9 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_24|)) (= (select .cse9 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_20| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_24|) (not (= 0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_24|)))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_20| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_17| Int)) (let ((.cse10 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_20|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_20| 0)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_20| (select .cse10 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_17| 24))) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int)) (= (select .cse10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_20|))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int) (v_arrayElimArr_3 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_17| Int)) (let ((.cse13 (select v_arrayElimArr_3 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|))) (let ((.cse12 (select |c_#memory_$Pointer$#2.base| .cse13)) (.cse14 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_17| 24))) (let ((.cse11 (select .cse12 .cse14))) (and (not (= .cse11 0)) (= .cse12 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse13 v_DerPreprocessor_1) .cse11 v_arrayElimArr_3) .cse13) .cse14 .cse11)) (not (= .cse13 .cse11))))))))) is different from true [2025-01-09 17:23:09,237 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_23| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_19| Int)) (let ((.cse0 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_23|))) (and (not (= 0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_23|)) (= (select .cse0 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_19| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_23|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int)) (= (select .cse0 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_23|))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int) (v_arrayElimArr_3 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_19| Int)) (let ((.cse2 (select v_arrayElimArr_3 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|))) (let ((.cse3 (select |c_#memory_$Pointer$#2.base| .cse2)) (.cse4 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_19| 24))) (let ((.cse1 (select .cse3 .cse4))) (and (not (= .cse1 0)) (not (= .cse2 .cse1)) (= .cse3 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse2 v_DerPreprocessor_1) .cse1 v_arrayElimArr_3) .cse2) .cse4 .cse1)))))))) (or (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_20| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse6 (select v_arrayElimArr_3 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|))) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| .cse6)) (.cse8 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_20| 24))) (let ((.cse7 (select .cse5 .cse8))) (and (= .cse5 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse6 v_DerPreprocessor_1) .cse7 v_arrayElimArr_3) .cse6) .cse8 .cse7)) (not (= .cse6 .cse7)) (not (= .cse7 0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_24| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_20| Int)) (let ((.cse9 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_24|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int)) (= (select .cse9 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_24|)) (= (select .cse9 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_20| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_24|) (not (= 0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_24|)))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_20| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_17| Int)) (let ((.cse10 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_20|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_20| 0)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_20| (select .cse10 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_17| 24))) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int)) (= (select .cse10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_20|))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int) (v_arrayElimArr_3 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_17| Int)) (let ((.cse13 (select v_arrayElimArr_3 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|))) (let ((.cse12 (select |c_#memory_$Pointer$#2.base| .cse13)) (.cse14 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_17| 24))) (let ((.cse11 (select .cse12 .cse14))) (and (not (= .cse11 0)) (= .cse12 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse13 v_DerPreprocessor_1) .cse11 v_arrayElimArr_3) .cse13) .cse14 .cse11)) (not (= .cse13 .cse11)))))))) (let ((.cse15 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base|)) (.cse17 (+ |c_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset| 24))) (let ((.cse16 (select .cse15 .cse17))) (let ((.cse18 (= .cse16 |c_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base|))) (or (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int) (v_arrayElimArr_3 (Array Int Int))) (and (= .cse15 (store (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base| v_DerPreprocessor_1) .cse16 v_arrayElimArr_3) |c_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base|) .cse17 .cse16)) (= (select v_arrayElimArr_3 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|) |c_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base|))) (not (= .cse16 0)) (not .cse18)) (and (not (= |c_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base| 0)) .cse18 (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int)) (= (select .cse15 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|) |c_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base|)))))))) is different from true [2025-01-09 17:23:09,323 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_23| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_19| Int)) (let ((.cse0 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_23|))) (and (not (= 0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_23|)) (= (select .cse0 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_19| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_23|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int)) (= (select .cse0 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_23|))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int) (v_arrayElimArr_3 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_19| Int)) (let ((.cse2 (select v_arrayElimArr_3 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|))) (let ((.cse3 (select |c_#memory_$Pointer$#2.base| .cse2)) (.cse4 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_19| 24))) (let ((.cse1 (select .cse3 .cse4))) (and (not (= .cse1 0)) (not (= .cse2 .cse1)) (= .cse3 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse2 v_DerPreprocessor_1) .cse1 v_arrayElimArr_3) .cse2) .cse4 .cse1)))))))) (or (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_20| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse6 (select v_arrayElimArr_3 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|))) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| .cse6)) (.cse8 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_20| 24))) (let ((.cse7 (select .cse5 .cse8))) (and (= .cse5 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse6 v_DerPreprocessor_1) .cse7 v_arrayElimArr_3) .cse6) .cse8 .cse7)) (not (= .cse6 .cse7)) (not (= .cse7 0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_24| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_20| Int)) (let ((.cse9 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_24|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int)) (= (select .cse9 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_24|)) (= (select .cse9 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_20| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_24|) (not (= 0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_24|)))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_21| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_18| Int)) (let ((.cse10 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_21|))) (and (= (select .cse10 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_18| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_21|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_21| (select .cse10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|))) (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_21| 0))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int) (v_arrayElimArr_3 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_18| Int)) (let ((.cse12 (select v_arrayElimArr_3 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|))) (let ((.cse11 (select |c_#memory_$Pointer$#2.base| .cse12)) (.cse14 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_18| 24))) (let ((.cse13 (select .cse11 .cse14))) (and (= .cse11 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse12 v_DerPreprocessor_1) .cse13 v_arrayElimArr_3) .cse12) .cse14 .cse13)) (not (= .cse13 0)) (not (= .cse12 .cse13)))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_20| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_17| Int)) (let ((.cse15 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_20|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_20| 0)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_20| (select .cse15 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_17| 24))) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int)) (= (select .cse15 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_20|))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int) (v_arrayElimArr_3 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_17| Int)) (let ((.cse18 (select v_arrayElimArr_3 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|))) (let ((.cse17 (select |c_#memory_$Pointer$#2.base| .cse18)) (.cse19 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_17| 24))) (let ((.cse16 (select .cse17 .cse19))) (and (not (= .cse16 0)) (= .cse17 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse18 v_DerPreprocessor_1) .cse16 v_arrayElimArr_3) .cse18) .cse19 .cse16)) (not (= .cse18 .cse16))))))))) is different from true [2025-01-09 17:23:09,616 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_23| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_19| Int)) (let ((.cse0 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_23|))) (and (not (= 0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_23|)) (= (select .cse0 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_19| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_23|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int)) (= (select .cse0 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_23|))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int) (v_arrayElimArr_3 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_19| Int)) (let ((.cse2 (select v_arrayElimArr_3 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|))) (let ((.cse3 (select |c_#memory_$Pointer$#2.base| .cse2)) (.cse4 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_19| 24))) (let ((.cse1 (select .cse3 .cse4))) (and (not (= .cse1 0)) (not (= .cse2 .cse1)) (= .cse3 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse2 v_DerPreprocessor_1) .cse1 v_arrayElimArr_3) .cse2) .cse4 .cse1)))))))) (or (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_20| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse6 (select v_arrayElimArr_3 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|))) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| .cse6)) (.cse8 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_20| 24))) (let ((.cse7 (select .cse5 .cse8))) (and (= .cse5 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse6 v_DerPreprocessor_1) .cse7 v_arrayElimArr_3) .cse6) .cse8 .cse7)) (not (= .cse6 .cse7)) (not (= .cse7 0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_24| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_20| Int)) (let ((.cse9 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_24|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int)) (= (select .cse9 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_24|)) (= (select .cse9 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_20| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_24|) (not (= 0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_24|)))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_21| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_18| Int)) (let ((.cse10 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_21|))) (and (= (select .cse10 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_18| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_21|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_21| (select .cse10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|))) (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_21| 0))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int) (v_arrayElimArr_3 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_18| Int)) (let ((.cse12 (select v_arrayElimArr_3 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|))) (let ((.cse11 (select |c_#memory_$Pointer$#2.base| .cse12)) (.cse14 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_18| 24))) (let ((.cse13 (select .cse11 .cse14))) (and (= .cse11 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse12 v_DerPreprocessor_1) .cse13 v_arrayElimArr_3) .cse12) .cse14 .cse13)) (not (= .cse13 0)) (not (= .cse12 .cse13)))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_20| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_17| Int)) (let ((.cse15 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_20|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_20| 0)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_20| (select .cse15 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_17| 24))) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int)) (= (select .cse15 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_20|))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int) (v_arrayElimArr_3 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_17| Int)) (let ((.cse18 (select v_arrayElimArr_3 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|))) (let ((.cse17 (select |c_#memory_$Pointer$#2.base| .cse18)) (.cse19 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_17| 24))) (let ((.cse16 (select .cse17 .cse19))) (and (not (= .cse16 0)) (= .cse17 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse18 v_DerPreprocessor_1) .cse16 v_arrayElimArr_3) .cse18) .cse19 .cse16)) (not (= .cse18 .cse16)))))))) (let ((.cse20 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base|)) (.cse22 (+ |c_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset| 24))) (let ((.cse21 (select .cse20 .cse22))) (let ((.cse23 (= .cse21 |c_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base|))) (or (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int) (v_arrayElimArr_3 (Array Int Int))) (and (= .cse20 (store (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base| v_DerPreprocessor_1) .cse21 v_arrayElimArr_3) |c_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base|) .cse22 .cse21)) (= (select v_arrayElimArr_3 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|) |c_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base|))) (not (= .cse21 0)) (not .cse23)) (and (not (= |c_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base| 0)) .cse23 (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int)) (= (select .cse20 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|) |c_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base|)))))))) is different from true [2025-01-09 17:23:09,792 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_22| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_19| Int)) (let ((.cse0 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_22|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_22| 0)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_22| (select .cse0 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_19| 24))) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_22| (select .cse0 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|)))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int) (v_arrayElimArr_3 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_19| Int)) (let ((.cse3 (select v_arrayElimArr_3 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|))) (let ((.cse2 (select |c_#memory_$Pointer$#2.base| .cse3)) (.cse4 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_19| 24))) (let ((.cse1 (select .cse2 .cse4))) (and (not (= .cse1 0)) (= .cse2 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse3 v_DerPreprocessor_1) .cse1 v_arrayElimArr_3) .cse3) .cse4 .cse1)) (not (= .cse3 .cse1)))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_23| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_19| Int)) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_23|))) (and (not (= 0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_23|)) (= (select .cse5 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_19| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_23|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int)) (= (select .cse5 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_23|))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int) (v_arrayElimArr_3 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_19| Int)) (let ((.cse7 (select v_arrayElimArr_3 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|))) (let ((.cse8 (select |c_#memory_$Pointer$#2.base| .cse7)) (.cse9 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_19| 24))) (let ((.cse6 (select .cse8 .cse9))) (and (not (= .cse6 0)) (not (= .cse7 .cse6)) (= .cse8 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse7 v_DerPreprocessor_1) .cse6 v_arrayElimArr_3) .cse7) .cse9 .cse6)))))))) (or (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_20| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse11 (select v_arrayElimArr_3 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|))) (let ((.cse10 (select |c_#memory_$Pointer$#2.base| .cse11)) (.cse13 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_20| 24))) (let ((.cse12 (select .cse10 .cse13))) (and (= .cse10 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse11 v_DerPreprocessor_1) .cse12 v_arrayElimArr_3) .cse11) .cse13 .cse12)) (not (= .cse11 .cse12)) (not (= .cse12 0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_24| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_20| Int)) (let ((.cse14 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_24|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int)) (= (select .cse14 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_24|)) (= (select .cse14 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_20| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_24|) (not (= 0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_24|)))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_21| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_18| Int)) (let ((.cse15 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_21|))) (and (= (select .cse15 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_18| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_21|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_21| (select .cse15 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|))) (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_21| 0))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int) (v_arrayElimArr_3 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_18| Int)) (let ((.cse17 (select v_arrayElimArr_3 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|))) (let ((.cse16 (select |c_#memory_$Pointer$#2.base| .cse17)) (.cse19 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_18| 24))) (let ((.cse18 (select .cse16 .cse19))) (and (= .cse16 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse17 v_DerPreprocessor_1) .cse18 v_arrayElimArr_3) .cse17) .cse19 .cse18)) (not (= .cse18 0)) (not (= .cse17 .cse18)))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_20| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_17| Int)) (let ((.cse20 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_20|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_20| 0)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_20| (select .cse20 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_17| 24))) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int)) (= (select .cse20 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_20|))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int) (v_arrayElimArr_3 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_17| Int)) (let ((.cse23 (select v_arrayElimArr_3 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|))) (let ((.cse22 (select |c_#memory_$Pointer$#2.base| .cse23)) (.cse24 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_17| 24))) (let ((.cse21 (select .cse22 .cse24))) (and (not (= .cse21 0)) (= .cse22 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse23 v_DerPreprocessor_1) .cse21 v_arrayElimArr_3) .cse23) .cse24 .cse21)) (not (= .cse23 .cse21))))))))) is different from true [2025-01-09 17:23:10,632 WARN L873 $PredicateComparison]: unable to prove that (and (or |c_aws_linked_list_is_valid_#t~short308#1| (= 0 (select (select |c_#memory_$Pointer$#2.base| |c_aws_linked_list_is_valid_#in~list#1.base|) (+ |c_aws_linked_list_is_valid_#in~list#1.offset| 24)))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_22| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_19| Int)) (let ((.cse0 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_22|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_22| 0)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_22| (select .cse0 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_19| 24))) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_22| (select .cse0 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|)))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int) (v_arrayElimArr_3 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_19| Int)) (let ((.cse3 (select v_arrayElimArr_3 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|))) (let ((.cse2 (select |c_#memory_$Pointer$#2.base| .cse3)) (.cse4 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_19| 24))) (let ((.cse1 (select .cse2 .cse4))) (and (not (= .cse1 0)) (= .cse2 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse3 v_DerPreprocessor_1) .cse1 v_arrayElimArr_3) .cse3) .cse4 .cse1)) (not (= .cse3 .cse1)))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_23| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_19| Int)) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_23|))) (and (not (= 0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_23|)) (= (select .cse5 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_19| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_23|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int)) (= (select .cse5 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_23|))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int) (v_arrayElimArr_3 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_19| Int)) (let ((.cse7 (select v_arrayElimArr_3 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|))) (let ((.cse8 (select |c_#memory_$Pointer$#2.base| .cse7)) (.cse9 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_19| 24))) (let ((.cse6 (select .cse8 .cse9))) (and (not (= .cse6 0)) (not (= .cse7 .cse6)) (= .cse8 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse7 v_DerPreprocessor_1) .cse6 v_arrayElimArr_3) .cse7) .cse9 .cse6)))))))) (or (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_20| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse11 (select v_arrayElimArr_3 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|))) (let ((.cse10 (select |c_#memory_$Pointer$#2.base| .cse11)) (.cse13 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_20| 24))) (let ((.cse12 (select .cse10 .cse13))) (and (= .cse10 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse11 v_DerPreprocessor_1) .cse12 v_arrayElimArr_3) .cse11) .cse13 .cse12)) (not (= .cse11 .cse12)) (not (= .cse12 0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_24| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_20| Int)) (let ((.cse14 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_24|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int)) (= (select .cse14 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_24|)) (= (select .cse14 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_20| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_24|) (not (= 0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_24|)))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_21| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_18| Int)) (let ((.cse15 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_21|))) (and (= (select .cse15 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_18| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_21|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_21| (select .cse15 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|))) (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_21| 0))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int) (v_arrayElimArr_3 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_18| Int)) (let ((.cse17 (select v_arrayElimArr_3 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|))) (let ((.cse16 (select |c_#memory_$Pointer$#2.base| .cse17)) (.cse19 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_18| 24))) (let ((.cse18 (select .cse16 .cse19))) (and (= .cse16 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse17 v_DerPreprocessor_1) .cse18 v_arrayElimArr_3) .cse17) .cse19 .cse18)) (not (= .cse18 0)) (not (= .cse17 .cse18)))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_20| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_17| Int)) (let ((.cse20 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_20|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_20| 0)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_20| (select .cse20 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_17| 24))) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int)) (= (select .cse20 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_20|))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int) (v_arrayElimArr_3 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_17| Int)) (let ((.cse23 (select v_arrayElimArr_3 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|))) (let ((.cse22 (select |c_#memory_$Pointer$#2.base| .cse23)) (.cse24 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_17| 24))) (let ((.cse21 (select .cse22 .cse24))) (and (not (= .cse21 0)) (= .cse22 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse23 v_DerPreprocessor_1) .cse21 v_arrayElimArr_3) .cse23) .cse24 .cse21)) (not (= .cse23 .cse21))))))))) is different from true [2025-01-09 17:23:10,716 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_22| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_19| Int)) (let ((.cse0 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_22|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_22| 0)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_22| (select .cse0 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_19| 24))) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_22| (select .cse0 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|)))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int) (v_arrayElimArr_3 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_19| Int)) (let ((.cse3 (select v_arrayElimArr_3 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|))) (let ((.cse2 (select |c_#memory_$Pointer$#2.base| .cse3)) (.cse4 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_19| 24))) (let ((.cse1 (select .cse2 .cse4))) (and (not (= .cse1 0)) (= .cse2 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse3 v_DerPreprocessor_1) .cse1 v_arrayElimArr_3) .cse3) .cse4 .cse1)) (not (= .cse3 .cse1)))))))) (or |c_aws_linked_list_is_valid_#t~short310#1| (= 0 (select (select |c_#memory_$Pointer$#2.base| |c_aws_linked_list_is_valid_#in~list#1.base|) (+ |c_aws_linked_list_is_valid_#in~list#1.offset| 24)))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_23| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_19| Int)) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_23|))) (and (not (= 0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_23|)) (= (select .cse5 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_19| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_23|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int)) (= (select .cse5 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_23|))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int) (v_arrayElimArr_3 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_19| Int)) (let ((.cse7 (select v_arrayElimArr_3 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|))) (let ((.cse8 (select |c_#memory_$Pointer$#2.base| .cse7)) (.cse9 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_19| 24))) (let ((.cse6 (select .cse8 .cse9))) (and (not (= .cse6 0)) (not (= .cse7 .cse6)) (= .cse8 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse7 v_DerPreprocessor_1) .cse6 v_arrayElimArr_3) .cse7) .cse9 .cse6)))))))) (or (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_20| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse11 (select v_arrayElimArr_3 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|))) (let ((.cse10 (select |c_#memory_$Pointer$#2.base| .cse11)) (.cse13 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_20| 24))) (let ((.cse12 (select .cse10 .cse13))) (and (= .cse10 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse11 v_DerPreprocessor_1) .cse12 v_arrayElimArr_3) .cse11) .cse13 .cse12)) (not (= .cse11 .cse12)) (not (= .cse12 0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_24| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_20| Int)) (let ((.cse14 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_24|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int)) (= (select .cse14 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_24|)) (= (select .cse14 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_20| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_24|) (not (= 0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_24|)))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_21| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_18| Int)) (let ((.cse15 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_21|))) (and (= (select .cse15 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_18| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_21|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_21| (select .cse15 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|))) (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_21| 0))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int) (v_arrayElimArr_3 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_18| Int)) (let ((.cse17 (select v_arrayElimArr_3 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|))) (let ((.cse16 (select |c_#memory_$Pointer$#2.base| .cse17)) (.cse19 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_18| 24))) (let ((.cse18 (select .cse16 .cse19))) (and (= .cse16 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse17 v_DerPreprocessor_1) .cse18 v_arrayElimArr_3) .cse17) .cse19 .cse18)) (not (= .cse18 0)) (not (= .cse17 .cse18)))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_20| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_17| Int)) (let ((.cse20 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_20|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_20| 0)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_20| (select .cse20 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_17| 24))) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int)) (= (select .cse20 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_20|))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int) (v_arrayElimArr_3 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_17| Int)) (let ((.cse23 (select v_arrayElimArr_3 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|))) (let ((.cse22 (select |c_#memory_$Pointer$#2.base| .cse23)) (.cse24 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_17| 24))) (let ((.cse21 (select .cse22 .cse24))) (and (not (= .cse21 0)) (= .cse22 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse23 v_DerPreprocessor_1) .cse21 v_arrayElimArr_3) .cse23) .cse24 .cse21)) (not (= .cse23 .cse21))))))))) is different from true [2025-01-09 17:23:10,807 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_22| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_19| Int)) (let ((.cse0 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_22|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_22| 0)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_22| (select .cse0 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_19| 24))) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_22| (select .cse0 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|)))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int) (v_arrayElimArr_3 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_19| Int)) (let ((.cse3 (select v_arrayElimArr_3 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|))) (let ((.cse2 (select |c_#memory_$Pointer$#2.base| .cse3)) (.cse4 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_19| 24))) (let ((.cse1 (select .cse2 .cse4))) (and (not (= .cse1 0)) (= .cse2 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse3 v_DerPreprocessor_1) .cse1 v_arrayElimArr_3) .cse3) .cse4 .cse1)) (not (= .cse3 .cse1)))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_23| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_19| Int)) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_23|))) (and (not (= 0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_23|)) (= (select .cse5 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_19| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_23|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int)) (= (select .cse5 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_23|))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int) (v_arrayElimArr_3 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_19| Int)) (let ((.cse7 (select v_arrayElimArr_3 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|))) (let ((.cse8 (select |c_#memory_$Pointer$#2.base| .cse7)) (.cse9 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_19| 24))) (let ((.cse6 (select .cse8 .cse9))) (and (not (= .cse6 0)) (not (= .cse7 .cse6)) (= .cse8 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse7 v_DerPreprocessor_1) .cse6 v_arrayElimArr_3) .cse7) .cse9 .cse6)))))))) (or (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_20| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse11 (select v_arrayElimArr_3 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|))) (let ((.cse10 (select |c_#memory_$Pointer$#2.base| .cse11)) (.cse13 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_20| 24))) (let ((.cse12 (select .cse10 .cse13))) (and (= .cse10 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse11 v_DerPreprocessor_1) .cse12 v_arrayElimArr_3) .cse11) .cse13 .cse12)) (not (= .cse11 .cse12)) (not (= .cse12 0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_24| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_20| Int)) (let ((.cse14 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_24|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int)) (= (select .cse14 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_24|)) (= (select .cse14 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_20| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_24|) (not (= 0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_24|)))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_21| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_18| Int)) (let ((.cse15 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_21|))) (and (= (select .cse15 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_18| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_21|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_21| (select .cse15 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|))) (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_21| 0))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int) (v_arrayElimArr_3 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_18| Int)) (let ((.cse17 (select v_arrayElimArr_3 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|))) (let ((.cse16 (select |c_#memory_$Pointer$#2.base| .cse17)) (.cse19 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_18| 24))) (let ((.cse18 (select .cse16 .cse19))) (and (= .cse16 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse17 v_DerPreprocessor_1) .cse18 v_arrayElimArr_3) .cse17) .cse19 .cse18)) (not (= .cse18 0)) (not (= .cse17 .cse18)))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_20| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_17| Int)) (let ((.cse20 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_20|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_20| 0)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_20| (select .cse20 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_17| 24))) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int)) (= (select .cse20 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_20|))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int) (v_arrayElimArr_3 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_17| Int)) (let ((.cse23 (select v_arrayElimArr_3 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|))) (let ((.cse22 (select |c_#memory_$Pointer$#2.base| .cse23)) (.cse24 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_17| 24))) (let ((.cse21 (select .cse22 .cse24))) (and (not (= .cse21 0)) (= .cse22 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse23 v_DerPreprocessor_1) .cse21 v_arrayElimArr_3) .cse23) .cse24 .cse21)) (not (= .cse23 .cse21)))))))) (= 0 (select (select |c_#memory_$Pointer$#2.base| |c_aws_linked_list_is_valid_#in~list#1.base|) (+ |c_aws_linked_list_is_valid_#in~list#1.offset| 24)))) is different from true [2025-01-09 17:23:11,017 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 129 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 29 not checked. [2025-01-09 17:23:11,018 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 17:23:11,411 INFO L349 Elim1Store]: treesize reduction 19, result has 62.0 percent of original size [2025-01-09 17:23:11,411 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 198 treesize of output 185 [2025-01-09 17:23:11,437 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 17:23:11,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 103 treesize of output 119 [2025-01-09 17:23:11,444 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 68 treesize of output 64 [2025-01-09 17:23:11,510 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 6 treesize of output 4 [2025-01-09 17:23:11,524 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 17:23:11,525 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 60 treesize of output 60 [2025-01-09 17:23:11,562 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 1 proven. 20 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2025-01-09 17:23:11,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [433723646] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 17:23:11,562 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 17:23:11,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 19, 10] total 29 [2025-01-09 17:23:11,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219537217] [2025-01-09 17:23:11,563 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 17:23:11,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-01-09 17:23:11,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:23:11,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-01-09 17:23:11,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=188, Unknown=18, NotChecked=546, Total=812 [2025-01-09 17:23:11,564 INFO L87 Difference]: Start difference. First operand 244 states and 338 transitions. Second operand has 29 states, 25 states have (on average 4.2) internal successors, (105), 24 states have internal predecessors, (105), 13 states have call successors, (39), 7 states have call predecessors, (39), 10 states have return successors, (38), 12 states have call predecessors, (38), 13 states have call successors, (38) [2025-01-09 17:23:11,747 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base|)) (.cse3 (+ |c_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset| 24))) (let ((.cse2 (select .cse4 .cse3))) (let ((.cse0 (not (= .cse2 0)))) (and .cse0 (let ((.cse1 (= |c_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base| .cse2))) (or (and .cse0 (not .cse1) (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int) (v_arrayElimArr_3 (Array Int Int))) (and (= |c_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base| (select v_arrayElimArr_3 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|)) (= (store (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base| v_DerPreprocessor_1) .cse2 v_arrayElimArr_3) |c_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base|) .cse3 .cse2) .cse4)))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int)) (= |c_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base| (select .cse4 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|))) .cse1 (not (= |c_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base| 0))))))))) is different from true [2025-01-09 17:23:11,807 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_23| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_19| Int)) (let ((.cse0 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_23|))) (and (not (= 0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_23|)) (= (select .cse0 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_19| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_23|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int)) (= (select .cse0 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_23|))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int) (v_arrayElimArr_3 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_19| Int)) (let ((.cse2 (select v_arrayElimArr_3 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|))) (let ((.cse3 (select |c_#memory_$Pointer$#2.base| .cse2)) (.cse4 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_19| 24))) (let ((.cse1 (select .cse3 .cse4))) (and (not (= .cse1 0)) (not (= .cse2 .cse1)) (= .cse3 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse2 v_DerPreprocessor_1) .cse1 v_arrayElimArr_3) .cse2) .cse4 .cse1)))))))) (not (= |c_assume_abort_if_not_#in~cond| 0))) is different from true [2025-01-09 17:23:11,836 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base|)) (.cse8 (+ |c_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset| 24))) (let ((.cse7 (select .cse9 .cse8))) (let ((.cse0 (not (= .cse7 0)))) (and .cse0 (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_23| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_19| Int)) (let ((.cse1 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_23|))) (and (not (= 0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_23|)) (= (select .cse1 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_19| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_23|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int)) (= (select .cse1 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_23|))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int) (v_arrayElimArr_3 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_19| Int)) (let ((.cse3 (select v_arrayElimArr_3 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|))) (let ((.cse4 (select |c_#memory_$Pointer$#2.base| .cse3)) (.cse5 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_19| 24))) (let ((.cse2 (select .cse4 .cse5))) (and (not (= .cse2 0)) (not (= .cse3 .cse2)) (= .cse4 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse3 v_DerPreprocessor_1) .cse2 v_arrayElimArr_3) .cse3) .cse5 .cse2)))))))) (let ((.cse6 (= |c_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base| .cse7))) (or (and .cse0 (not .cse6) (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int) (v_arrayElimArr_3 (Array Int Int))) (and (= |c_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base| (select v_arrayElimArr_3 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|)) (= (store (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base| v_DerPreprocessor_1) .cse7 v_arrayElimArr_3) |c_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base|) .cse8 .cse7) .cse9)))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int)) (= |c_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base| (select .cse9 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|))) .cse6 (not (= |c_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base| 0))))))))) is different from true [2025-01-09 17:23:11,921 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_23| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_19| Int)) (let ((.cse0 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_23|))) (and (not (= 0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_23|)) (= (select .cse0 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_19| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_23|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int)) (= (select .cse0 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_23|))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int) (v_arrayElimArr_3 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_19| Int)) (let ((.cse2 (select v_arrayElimArr_3 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|))) (let ((.cse3 (select |c_#memory_$Pointer$#2.base| .cse2)) (.cse4 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_19| 24))) (let ((.cse1 (select .cse3 .cse4))) (and (not (= .cse1 0)) (not (= .cse2 .cse1)) (= .cse3 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse2 v_DerPreprocessor_1) .cse1 v_arrayElimArr_3) .cse2) .cse4 .cse1)))))))) (or (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_20| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse6 (select v_arrayElimArr_3 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|))) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| .cse6)) (.cse8 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_20| 24))) (let ((.cse7 (select .cse5 .cse8))) (and (= .cse5 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse6 v_DerPreprocessor_1) .cse7 v_arrayElimArr_3) .cse6) .cse8 .cse7)) (not (= .cse6 .cse7)) (not (= .cse7 0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_24| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_20| Int)) (let ((.cse9 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_24|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int)) (= (select .cse9 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_24|)) (= (select .cse9 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_20| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_24|) (not (= 0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_24|)))))) (not (= |c_assume_abort_if_not_#in~cond| 0))) is different from true [2025-01-09 17:23:11,934 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base|)) (.cse8 (+ |c_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset| 24))) (let ((.cse7 (select .cse9 .cse8))) (let ((.cse0 (not (= .cse7 0)))) (and .cse0 (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_23| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_19| Int)) (let ((.cse1 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_23|))) (and (not (= 0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_23|)) (= (select .cse1 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_19| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_23|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int)) (= (select .cse1 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_23|))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int) (v_arrayElimArr_3 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_19| Int)) (let ((.cse3 (select v_arrayElimArr_3 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|))) (let ((.cse4 (select |c_#memory_$Pointer$#2.base| .cse3)) (.cse5 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_19| 24))) (let ((.cse2 (select .cse4 .cse5))) (and (not (= .cse2 0)) (not (= .cse3 .cse2)) (= .cse4 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse3 v_DerPreprocessor_1) .cse2 v_arrayElimArr_3) .cse3) .cse5 .cse2)))))))) (let ((.cse6 (= |c_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base| .cse7))) (or (and .cse0 (not .cse6) (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int) (v_arrayElimArr_3 (Array Int Int))) (and (= |c_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base| (select v_arrayElimArr_3 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|)) (= (store (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base| v_DerPreprocessor_1) .cse7 v_arrayElimArr_3) |c_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base|) .cse8 .cse7) .cse9)))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int)) (= |c_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base| (select .cse9 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|))) .cse6 (not (= |c_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base| 0))))) (or (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_20| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse11 (select v_arrayElimArr_3 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|))) (let ((.cse10 (select |c_#memory_$Pointer$#2.base| .cse11)) (.cse13 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_20| 24))) (let ((.cse12 (select .cse10 .cse13))) (and (= .cse10 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse11 v_DerPreprocessor_1) .cse12 v_arrayElimArr_3) .cse11) .cse13 .cse12)) (not (= .cse11 .cse12)) (not (= .cse12 0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_24| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_20| Int)) (let ((.cse14 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_24|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int)) (= (select .cse14 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_24|)) (= (select .cse14 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_20| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_24|) (not (= 0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_24|)))))))))) is different from true [2025-01-09 17:23:11,946 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse11 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base|)) (.cse13 (+ |c_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset| 24))) (let ((.cse12 (select .cse11 .cse13))) (let ((.cse0 (not (= .cse12 0)))) (and .cse0 (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_23| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_19| Int)) (let ((.cse1 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_23|))) (and (not (= 0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_23|)) (= (select .cse1 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_19| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_23|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int)) (= (select .cse1 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_23|))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int) (v_arrayElimArr_3 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_19| Int)) (let ((.cse3 (select v_arrayElimArr_3 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|))) (let ((.cse4 (select |c_#memory_$Pointer$#2.base| .cse3)) (.cse5 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_19| 24))) (let ((.cse2 (select .cse4 .cse5))) (and (not (= .cse2 0)) (not (= .cse3 .cse2)) (= .cse4 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse3 v_DerPreprocessor_1) .cse2 v_arrayElimArr_3) .cse3) .cse5 .cse2)))))))) (or (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_20| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse7 (select v_arrayElimArr_3 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|))) (let ((.cse6 (select |c_#memory_$Pointer$#2.base| .cse7)) (.cse9 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_20| 24))) (let ((.cse8 (select .cse6 .cse9))) (and (= .cse6 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse7 v_DerPreprocessor_1) .cse8 v_arrayElimArr_3) .cse7) .cse9 .cse8)) (not (= .cse7 .cse8)) (not (= .cse8 0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_24| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_20| Int)) (let ((.cse10 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_24|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int)) (= (select .cse10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_24|)) (= (select .cse10 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_20| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_24|) (not (= 0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_24|)))))) (let ((.cse14 (= .cse12 |c_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base|))) (or (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int) (v_arrayElimArr_3 (Array Int Int))) (and (= .cse11 (store (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base| v_DerPreprocessor_1) .cse12 v_arrayElimArr_3) |c_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base|) .cse13 .cse12)) (= (select v_arrayElimArr_3 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|) |c_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base|))) .cse0 (not .cse14)) (and (not (= |c_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base| 0)) .cse14 (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int)) (= (select .cse11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|) |c_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base|))))))))) is different from true [2025-01-09 17:23:11,961 WARN L873 $PredicateComparison]: unable to prove that (and (= c_assume_abort_if_not_~cond |c_assume_abort_if_not_#in~cond|) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_23| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_19| Int)) (let ((.cse0 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_23|))) (and (not (= 0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_23|)) (= (select .cse0 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_19| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_23|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int)) (= (select .cse0 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_23|))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int) (v_arrayElimArr_3 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_19| Int)) (let ((.cse2 (select v_arrayElimArr_3 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|))) (let ((.cse3 (select |c_#memory_$Pointer$#2.base| .cse2)) (.cse4 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_19| 24))) (let ((.cse1 (select .cse3 .cse4))) (and (not (= .cse1 0)) (not (= .cse2 .cse1)) (= .cse3 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse2 v_DerPreprocessor_1) .cse1 v_arrayElimArr_3) .cse2) .cse4 .cse1)))))))) (or (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_20| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse6 (select v_arrayElimArr_3 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|))) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| .cse6)) (.cse8 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_20| 24))) (let ((.cse7 (select .cse5 .cse8))) (and (= .cse5 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse6 v_DerPreprocessor_1) .cse7 v_arrayElimArr_3) .cse6) .cse8 .cse7)) (not (= .cse6 .cse7)) (not (= .cse7 0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_24| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_20| Int)) (let ((.cse9 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_24|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int)) (= (select .cse9 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_24|)) (= (select .cse9 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_20| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_24|) (not (= 0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_24|)))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_20| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_17| Int)) (let ((.cse10 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_20|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_20| 0)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_20| (select .cse10 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_17| 24))) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int)) (= (select .cse10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_20|))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int) (v_arrayElimArr_3 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_17| Int)) (let ((.cse13 (select v_arrayElimArr_3 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|))) (let ((.cse12 (select |c_#memory_$Pointer$#2.base| .cse13)) (.cse14 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_17| 24))) (let ((.cse11 (select .cse12 .cse14))) (and (not (= .cse11 0)) (= .cse12 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse13 v_DerPreprocessor_1) .cse11 v_arrayElimArr_3) .cse13) .cse14 .cse11)) (not (= .cse13 .cse11))))))))) is different from true [2025-01-09 17:23:11,973 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_23| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_19| Int)) (let ((.cse0 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_23|))) (and (not (= 0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_23|)) (= (select .cse0 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_19| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_23|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int)) (= (select .cse0 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_23|))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int) (v_arrayElimArr_3 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_19| Int)) (let ((.cse2 (select v_arrayElimArr_3 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|))) (let ((.cse3 (select |c_#memory_$Pointer$#2.base| .cse2)) (.cse4 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_19| 24))) (let ((.cse1 (select .cse3 .cse4))) (and (not (= .cse1 0)) (not (= .cse2 .cse1)) (= .cse3 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse2 v_DerPreprocessor_1) .cse1 v_arrayElimArr_3) .cse2) .cse4 .cse1)))))))) (or (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_20| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse6 (select v_arrayElimArr_3 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|))) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| .cse6)) (.cse8 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_20| 24))) (let ((.cse7 (select .cse5 .cse8))) (and (= .cse5 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse6 v_DerPreprocessor_1) .cse7 v_arrayElimArr_3) .cse6) .cse8 .cse7)) (not (= .cse6 .cse7)) (not (= .cse7 0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_24| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_20| Int)) (let ((.cse9 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_24|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int)) (= (select .cse9 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_24|)) (= (select .cse9 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_20| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_24|) (not (= 0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_24|)))))) (not (= |c_assume_abort_if_not_#in~cond| 0)) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_20| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_17| Int)) (let ((.cse10 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_20|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_20| 0)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_20| (select .cse10 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_17| 24))) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int)) (= (select .cse10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_20|))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int) (v_arrayElimArr_3 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_17| Int)) (let ((.cse13 (select v_arrayElimArr_3 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|))) (let ((.cse12 (select |c_#memory_$Pointer$#2.base| .cse13)) (.cse14 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_17| 24))) (let ((.cse11 (select .cse12 .cse14))) (and (not (= .cse11 0)) (= .cse12 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse13 v_DerPreprocessor_1) .cse11 v_arrayElimArr_3) .cse13) .cse14 .cse11)) (not (= .cse13 .cse11))))))))) is different from true [2025-01-09 17:23:11,988 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse16 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base|)) (.cse18 (+ |c_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset| 24))) (let ((.cse17 (select .cse16 .cse18))) (let ((.cse0 (not (= .cse17 0)))) (and .cse0 (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_23| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_19| Int)) (let ((.cse1 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_23|))) (and (not (= 0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_23|)) (= (select .cse1 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_19| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_23|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int)) (= (select .cse1 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_23|))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int) (v_arrayElimArr_3 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_19| Int)) (let ((.cse3 (select v_arrayElimArr_3 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|))) (let ((.cse4 (select |c_#memory_$Pointer$#2.base| .cse3)) (.cse5 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_19| 24))) (let ((.cse2 (select .cse4 .cse5))) (and (not (= .cse2 0)) (not (= .cse3 .cse2)) (= .cse4 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse3 v_DerPreprocessor_1) .cse2 v_arrayElimArr_3) .cse3) .cse5 .cse2)))))))) (or (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_20| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse7 (select v_arrayElimArr_3 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|))) (let ((.cse6 (select |c_#memory_$Pointer$#2.base| .cse7)) (.cse9 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_20| 24))) (let ((.cse8 (select .cse6 .cse9))) (and (= .cse6 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse7 v_DerPreprocessor_1) .cse8 v_arrayElimArr_3) .cse7) .cse9 .cse8)) (not (= .cse7 .cse8)) (not (= .cse8 0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_24| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_20| Int)) (let ((.cse10 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_24|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int)) (= (select .cse10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_24|)) (= (select .cse10 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_20| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_24|) (not (= 0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_24|)))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_20| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_17| Int)) (let ((.cse11 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_20|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_20| 0)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_20| (select .cse11 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_17| 24))) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int)) (= (select .cse11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_20|))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int) (v_arrayElimArr_3 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_17| Int)) (let ((.cse14 (select v_arrayElimArr_3 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|))) (let ((.cse13 (select |c_#memory_$Pointer$#2.base| .cse14)) (.cse15 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_17| 24))) (let ((.cse12 (select .cse13 .cse15))) (and (not (= .cse12 0)) (= .cse13 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse14 v_DerPreprocessor_1) .cse12 v_arrayElimArr_3) .cse14) .cse15 .cse12)) (not (= .cse14 .cse12)))))))) (let ((.cse19 (= .cse17 |c_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base|))) (or (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int) (v_arrayElimArr_3 (Array Int Int))) (and (= .cse16 (store (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base| v_DerPreprocessor_1) .cse17 v_arrayElimArr_3) |c_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base|) .cse18 .cse17)) (= (select v_arrayElimArr_3 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|) |c_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base|))) .cse0 (not .cse19)) (and (not (= |c_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base| 0)) .cse19 (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int)) (= (select .cse16 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|) |c_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base|))))))))) is different from true [2025-01-09 17:23:12,003 WARN L873 $PredicateComparison]: unable to prove that (and (= c_assume_abort_if_not_~cond |c_assume_abort_if_not_#in~cond|) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_23| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_19| Int)) (let ((.cse0 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_23|))) (and (not (= 0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_23|)) (= (select .cse0 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_19| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_23|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int)) (= (select .cse0 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_23|))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int) (v_arrayElimArr_3 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_19| Int)) (let ((.cse2 (select v_arrayElimArr_3 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|))) (let ((.cse3 (select |c_#memory_$Pointer$#2.base| .cse2)) (.cse4 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_19| 24))) (let ((.cse1 (select .cse3 .cse4))) (and (not (= .cse1 0)) (not (= .cse2 .cse1)) (= .cse3 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse2 v_DerPreprocessor_1) .cse1 v_arrayElimArr_3) .cse2) .cse4 .cse1)))))))) (or (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_20| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse6 (select v_arrayElimArr_3 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|))) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| .cse6)) (.cse8 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_20| 24))) (let ((.cse7 (select .cse5 .cse8))) (and (= .cse5 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse6 v_DerPreprocessor_1) .cse7 v_arrayElimArr_3) .cse6) .cse8 .cse7)) (not (= .cse6 .cse7)) (not (= .cse7 0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_24| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_20| Int)) (let ((.cse9 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_24|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int)) (= (select .cse9 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_24|)) (= (select .cse9 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_20| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_24|) (not (= 0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_24|)))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_21| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_18| Int)) (let ((.cse10 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_21|))) (and (= (select .cse10 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_18| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_21|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_21| (select .cse10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|))) (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_21| 0))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int) (v_arrayElimArr_3 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_18| Int)) (let ((.cse12 (select v_arrayElimArr_3 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|))) (let ((.cse11 (select |c_#memory_$Pointer$#2.base| .cse12)) (.cse14 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_18| 24))) (let ((.cse13 (select .cse11 .cse14))) (and (= .cse11 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse12 v_DerPreprocessor_1) .cse13 v_arrayElimArr_3) .cse12) .cse14 .cse13)) (not (= .cse13 0)) (not (= .cse12 .cse13)))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_20| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_17| Int)) (let ((.cse15 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_20|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_20| 0)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_20| (select .cse15 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_17| 24))) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int)) (= (select .cse15 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_20|))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int) (v_arrayElimArr_3 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_17| Int)) (let ((.cse18 (select v_arrayElimArr_3 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|))) (let ((.cse17 (select |c_#memory_$Pointer$#2.base| .cse18)) (.cse19 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_17| 24))) (let ((.cse16 (select .cse17 .cse19))) (and (not (= .cse16 0)) (= .cse17 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse18 v_DerPreprocessor_1) .cse16 v_arrayElimArr_3) .cse18) .cse19 .cse16)) (not (= .cse18 .cse16))))))))) is different from true [2025-01-09 17:23:12,016 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_23| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_19| Int)) (let ((.cse0 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_23|))) (and (not (= 0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_23|)) (= (select .cse0 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_19| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_23|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int)) (= (select .cse0 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_23|))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int) (v_arrayElimArr_3 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_19| Int)) (let ((.cse2 (select v_arrayElimArr_3 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|))) (let ((.cse3 (select |c_#memory_$Pointer$#2.base| .cse2)) (.cse4 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_19| 24))) (let ((.cse1 (select .cse3 .cse4))) (and (not (= .cse1 0)) (not (= .cse2 .cse1)) (= .cse3 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse2 v_DerPreprocessor_1) .cse1 v_arrayElimArr_3) .cse2) .cse4 .cse1)))))))) (or (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_20| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse6 (select v_arrayElimArr_3 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|))) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| .cse6)) (.cse8 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_20| 24))) (let ((.cse7 (select .cse5 .cse8))) (and (= .cse5 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse6 v_DerPreprocessor_1) .cse7 v_arrayElimArr_3) .cse6) .cse8 .cse7)) (not (= .cse6 .cse7)) (not (= .cse7 0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_24| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_20| Int)) (let ((.cse9 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_24|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int)) (= (select .cse9 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_24|)) (= (select .cse9 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_20| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_24|) (not (= 0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_24|)))))) (not (= |c_assume_abort_if_not_#in~cond| 0)) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_21| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_18| Int)) (let ((.cse10 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_21|))) (and (= (select .cse10 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_18| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_21|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_21| (select .cse10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|))) (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_21| 0))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int) (v_arrayElimArr_3 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_18| Int)) (let ((.cse12 (select v_arrayElimArr_3 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|))) (let ((.cse11 (select |c_#memory_$Pointer$#2.base| .cse12)) (.cse14 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_18| 24))) (let ((.cse13 (select .cse11 .cse14))) (and (= .cse11 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse12 v_DerPreprocessor_1) .cse13 v_arrayElimArr_3) .cse12) .cse14 .cse13)) (not (= .cse13 0)) (not (= .cse12 .cse13)))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_20| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_17| Int)) (let ((.cse15 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_20|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_20| 0)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_20| (select .cse15 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_17| 24))) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int)) (= (select .cse15 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_20|))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int) (v_arrayElimArr_3 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_17| Int)) (let ((.cse18 (select v_arrayElimArr_3 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|))) (let ((.cse17 (select |c_#memory_$Pointer$#2.base| .cse18)) (.cse19 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_17| 24))) (let ((.cse16 (select .cse17 .cse19))) (and (not (= .cse16 0)) (= .cse17 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse18 v_DerPreprocessor_1) .cse16 v_arrayElimArr_3) .cse18) .cse19 .cse16)) (not (= .cse18 .cse16))))))))) is different from true [2025-01-09 17:23:12,032 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse21 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base|)) (.cse23 (+ |c_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset| 24))) (let ((.cse22 (select .cse21 .cse23))) (let ((.cse0 (not (= .cse22 0)))) (and .cse0 (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_23| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_19| Int)) (let ((.cse1 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_23|))) (and (not (= 0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_23|)) (= (select .cse1 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_19| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_23|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int)) (= (select .cse1 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_23|))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int) (v_arrayElimArr_3 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_19| Int)) (let ((.cse3 (select v_arrayElimArr_3 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|))) (let ((.cse4 (select |c_#memory_$Pointer$#2.base| .cse3)) (.cse5 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_19| 24))) (let ((.cse2 (select .cse4 .cse5))) (and (not (= .cse2 0)) (not (= .cse3 .cse2)) (= .cse4 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse3 v_DerPreprocessor_1) .cse2 v_arrayElimArr_3) .cse3) .cse5 .cse2)))))))) (or (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_20| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse7 (select v_arrayElimArr_3 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|))) (let ((.cse6 (select |c_#memory_$Pointer$#2.base| .cse7)) (.cse9 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_20| 24))) (let ((.cse8 (select .cse6 .cse9))) (and (= .cse6 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse7 v_DerPreprocessor_1) .cse8 v_arrayElimArr_3) .cse7) .cse9 .cse8)) (not (= .cse7 .cse8)) (not (= .cse8 0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_24| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_20| Int)) (let ((.cse10 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_24|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int)) (= (select .cse10 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_24|)) (= (select .cse10 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_20| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_24|) (not (= 0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_24|)))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_21| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_18| Int)) (let ((.cse11 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_21|))) (and (= (select .cse11 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_18| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_21|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_21| (select .cse11 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|))) (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_21| 0))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int) (v_arrayElimArr_3 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_18| Int)) (let ((.cse13 (select v_arrayElimArr_3 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|))) (let ((.cse12 (select |c_#memory_$Pointer$#2.base| .cse13)) (.cse15 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_18| 24))) (let ((.cse14 (select .cse12 .cse15))) (and (= .cse12 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse13 v_DerPreprocessor_1) .cse14 v_arrayElimArr_3) .cse13) .cse15 .cse14)) (not (= .cse14 0)) (not (= .cse13 .cse14)))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_20| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_17| Int)) (let ((.cse16 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_20|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_20| 0)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_20| (select .cse16 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_17| 24))) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int)) (= (select .cse16 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_20|))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int) (v_arrayElimArr_3 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_17| Int)) (let ((.cse19 (select v_arrayElimArr_3 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|))) (let ((.cse18 (select |c_#memory_$Pointer$#2.base| .cse19)) (.cse20 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_17| 24))) (let ((.cse17 (select .cse18 .cse20))) (and (not (= .cse17 0)) (= .cse18 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse19 v_DerPreprocessor_1) .cse17 v_arrayElimArr_3) .cse19) .cse20 .cse17)) (not (= .cse19 .cse17)))))))) (let ((.cse24 (= .cse22 |c_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base|))) (or (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int) (v_arrayElimArr_3 (Array Int Int))) (and (= .cse21 (store (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base| v_DerPreprocessor_1) .cse22 v_arrayElimArr_3) |c_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base|) .cse23 .cse22)) (= (select v_arrayElimArr_3 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|) |c_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base|))) .cse0 (not .cse24)) (and (not (= |c_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base| 0)) .cse24 (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int)) (= (select .cse21 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|) |c_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base|))))))))) is different from true [2025-01-09 17:23:12,822 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_22| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_19| Int)) (let ((.cse0 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_22|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_22| 0)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_22| (select .cse0 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_19| 24))) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_22| (select .cse0 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|)))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int) (v_arrayElimArr_3 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_19| Int)) (let ((.cse3 (select v_arrayElimArr_3 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|))) (let ((.cse2 (select |c_#memory_$Pointer$#2.base| .cse3)) (.cse4 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_19| 24))) (let ((.cse1 (select .cse2 .cse4))) (and (not (= .cse1 0)) (= .cse2 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse3 v_DerPreprocessor_1) .cse1 v_arrayElimArr_3) .cse3) .cse4 .cse1)) (not (= .cse3 .cse1)))))))) (= |c_aws_linked_list_is_valid_~list#1.offset| |c_aws_linked_list_is_valid_#in~list#1.offset|) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_23| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_19| Int)) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_23|))) (and (not (= 0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_23|)) (= (select .cse5 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_19| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_23|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int)) (= (select .cse5 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_23|))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int) (v_arrayElimArr_3 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_19| Int)) (let ((.cse7 (select v_arrayElimArr_3 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|))) (let ((.cse8 (select |c_#memory_$Pointer$#2.base| .cse7)) (.cse9 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_19| 24))) (let ((.cse6 (select .cse8 .cse9))) (and (not (= .cse6 0)) (not (= .cse7 .cse6)) (= .cse8 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse7 v_DerPreprocessor_1) .cse6 v_arrayElimArr_3) .cse7) .cse9 .cse6)))))))) (= |c_aws_linked_list_is_valid_~list#1.base| |c_aws_linked_list_is_valid_#in~list#1.base|) (or (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_20| Int) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse11 (select v_arrayElimArr_3 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|))) (let ((.cse10 (select |c_#memory_$Pointer$#2.base| .cse11)) (.cse13 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_20| 24))) (let ((.cse12 (select .cse10 .cse13))) (and (= .cse10 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse11 v_DerPreprocessor_1) .cse12 v_arrayElimArr_3) .cse11) .cse13 .cse12)) (not (= .cse11 .cse12)) (not (= .cse12 0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_24| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_20| Int)) (let ((.cse14 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_24|))) (and (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int)) (= (select .cse14 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_24|)) (= (select .cse14 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.offset_BEFORE_CALL_20| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_24|) (not (= 0 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_24|)))))) (= |c_aws_linked_list_is_valid_#res#1| 0) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_21| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_18| Int)) (let ((.cse15 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_21|))) (and (= (select .cse15 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_18| 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_21|) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_21| (select .cse15 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|))) (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_21| 0))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int) (v_arrayElimArr_3 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_18| Int)) (let ((.cse17 (select v_arrayElimArr_3 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|))) (let ((.cse16 (select |c_#memory_$Pointer$#2.base| .cse17)) (.cse19 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_18| 24))) (let ((.cse18 (select .cse16 .cse19))) (and (= .cse16 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse17 v_DerPreprocessor_1) .cse18 v_arrayElimArr_3) .cse17) .cse19 .cse18)) (not (= .cse18 0)) (not (= .cse17 .cse18)))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_20| Int) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_17| Int)) (let ((.cse20 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_20|))) (and (not (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_20| 0)) (= |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_20| (select .cse20 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_17| 24))) (exists ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int)) (= (select .cse20 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_20|))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11| Int) (v_arrayElimArr_3 (Array Int Int)) (|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_17| Int)) (let ((.cse23 (select v_arrayElimArr_3 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset_11|))) (let ((.cse22 (select |c_#memory_$Pointer$#2.base| .cse23)) (.cse24 (+ |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.offset_BEFORE_CALL_17| 24))) (let ((.cse21 (select .cse22 .cse24))) (and (not (= .cse21 0)) (= .cse22 (store (select (store (store |c_#memory_$Pointer$#2.base| .cse23 v_DerPreprocessor_1) .cse21 v_arrayElimArr_3) .cse23) .cse24 .cse21)) (not (= .cse23 .cse21))))))))) is different from true [2025-01-09 17:23:13,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:23:13,584 INFO L93 Difference]: Finished difference Result 549 states and 757 transitions. [2025-01-09 17:23:13,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-01-09 17:23:13,585 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 25 states have (on average 4.2) internal successors, (105), 24 states have internal predecessors, (105), 13 states have call successors, (39), 7 states have call predecessors, (39), 10 states have return successors, (38), 12 states have call predecessors, (38), 13 states have call successors, (38) Word has length 116 [2025-01-09 17:23:13,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:23:13,588 INFO L225 Difference]: With dead ends: 549 [2025-01-09 17:23:13,588 INFO L226 Difference]: Without dead ends: 317 [2025-01-09 17:23:13,590 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 27 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=155, Invalid=519, Unknown=34, NotChecked=1944, Total=2652 [2025-01-09 17:23:13,590 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 79 mSDsluCounter, 1514 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 6 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 1681 SdHoareTripleChecker+Invalid, 4597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 4097 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 17:23:13,591 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 1681 Invalid, 4597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 483 Invalid, 11 Unknown, 4097 Unchecked, 0.9s Time] [2025-01-09 17:23:13,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2025-01-09 17:23:13,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 301. [2025-01-09 17:23:13,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 206 states have (on average 1.2815533980582525) internal successors, (264), 214 states have internal predecessors, (264), 65 states have call successors, (65), 24 states have call predecessors, (65), 29 states have return successors, (78), 62 states have call predecessors, (78), 64 states have call successors, (78) [2025-01-09 17:23:13,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 407 transitions. [2025-01-09 17:23:13,640 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 407 transitions. Word has length 116 [2025-01-09 17:23:13,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:23:13,641 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 407 transitions. [2025-01-09 17:23:13,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 25 states have (on average 4.2) internal successors, (105), 24 states have internal predecessors, (105), 13 states have call successors, (39), 7 states have call predecessors, (39), 10 states have return successors, (38), 12 states have call predecessors, (38), 13 states have call successors, (38) [2025-01-09 17:23:13,642 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 407 transitions. [2025-01-09 17:23:13,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 17:23:13,644 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:23:13,644 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 17:23:13,653 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-09 17:23:13,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:23:13,845 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:23:13,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:23:13,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1275152218, now seen corresponding path program 1 times [2025-01-09 17:23:13,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:23:13,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014591735] [2025-01-09 17:23:13,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:23:13,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:23:13,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 17:23:13,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 17:23:13,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:23:13,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:23:14,035 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2025-01-09 17:23:14,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:23:14,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014591735] [2025-01-09 17:23:14,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014591735] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 17:23:14,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1834439614] [2025-01-09 17:23:14,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:23:14,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:23:14,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 17:23:14,039 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 17:23:14,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-09 17:23:14,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 17:23:14,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 17:23:14,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:23:14,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:23:14,245 INFO L256 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-09 17:23:14,247 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 17:23:14,407 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2025-01-09 17:23:14,407 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 17:23:14,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1834439614] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:23:14,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 17:23:14,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [7] total 13 [2025-01-09 17:23:14,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518979431] [2025-01-09 17:23:14,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:23:14,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 17:23:14,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:23:14,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 17:23:14,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-01-09 17:23:14,411 INFO L87 Difference]: Start difference. First operand 301 states and 407 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2025-01-09 17:23:14,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:23:14,862 INFO L93 Difference]: Finished difference Result 561 states and 771 transitions. [2025-01-09 17:23:14,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 17:23:14,863 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) Word has length 119 [2025-01-09 17:23:14,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:23:14,865 INFO L225 Difference]: With dead ends: 561 [2025-01-09 17:23:14,865 INFO L226 Difference]: Without dead ends: 326 [2025-01-09 17:23:14,866 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2025-01-09 17:23:14,867 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 196 mSDsluCounter, 612 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 748 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 17:23:14,868 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 748 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 17:23:14,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2025-01-09 17:23:14,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 301. [2025-01-09 17:23:14,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 206 states have (on average 1.2815533980582525) internal successors, (264), 214 states have internal predecessors, (264), 65 states have call successors, (65), 24 states have call predecessors, (65), 29 states have return successors, (78), 62 states have call predecessors, (78), 64 states have call successors, (78) [2025-01-09 17:23:14,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 407 transitions. [2025-01-09 17:23:14,918 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 407 transitions. Word has length 119 [2025-01-09 17:23:14,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:23:14,919 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 407 transitions. [2025-01-09 17:23:14,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2025-01-09 17:23:14,919 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 407 transitions. [2025-01-09 17:23:14,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-01-09 17:23:14,921 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:23:14,921 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 17:23:14,930 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-01-09 17:23:15,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:23:15,122 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:23:15,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:23:15,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1968063070, now seen corresponding path program 1 times [2025-01-09 17:23:15,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:23:15,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999260471] [2025-01-09 17:23:15,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:23:15,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:23:15,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 17:23:15,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 17:23:15,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:23:15,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:23:15,363 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2025-01-09 17:23:15,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:23:15,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999260471] [2025-01-09 17:23:15,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999260471] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 17:23:15,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [523244758] [2025-01-09 17:23:15,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:23:15,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:23:15,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 17:23:15,366 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 17:23:15,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-09 17:23:15,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 17:23:15,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 17:23:15,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:23:15,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:23:15,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 17:23:15,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 17:23:15,783 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2025-01-09 17:23:15,783 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 17:23:15,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [523244758] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:23:15,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 17:23:15,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 15 [2025-01-09 17:23:15,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336460565] [2025-01-09 17:23:15,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:23:15,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 17:23:15,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:23:15,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 17:23:15,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2025-01-09 17:23:15,785 INFO L87 Difference]: Start difference. First operand 301 states and 407 transitions. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2025-01-09 17:23:16,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:23:16,473 INFO L93 Difference]: Finished difference Result 593 states and 823 transitions. [2025-01-09 17:23:16,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 17:23:16,474 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) Word has length 121 [2025-01-09 17:23:16,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:23:16,478 INFO L225 Difference]: With dead ends: 593 [2025-01-09 17:23:16,478 INFO L226 Difference]: Without dead ends: 358 [2025-01-09 17:23:16,479 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=399, Unknown=0, NotChecked=0, Total=462 [2025-01-09 17:23:16,480 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 211 mSDsluCounter, 731 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 865 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 17:23:16,481 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 865 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 17:23:16,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2025-01-09 17:23:16,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 304. [2025-01-09 17:23:16,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 209 states have (on average 1.291866028708134) internal successors, (270), 217 states have internal predecessors, (270), 65 states have call successors, (65), 24 states have call predecessors, (65), 29 states have return successors, (78), 62 states have call predecessors, (78), 64 states have call successors, (78) [2025-01-09 17:23:16,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 413 transitions. [2025-01-09 17:23:16,527 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 413 transitions. Word has length 121 [2025-01-09 17:23:16,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:23:16,527 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 413 transitions. [2025-01-09 17:23:16,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2025-01-09 17:23:16,527 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 413 transitions. [2025-01-09 17:23:16,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-01-09 17:23:16,529 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:23:16,529 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 17:23:16,539 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-01-09 17:23:16,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:23:16,730 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:23:16,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:23:16,730 INFO L85 PathProgramCache]: Analyzing trace with hash -603099655, now seen corresponding path program 1 times [2025-01-09 17:23:16,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:23:16,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944835506] [2025-01-09 17:23:16,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:23:16,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:23:16,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 17:23:16,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 17:23:16,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:23:16,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:23:17,038 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2025-01-09 17:23:17,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:23:17,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944835506] [2025-01-09 17:23:17,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944835506] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 17:23:17,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [472895936] [2025-01-09 17:23:17,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:23:17,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:23:17,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 17:23:17,042 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 17:23:17,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-09 17:23:17,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 17:23:17,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 17:23:17,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:23:17,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:23:17,244 INFO L256 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 17:23:17,246 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 17:23:17,274 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2025-01-09 17:23:17,275 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 17:23:17,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [472895936] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:23:17,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 17:23:17,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2025-01-09 17:23:17,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332732413] [2025-01-09 17:23:17,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:23:17,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 17:23:17,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:23:17,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 17:23:17,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 17:23:17,277 INFO L87 Difference]: Start difference. First operand 304 states and 413 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 17:23:17,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:23:17,363 INFO L93 Difference]: Finished difference Result 564 states and 802 transitions. [2025-01-09 17:23:17,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 17:23:17,363 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 122 [2025-01-09 17:23:17,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:23:17,367 INFO L225 Difference]: With dead ends: 564 [2025-01-09 17:23:17,367 INFO L226 Difference]: Without dead ends: 326 [2025-01-09 17:23:17,368 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 17:23:17,369 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 2 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 17:23:17,369 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 336 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 17:23:17,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2025-01-09 17:23:17,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 311. [2025-01-09 17:23:17,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 216 states have (on average 1.2916666666666667) internal successors, (279), 224 states have internal predecessors, (279), 65 states have call successors, (65), 24 states have call predecessors, (65), 29 states have return successors, (78), 62 states have call predecessors, (78), 64 states have call successors, (78) [2025-01-09 17:23:17,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 422 transitions. [2025-01-09 17:23:17,413 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 422 transitions. Word has length 122 [2025-01-09 17:23:17,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:23:17,413 INFO L471 AbstractCegarLoop]: Abstraction has 311 states and 422 transitions. [2025-01-09 17:23:17,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 17:23:17,414 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 422 transitions. [2025-01-09 17:23:17,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-01-09 17:23:17,415 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:23:17,415 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 17:23:17,424 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-01-09 17:23:17,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-01-09 17:23:17,616 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:23:17,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:23:17,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1252943682, now seen corresponding path program 1 times [2025-01-09 17:23:17,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:23:17,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757385158] [2025-01-09 17:23:17,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:23:17,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:23:17,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-01-09 17:23:17,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-01-09 17:23:17,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:23:17,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:23:17,711 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2025-01-09 17:23:17,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:23:17,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757385158] [2025-01-09 17:23:17,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757385158] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 17:23:17,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2042138749] [2025-01-09 17:23:17,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:23:17,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:23:17,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 17:23:17,715 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 17:23:17,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-01-09 17:23:17,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-01-09 17:23:18,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-01-09 17:23:18,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:23:18,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:23:18,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 17:23:18,037 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 17:23:18,045 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2025-01-09 17:23:18,045 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 17:23:18,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2042138749] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:23:18,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 17:23:18,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2025-01-09 17:23:18,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79346992] [2025-01-09 17:23:18,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:23:18,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 17:23:18,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:23:18,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 17:23:18,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 17:23:18,047 INFO L87 Difference]: Start difference. First operand 311 states and 422 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 17:23:18,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:23:18,096 INFO L93 Difference]: Finished difference Result 545 states and 758 transitions. [2025-01-09 17:23:18,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 17:23:18,097 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 118 [2025-01-09 17:23:18,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:23:18,100 INFO L225 Difference]: With dead ends: 545 [2025-01-09 17:23:18,100 INFO L226 Difference]: Without dead ends: 303 [2025-01-09 17:23:18,102 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 17:23:18,102 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 0 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 17:23:18,102 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 343 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 17:23:18,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2025-01-09 17:23:18,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 300. [2025-01-09 17:23:18,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 207 states have (on average 1.2657004830917875) internal successors, (262), 214 states have internal predecessors, (262), 64 states have call successors, (64), 24 states have call predecessors, (64), 28 states have return successors, (73), 61 states have call predecessors, (73), 63 states have call successors, (73) [2025-01-09 17:23:18,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 399 transitions. [2025-01-09 17:23:18,151 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 399 transitions. Word has length 118 [2025-01-09 17:23:18,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:23:18,151 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 399 transitions. [2025-01-09 17:23:18,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 17:23:18,151 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 399 transitions. [2025-01-09 17:23:18,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-01-09 17:23:18,154 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:23:18,154 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 17:23:18,163 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-01-09 17:23:18,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-01-09 17:23:18,358 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:23:18,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:23:18,358 INFO L85 PathProgramCache]: Analyzing trace with hash -992635772, now seen corresponding path program 2 times [2025-01-09 17:23:18,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:23:18,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957450815] [2025-01-09 17:23:18,359 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 17:23:18,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:23:18,375 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 118 statements into 2 equivalence classes. [2025-01-09 17:23:18,393 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 118 of 118 statements. [2025-01-09 17:23:18,396 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 17:23:18,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:23:18,616 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2025-01-09 17:23:18,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:23:18,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957450815] [2025-01-09 17:23:18,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957450815] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 17:23:18,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2115340342] [2025-01-09 17:23:18,617 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 17:23:18,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:23:18,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 17:23:18,620 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 17:23:18,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-01-09 17:23:18,784 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 118 statements into 2 equivalence classes. [2025-01-09 17:23:18,843 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 118 of 118 statements. [2025-01-09 17:23:18,843 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 17:23:18,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:23:18,846 INFO L256 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-09 17:23:18,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 17:23:19,052 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2025-01-09 17:23:19,052 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 17:23:19,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2115340342] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:23:19,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 17:23:19,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 15 [2025-01-09 17:23:19,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182824215] [2025-01-09 17:23:19,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:23:19,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 17:23:19,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:23:19,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 17:23:19,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2025-01-09 17:23:19,053 INFO L87 Difference]: Start difference. First operand 300 states and 399 transitions. Second operand has 9 states, 8 states have (on average 7.625) internal successors, (61), 9 states have internal predecessors, (61), 5 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 5 states have call successors, (15) [2025-01-09 17:23:19,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:23:19,553 INFO L93 Difference]: Finished difference Result 541 states and 722 transitions. [2025-01-09 17:23:19,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 17:23:19,553 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.625) internal successors, (61), 9 states have internal predecessors, (61), 5 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 5 states have call successors, (15) Word has length 118 [2025-01-09 17:23:19,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:23:19,557 INFO L225 Difference]: With dead ends: 541 [2025-01-09 17:23:19,557 INFO L226 Difference]: Without dead ends: 308 [2025-01-09 17:23:19,559 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=351, Unknown=0, NotChecked=0, Total=420 [2025-01-09 17:23:19,559 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 200 mSDsluCounter, 739 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 874 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 17:23:19,560 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 874 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 17:23:19,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2025-01-09 17:23:19,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 300. [2025-01-09 17:23:19,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 207 states have (on average 1.2463768115942029) internal successors, (258), 214 states have internal predecessors, (258), 64 states have call successors, (64), 24 states have call predecessors, (64), 28 states have return successors, (73), 61 states have call predecessors, (73), 63 states have call successors, (73) [2025-01-09 17:23:19,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 395 transitions. [2025-01-09 17:23:19,605 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 395 transitions. Word has length 118 [2025-01-09 17:23:19,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:23:19,605 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 395 transitions. [2025-01-09 17:23:19,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.625) internal successors, (61), 9 states have internal predecessors, (61), 5 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 5 states have call successors, (15) [2025-01-09 17:23:19,605 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 395 transitions. [2025-01-09 17:23:19,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-01-09 17:23:19,607 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:23:19,607 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 17:23:19,618 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-01-09 17:23:19,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:23:19,808 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:23:19,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:23:19,809 INFO L85 PathProgramCache]: Analyzing trace with hash 320109568, now seen corresponding path program 1 times [2025-01-09 17:23:19,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:23:19,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461332852] [2025-01-09 17:23:19,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:23:19,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:23:19,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-01-09 17:23:19,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-01-09 17:23:19,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:23:19,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:23:20,081 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2025-01-09 17:23:20,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:23:20,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461332852] [2025-01-09 17:23:20,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461332852] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 17:23:20,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [768562889] [2025-01-09 17:23:20,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:23:20,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:23:20,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 17:23:20,085 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 17:23:20,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-01-09 17:23:20,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-01-09 17:23:20,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-01-09 17:23:20,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:23:20,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:23:20,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-09 17:23:20,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 17:23:20,530 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2025-01-09 17:23:20,530 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 17:23:20,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [768562889] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:23:20,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 17:23:20,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [9] total 17 [2025-01-09 17:23:20,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850119030] [2025-01-09 17:23:20,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:23:20,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 17:23:20,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:23:20,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 17:23:20,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2025-01-09 17:23:20,532 INFO L87 Difference]: Start difference. First operand 300 states and 395 transitions. Second operand has 10 states, 9 states have (on average 7.0) internal successors, (63), 10 states have internal predecessors, (63), 5 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 5 states have call successors, (15) [2025-01-09 17:23:21,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:23:21,117 INFO L93 Difference]: Finished difference Result 555 states and 736 transitions. [2025-01-09 17:23:21,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 17:23:21,118 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.0) internal successors, (63), 10 states have internal predecessors, (63), 5 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 5 states have call successors, (15) Word has length 120 [2025-01-09 17:23:21,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:23:21,120 INFO L225 Difference]: With dead ends: 555 [2025-01-09 17:23:21,120 INFO L226 Difference]: Without dead ends: 320 [2025-01-09 17:23:21,121 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=75, Invalid=525, Unknown=0, NotChecked=0, Total=600 [2025-01-09 17:23:21,122 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 216 mSDsluCounter, 849 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 981 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 17:23:21,122 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 981 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 17:23:21,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2025-01-09 17:23:21,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 300. [2025-01-09 17:23:21,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 207 states have (on average 1.2270531400966183) internal successors, (254), 214 states have internal predecessors, (254), 64 states have call successors, (64), 24 states have call predecessors, (64), 28 states have return successors, (73), 61 states have call predecessors, (73), 63 states have call successors, (73) [2025-01-09 17:23:21,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 391 transitions. [2025-01-09 17:23:21,175 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 391 transitions. Word has length 120 [2025-01-09 17:23:21,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:23:21,176 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 391 transitions. [2025-01-09 17:23:21,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.0) internal successors, (63), 10 states have internal predecessors, (63), 5 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 5 states have call successors, (15) [2025-01-09 17:23:21,176 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 391 transitions. [2025-01-09 17:23:21,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-01-09 17:23:21,177 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:23:21,177 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 17:23:21,190 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-01-09 17:23:21,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:23:21,378 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:23:21,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:23:21,379 INFO L85 PathProgramCache]: Analyzing trace with hash -392043683, now seen corresponding path program 1 times [2025-01-09 17:23:21,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:23:21,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760327722] [2025-01-09 17:23:21,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:23:21,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:23:21,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-01-09 17:23:21,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-01-09 17:23:21,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:23:21,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:23:21,697 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 15 proven. 13 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2025-01-09 17:23:21,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:23:21,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760327722] [2025-01-09 17:23:21,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760327722] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 17:23:21,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1618264918] [2025-01-09 17:23:21,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:23:21,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:23:21,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 17:23:21,700 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 17:23:21,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-01-09 17:23:21,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-01-09 17:23:21,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-01-09 17:23:21,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:23:21,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:23:21,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 537 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-01-09 17:23:21,953 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 17:23:22,226 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2025-01-09 17:23:22,226 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 17:23:22,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1618264918] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:23:22,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 17:23:22,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [6] total 15 [2025-01-09 17:23:22,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98425144] [2025-01-09 17:23:22,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:23:22,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 17:23:22,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:23:22,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 17:23:22,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2025-01-09 17:23:22,228 INFO L87 Difference]: Start difference. First operand 300 states and 391 transitions. Second operand has 13 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 6 states have call successors, (17), 2 states have call predecessors, (17), 5 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) [2025-01-09 17:23:22,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:23:22,983 INFO L93 Difference]: Finished difference Result 539 states and 710 transitions. [2025-01-09 17:23:22,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 17:23:22,983 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 6 states have call successors, (17), 2 states have call predecessors, (17), 5 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) Word has length 129 [2025-01-09 17:23:22,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:23:22,986 INFO L225 Difference]: With dead ends: 539 [2025-01-09 17:23:22,986 INFO L226 Difference]: Without dead ends: 312 [2025-01-09 17:23:22,988 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=518, Unknown=0, NotChecked=0, Total=600 [2025-01-09 17:23:22,988 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 171 mSDsluCounter, 1272 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 1406 SdHoareTripleChecker+Invalid, 485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 17:23:22,988 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 1406 Invalid, 485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 17:23:22,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2025-01-09 17:23:23,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 308. [2025-01-09 17:23:23,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 213 states have (on average 1.2206572769953052) internal successors, (260), 222 states have internal predecessors, (260), 64 states have call successors, (64), 24 states have call predecessors, (64), 30 states have return successors, (79), 61 states have call predecessors, (79), 63 states have call successors, (79) [2025-01-09 17:23:23,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 403 transitions. [2025-01-09 17:23:23,103 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 403 transitions. Word has length 129 [2025-01-09 17:23:23,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:23:23,104 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 403 transitions. [2025-01-09 17:23:23,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 6 states have call successors, (17), 2 states have call predecessors, (17), 5 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) [2025-01-09 17:23:23,104 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 403 transitions. [2025-01-09 17:23:23,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-01-09 17:23:23,105 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:23:23,110 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 17:23:23,125 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-01-09 17:23:23,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-01-09 17:23:23,311 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:23:23,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:23:23,311 INFO L85 PathProgramCache]: Analyzing trace with hash 1963489433, now seen corresponding path program 1 times [2025-01-09 17:23:23,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:23:23,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593405615] [2025-01-09 17:23:23,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:23:23,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:23:23,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 17:23:23,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 17:23:23,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:23:23,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:23:24,235 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2025-01-09 17:23:24,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:23:24,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593405615] [2025-01-09 17:23:24,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593405615] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 17:23:24,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [435577581] [2025-01-09 17:23:24,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:23:24,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:23:24,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 17:23:24,239 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 17:23:24,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-01-09 17:23:24,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 17:23:24,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 17:23:24,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:23:24,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:23:24,511 INFO L256 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 67 conjuncts are in the unsatisfiable core [2025-01-09 17:23:24,515 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 17:23:24,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2025-01-09 17:23:24,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1