./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_linked_list_insert_after_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/aws-c-common/aws_linked_list_insert_after_harness.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 90d8983d1d445f35ced762b5547157927629cd141f5cc02ba145442ec7c5e770 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 18:09:04,284 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 18:09:04,401 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-08 18:09:04,411 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 18:09:04,412 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 18:09:04,450 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 18:09:04,450 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 18:09:04,451 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 18:09:04,451 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 18:09:04,451 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 18:09:04,452 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 18:09:04,455 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 18:09:04,456 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 18:09:04,456 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 18:09:04,456 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 18:09:04,456 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 18:09:04,456 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 18:09:04,456 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 18:09:04,456 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 18:09:04,456 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 18:09:04,456 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 18:09:04,456 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 18:09:04,456 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 18:09:04,456 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 18:09:04,457 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 18:09:04,457 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 18:09:04,457 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 18:09:04,457 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 18:09:04,457 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 18:09:04,457 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 18:09:04,457 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 18:09:04,457 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 18:09:04,457 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 18:09:04,457 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 18:09:04,457 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 18:09:04,457 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 18:09:04,457 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 18:09:04,457 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 18:09:04,457 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 18:09:04,457 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 18:09:04,457 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 90d8983d1d445f35ced762b5547157927629cd141f5cc02ba145442ec7c5e770 [2025-03-08 18:09:04,804 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 18:09:04,815 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 18:09:04,821 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 18:09:04,822 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 18:09:04,827 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 18:09:04,828 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_linked_list_insert_after_harness.i [2025-03-08 18:09:06,590 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04c09bcc2/3624da5f6ece40a1a2f754a01d41a5e7/FLAGb65bc995b [2025-03-08 18:09:07,146 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 18:09:07,151 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_insert_after_harness.i [2025-03-08 18:09:07,194 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04c09bcc2/3624da5f6ece40a1a2f754a01d41a5e7/FLAGb65bc995b [2025-03-08 18:09:07,223 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04c09bcc2/3624da5f6ece40a1a2f754a01d41a5e7 [2025-03-08 18:09:07,227 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 18:09:07,229 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 18:09:07,231 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 18:09:07,231 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 18:09:07,234 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 18:09:07,239 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:09:07" (1/1) ... [2025-03-08 18:09:07,241 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5deddda6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:09:07, skipping insertion in model container [2025-03-08 18:09:07,245 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:09:07" (1/1) ... [2025-03-08 18:09:07,314 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 18:09:07,680 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_insert_after_harness.i[4502,4515] [2025-03-08 18:09:07,689 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_insert_after_harness.i[4562,4575] [2025-03-08 18:09:08,531 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:09:08,531 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:09:08,532 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:09:08,532 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:09:08,532 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:09:08,548 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:09:08,548 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:09:08,549 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:09:08,550 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:09:08,551 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:09:08,552 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:09:08,552 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:09:08,553 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:09:09,072 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_insert_after_harness.i[150740,150753] [2025-03-08 18:09:09,073 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 18:09:09,085 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 18:09:09,105 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_insert_after_harness.i[4502,4515] [2025-03-08 18:09:09,106 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_insert_after_harness.i[4562,4575] [2025-03-08 18:09:09,141 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:09:09,144 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:09:09,145 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:09:09,145 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:09:09,145 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:09:09,158 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:09:09,159 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:09:09,160 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:09:09,161 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:09:09,162 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:09:09,163 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:09:09,165 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:09:09,165 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:09:09,304 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_insert_after_harness.i[150740,150753] [2025-03-08 18:09:09,309 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 18:09:09,583 INFO L204 MainTranslator]: Completed translation [2025-03-08 18:09:09,587 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:09:09 WrapperNode [2025-03-08 18:09:09,587 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 18:09:09,588 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 18:09:09,591 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 18:09:09,592 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 18:09:09,596 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:09:09" (1/1) ... [2025-03-08 18:09:09,678 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:09:09" (1/1) ... [2025-03-08 18:09:09,717 INFO L138 Inliner]: procedures = 668, calls = 1048, calls flagged for inlining = 51, calls inlined = 4, statements flattened = 76 [2025-03-08 18:09:09,718 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 18:09:09,719 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 18:09:09,719 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 18:09:09,719 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 18:09:09,725 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:09:09" (1/1) ... [2025-03-08 18:09:09,726 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:09:09" (1/1) ... [2025-03-08 18:09:09,729 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:09:09" (1/1) ... [2025-03-08 18:09:09,746 INFO L175 MemorySlicer]: Split 24 memory accesses to 3 slices as follows [2, 5, 17]. 71 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5, 0]. The 6 writes are split as follows [0, 0, 6]. [2025-03-08 18:09:09,753 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:09:09" (1/1) ... [2025-03-08 18:09:09,754 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:09:09" (1/1) ... [2025-03-08 18:09:09,768 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:09:09" (1/1) ... [2025-03-08 18:09:09,773 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:09:09" (1/1) ... [2025-03-08 18:09:09,775 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:09:09" (1/1) ... [2025-03-08 18:09:09,777 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:09:09" (1/1) ... [2025-03-08 18:09:09,779 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 18:09:09,779 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 18:09:09,780 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 18:09:09,780 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 18:09:09,783 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:09:09" (1/1) ... [2025-03-08 18:09:09,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 18:09:09,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:09:09,822 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 18:09:09,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 18:09:09,841 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 18:09:09,842 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-08 18:09:09,842 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-08 18:09:09,842 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2025-03-08 18:09:09,842 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2025-03-08 18:09:09,843 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 18:09:09,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-08 18:09:09,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-08 18:09:09,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-08 18:09:09,843 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 18:09:09,843 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 18:09:09,843 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 18:09:09,843 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 18:09:09,843 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 18:09:09,843 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-08 18:09:09,843 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-08 18:09:09,843 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-08 18:09:09,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-08 18:09:09,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-08 18:09:09,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-08 18:09:09,845 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_prev_is_valid [2025-03-08 18:09:09,845 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_prev_is_valid [2025-03-08 18:09:09,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 18:09:09,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 18:09:09,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 18:09:10,097 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 18:09:10,099 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 18:09:10,138 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4720: havoc #t~mem308.base, #t~mem308.offset;havoc #t~short309;havoc #t~mem310.base, #t~mem310.offset;havoc #t~mem311.base, #t~mem311.offset;havoc #t~short312; [2025-03-08 18:09:10,167 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4731: havoc #t~mem313.base, #t~mem313.offset;havoc #t~short314;havoc #t~mem315.base, #t~mem315.offset;havoc #t~mem316.base, #t~mem316.offset;havoc #t~short317; [2025-03-08 18:09:10,273 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2025-03-08 18:09:10,273 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 18:09:10,280 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 18:09:10,283 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 18:09:10,284 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:09:10 BoogieIcfgContainer [2025-03-08 18:09:10,284 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 18:09:10,286 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 18:09:10,289 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 18:09:10,293 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 18:09:10,296 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 06:09:07" (1/3) ... [2025-03-08 18:09:10,297 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57780984 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:09:10, skipping insertion in model container [2025-03-08 18:09:10,297 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:09:09" (2/3) ... [2025-03-08 18:09:10,297 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57780984 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:09:10, skipping insertion in model container [2025-03-08 18:09:10,297 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:09:10" (3/3) ... [2025-03-08 18:09:10,298 INFO L128 eAbstractionObserver]: Analyzing ICFG aws_linked_list_insert_after_harness.i [2025-03-08 18:09:10,316 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 18:09:10,320 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG aws_linked_list_insert_after_harness.i that has 5 procedures, 63 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-08 18:09:10,377 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 18:09:10,395 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;@f1a6861, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 18:09:10,395 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 18:09:10,401 INFO L276 IsEmpty]: Start isEmpty. Operand has 63 states, 37 states have (on average 1.1891891891891893) internal successors, (44), 38 states have internal predecessors, (44), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-08 18:09:10,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-08 18:09:10,412 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:09:10,413 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 18:09:10,414 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:09:10,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:09:10,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1536983237, now seen corresponding path program 1 times [2025-03-08 18:09:10,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:09:10,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610201369] [2025-03-08 18:09:10,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:09:10,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:09:10,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-08 18:09:10,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-08 18:09:10,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:09:10,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:09:10,952 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-08 18:09:10,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:09:10,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610201369] [2025-03-08 18:09:10,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610201369] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 18:09:10,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1622411403] [2025-03-08 18:09:10,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:09:10,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:09:10,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:09:10,969 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 18:09:10,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 18:09:11,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-08 18:09:11,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-08 18:09:11,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:09:11,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:09:11,234 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 18:09:11,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 18:09:11,258 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 18:09:11,258 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 18:09:11,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1622411403] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:09:11,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 18:09:11,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 18:09:11,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827369405] [2025-03-08 18:09:11,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:09:11,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 18:09:11,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:09:11,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 18:09:11,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 18:09:11,301 INFO L87 Difference]: Start difference. First operand has 63 states, 37 states have (on average 1.1891891891891893) internal successors, (44), 38 states have internal predecessors, (44), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 18:09:11,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:09:11,341 INFO L93 Difference]: Finished difference Result 122 states and 174 transitions. [2025-03-08 18:09:11,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 18:09:11,343 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 34 [2025-03-08 18:09:11,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:09:11,350 INFO L225 Difference]: With dead ends: 122 [2025-03-08 18:09:11,356 INFO L226 Difference]: Without dead ends: 58 [2025-03-08 18:09:11,358 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 18:09:11,365 INFO L435 NwaCegarLoop]: 82 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, 82 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 18:09:11,368 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 18:09:11,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-03-08 18:09:11,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2025-03-08 18:09:11,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 34 states have internal predecessors, (38), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-08 18:09:11,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 77 transitions. [2025-03-08 18:09:11,434 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 77 transitions. Word has length 34 [2025-03-08 18:09:11,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:09:11,436 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 77 transitions. [2025-03-08 18:09:11,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 18:09:11,437 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 77 transitions. [2025-03-08 18:09:11,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-08 18:09:11,441 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:09:11,441 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 18:09:11,450 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 18:09:11,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 18:09:11,643 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:09:11,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:09:11,645 INFO L85 PathProgramCache]: Analyzing trace with hash 209393593, now seen corresponding path program 1 times [2025-03-08 18:09:11,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:09:11,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763101743] [2025-03-08 18:09:11,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:09:11,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:09:11,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-08 18:09:12,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-08 18:09:12,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:09:12,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:09:14,768 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 18:09:14,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:09:14,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763101743] [2025-03-08 18:09:14,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763101743] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:09:14,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 18:09:14,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 18:09:14,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889407369] [2025-03-08 18:09:14,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:09:14,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 18:09:14,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:09:14,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 18:09:14,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-03-08 18:09:14,772 INFO L87 Difference]: Start difference. First operand 58 states and 77 transitions. Second operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 18:09:15,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:09:15,264 INFO L93 Difference]: Finished difference Result 69 states and 92 transitions. [2025-03-08 18:09:15,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 18:09:15,264 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 34 [2025-03-08 18:09:15,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:09:15,266 INFO L225 Difference]: With dead ends: 69 [2025-03-08 18:09:15,266 INFO L226 Difference]: Without dead ends: 67 [2025-03-08 18:09:15,266 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-03-08 18:09:15,267 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 11 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 18:09:15,267 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 533 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 18:09:15,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-03-08 18:09:15,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2025-03-08 18:09:15,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 38 states have (on average 1.131578947368421) internal successors, (43), 40 states have internal predecessors, (43), 21 states have call successors, (21), 5 states have call predecessors, (21), 6 states have return successors, (25), 20 states have call predecessors, (25), 20 states have call successors, (25) [2025-03-08 18:09:15,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 89 transitions. [2025-03-08 18:09:15,298 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 89 transitions. Word has length 34 [2025-03-08 18:09:15,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:09:15,298 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 89 transitions. [2025-03-08 18:09:15,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 18:09:15,298 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 89 transitions. [2025-03-08 18:09:15,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-08 18:09:15,298 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:09:15,298 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 18:09:15,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 18:09:15,299 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:09:15,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:09:15,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1952203928, now seen corresponding path program 1 times [2025-03-08 18:09:15,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:09:15,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935047350] [2025-03-08 18:09:15,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:09:15,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:09:15,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-08 18:09:15,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-08 18:09:15,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:09:15,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:09:15,876 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 18:09:15,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:09:15,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935047350] [2025-03-08 18:09:15,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935047350] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:09:15,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 18:09:15,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 18:09:15,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65830685] [2025-03-08 18:09:15,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:09:15,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 18:09:15,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:09:15,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 18:09:15,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-08 18:09:15,880 INFO L87 Difference]: Start difference. First operand 66 states and 89 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 states have internal predecessors, (22), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 18:09:16,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:09:16,264 INFO L93 Difference]: Finished difference Result 134 states and 183 transitions. [2025-03-08 18:09:16,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 18:09:16,265 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 states have internal predecessors, (22), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 34 [2025-03-08 18:09:16,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:09:16,266 INFO L225 Difference]: With dead ends: 134 [2025-03-08 18:09:16,266 INFO L226 Difference]: Without dead ends: 71 [2025-03-08 18:09:16,266 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-03-08 18:09:16,267 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 18 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 18:09:16,267 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 378 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 18:09:16,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-03-08 18:09:16,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2025-03-08 18:09:16,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 42 states have (on average 1.1428571428571428) internal successors, (48), 45 states have internal predecessors, (48), 21 states have call successors, (21), 5 states have call predecessors, (21), 7 states have return successors, (28), 20 states have call predecessors, (28), 20 states have call successors, (28) [2025-03-08 18:09:16,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 97 transitions. [2025-03-08 18:09:16,294 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 97 transitions. Word has length 34 [2025-03-08 18:09:16,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:09:16,294 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 97 transitions. [2025-03-08 18:09:16,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 states have internal predecessors, (22), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 18:09:16,295 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 97 transitions. [2025-03-08 18:09:16,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-08 18:09:16,299 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:09:16,299 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 18:09:16,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 18:09:16,300 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:09:16,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:09:16,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1755690423, now seen corresponding path program 1 times [2025-03-08 18:09:16,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:09:16,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884092920] [2025-03-08 18:09:16,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:09:16,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:09:16,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-08 18:09:16,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-08 18:09:16,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:09:16,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:09:16,493 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 18:09:16,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:09:16,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884092920] [2025-03-08 18:09:16,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884092920] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:09:16,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 18:09:16,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 18:09:16,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736792286] [2025-03-08 18:09:16,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:09:16,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 18:09:16,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:09:16,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 18:09:16,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 18:09:16,499 INFO L87 Difference]: Start difference. First operand 71 states and 97 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-08 18:09:16,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:09:16,667 INFO L93 Difference]: Finished difference Result 141 states and 194 transitions. [2025-03-08 18:09:16,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 18:09:16,668 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 34 [2025-03-08 18:09:16,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:09:16,673 INFO L225 Difference]: With dead ends: 141 [2025-03-08 18:09:16,673 INFO L226 Difference]: Without dead ends: 73 [2025-03-08 18:09:16,674 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 18:09:16,674 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 3 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 18:09:16,675 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 274 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 18:09:16,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-03-08 18:09:16,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 67. [2025-03-08 18:09:16,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 40 states have (on average 1.15) internal successors, (46), 42 states have internal predecessors, (46), 20 states have call successors, (20), 5 states have call predecessors, (20), 6 states have return successors, (22), 19 states have call predecessors, (22), 19 states have call successors, (22) [2025-03-08 18:09:16,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 88 transitions. [2025-03-08 18:09:16,696 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 88 transitions. Word has length 34 [2025-03-08 18:09:16,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:09:16,696 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 88 transitions. [2025-03-08 18:09:16,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-08 18:09:16,697 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 88 transitions. [2025-03-08 18:09:16,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-08 18:09:16,701 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:09:16,702 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 18:09:16,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 18:09:16,702 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:09:16,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:09:16,702 INFO L85 PathProgramCache]: Analyzing trace with hash -877941907, now seen corresponding path program 1 times [2025-03-08 18:09:16,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:09:16,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327705023] [2025-03-08 18:09:16,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:09:16,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:09:16,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-08 18:09:16,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-08 18:09:16,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:09:16,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:09:19,068 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 18:09:19,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:09:19,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327705023] [2025-03-08 18:09:19,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327705023] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 18:09:19,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [908108315] [2025-03-08 18:09:19,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:09:19,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:09:19,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:09:19,077 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 18:09:19,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 18:09:19,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-08 18:09:19,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-08 18:09:19,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:09:19,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:09:19,322 INFO L256 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 85 conjuncts are in the unsatisfiable core [2025-03-08 18:09:19,333 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 18:09:19,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:09:19,626 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2025-03-08 18:09:19,634 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 18:09:19,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:09:19,832 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: |v_#memory_$Pointer$#2.offset_16| input size 35 context size 35 output size 35 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:357) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:227) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:124) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:542) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:521) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:514) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:325) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:234) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:195) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:181) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:317) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:428) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:314) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:275) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:132) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2025-03-08 18:09:19,840 INFO L158 Benchmark]: Toolchain (without parser) took 12610.32ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 106.2MB in the beginning and 104.3MB in the end (delta: 1.9MB). Peak memory consumption was 183.7MB. Max. memory is 16.1GB. [2025-03-08 18:09:19,840 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 201.3MB. Free memory is still 125.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 18:09:19,840 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2356.90ms. Allocated memory is still 142.6MB. Free memory was 105.9MB in the beginning and 94.5MB in the end (delta: 11.5MB). Peak memory consumption was 99.0MB. Max. memory is 16.1GB. [2025-03-08 18:09:19,840 INFO L158 Benchmark]: Boogie Procedure Inliner took 130.29ms. Allocated memory is still 142.6MB. Free memory was 94.5MB in the beginning and 89.8MB in the end (delta: 4.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 18:09:19,840 INFO L158 Benchmark]: Boogie Preprocessor took 60.21ms. Allocated memory is still 142.6MB. Free memory was 89.8MB in the beginning and 86.7MB in the end (delta: 3.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 18:09:19,840 INFO L158 Benchmark]: IcfgBuilder took 504.57ms. Allocated memory is still 142.6MB. Free memory was 86.7MB in the beginning and 64.4MB in the end (delta: 22.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 18:09:19,847 INFO L158 Benchmark]: TraceAbstraction took 9553.40ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 63.8MB in the beginning and 104.3MB in the end (delta: -40.5MB). Peak memory consumption was 149.4MB. Max. memory is 16.1GB. [2025-03-08 18:09:19,848 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29ms. Allocated memory is still 201.3MB. Free memory is still 125.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2356.90ms. Allocated memory is still 142.6MB. Free memory was 105.9MB in the beginning and 94.5MB in the end (delta: 11.5MB). Peak memory consumption was 99.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 130.29ms. Allocated memory is still 142.6MB. Free memory was 94.5MB in the beginning and 89.8MB in the end (delta: 4.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 60.21ms. Allocated memory is still 142.6MB. Free memory was 89.8MB in the beginning and 86.7MB in the end (delta: 3.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 504.57ms. Allocated memory is still 142.6MB. Free memory was 86.7MB in the beginning and 64.4MB in the end (delta: 22.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 9553.40ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 63.8MB in the beginning and 104.3MB in the end (delta: -40.5MB). Peak memory consumption was 149.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: |v_#memory_$Pointer$#2.offset_16| input size 35 context size 35 output size 35 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: |v_#memory_$Pointer$#2.offset_16| input size 35 context size 35 output size 35: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:357) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2025-03-08 18:09:19,874 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/aws-c-common/aws_linked_list_insert_after_harness.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 90d8983d1d445f35ced762b5547157927629cd141f5cc02ba145442ec7c5e770 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 18:09:23,196 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 18:09:23,324 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-03-08 18:09:23,330 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 18:09:23,331 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 18:09:23,360 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 18:09:23,361 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 18:09:23,361 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 18:09:23,361 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 18:09:23,361 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 18:09:23,361 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 18:09:23,361 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 18:09:23,362 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 18:09:23,362 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 18:09:23,362 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 18:09:23,362 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 18:09:23,362 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 18:09:23,362 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 18:09:23,362 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 18:09:23,362 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 18:09:23,362 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 18:09:23,362 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 18:09:23,362 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 18:09:23,362 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 18:09:23,362 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 18:09:23,362 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 18:09:23,362 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 18:09:23,362 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 18:09:23,362 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 18:09:23,363 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 18:09:23,363 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 18:09:23,363 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 18:09:23,363 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 18:09:23,363 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 18:09:23,363 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 18:09:23,363 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 18:09:23,363 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 18:09:23,363 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 18:09:23,363 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 18:09:23,363 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 18:09:23,363 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 18:09:23,363 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 18:09:23,363 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 90d8983d1d445f35ced762b5547157927629cd141f5cc02ba145442ec7c5e770 [2025-03-08 18:09:23,775 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 18:09:23,785 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 18:09:23,787 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 18:09:23,789 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 18:09:23,789 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 18:09:23,790 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_linked_list_insert_after_harness.i [2025-03-08 18:09:25,550 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d71b5b0c3/a389222a603e496abb186fb526fe8224/FLAG833a51be8 [2025-03-08 18:09:26,027 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 18:09:26,029 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_insert_after_harness.i [2025-03-08 18:09:26,058 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d71b5b0c3/a389222a603e496abb186fb526fe8224/FLAG833a51be8 [2025-03-08 18:09:26,089 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d71b5b0c3/a389222a603e496abb186fb526fe8224 [2025-03-08 18:09:26,091 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 18:09:26,096 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 18:09:26,097 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 18:09:26,097 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 18:09:26,104 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 18:09:26,109 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:09:26" (1/1) ... [2025-03-08 18:09:26,110 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76016152 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:09:26, skipping insertion in model container [2025-03-08 18:09:26,110 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:09:26" (1/1) ... [2025-03-08 18:09:26,246 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 18:09:26,671 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_insert_after_harness.i[4502,4515] [2025-03-08 18:09:26,681 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_insert_after_harness.i[4562,4575] [2025-03-08 18:09:27,342 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 18:09:27,469 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 18:09:27,470 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 18:09:27,474 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 18:09:27,485 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 18:09:27,493 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:09:27,494 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:09:27,494 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:09:27,495 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 18:09:27,497 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:09:27,498 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:09:27,500 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 18:09:27,500 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 18:09:27,501 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 18:09:27,512 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 18:09:27,524 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:09:27,533 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 18:09:27,533 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:09:27,534 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 18:09:27,536 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:09:27,542 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 18:09:27,542 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:09:27,542 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 18:09:27,544 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:09:27,545 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 18:09:27,545 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:09:27,545 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 18:09:27,546 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:09:27,546 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:09:27,914 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 18:09:27,924 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 18:09:27,925 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 18:09:27,925 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 18:09:28,069 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 18:09:28,109 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_insert_after_harness.i[150740,150753] [2025-03-08 18:09:28,115 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 18:09:28,156 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2025-03-08 18:09:28,213 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 18:09:28,222 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_insert_after_harness.i[4502,4515] [2025-03-08 18:09:28,223 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_insert_after_harness.i[4562,4575] [2025-03-08 18:09:28,260 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 18:09:28,284 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 18:09:28,285 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 18:09:28,285 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 18:09:28,333 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 18:09:28,334 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:09:28,334 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:09:28,334 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:09:28,334 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 18:09:28,334 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:09:28,335 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:09:28,335 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 18:09:28,336 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 18:09:28,336 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 18:09:28,336 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 18:09:28,349 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:09:28,349 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 18:09:28,349 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:09:28,349 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 18:09:28,355 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:09:28,356 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 18:09:28,356 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:09:28,356 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 18:09:28,357 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:09:28,358 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 18:09:28,363 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:09:28,363 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 18:09:28,363 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:09:28,363 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:09:28,442 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 18:09:28,446 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 18:09:28,446 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 18:09:28,446 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 18:09:28,486 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 18:09:28,496 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_insert_after_harness.i[150740,150753] [2025-03-08 18:09:28,497 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 18:09:28,501 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 18:09:28,513 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_insert_after_harness.i[4502,4515] [2025-03-08 18:09:28,513 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_insert_after_harness.i[4562,4575] [2025-03-08 18:09:28,571 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:09:28,572 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:09:28,572 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:09:28,574 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:09:28,577 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:09:28,584 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:09:28,584 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:09:28,585 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:09:28,586 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:09:28,587 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:09:28,588 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:09:28,588 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:09:28,588 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:09:28,719 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_insert_after_harness.i[150740,150753] [2025-03-08 18:09:28,721 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 18:09:29,041 INFO L204 MainTranslator]: Completed translation [2025-03-08 18:09:29,042 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:09:29 WrapperNode [2025-03-08 18:09:29,043 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 18:09:29,047 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 18:09:29,048 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 18:09:29,048 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 18:09:29,057 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:09:29" (1/1) ... [2025-03-08 18:09:29,147 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:09:29" (1/1) ... [2025-03-08 18:09:29,201 INFO L138 Inliner]: procedures = 687, calls = 1048, calls flagged for inlining = 51, calls inlined = 4, statements flattened = 77 [2025-03-08 18:09:29,201 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 18:09:29,202 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 18:09:29,202 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 18:09:29,202 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 18:09:29,212 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:09:29" (1/1) ... [2025-03-08 18:09:29,212 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:09:29" (1/1) ... [2025-03-08 18:09:29,220 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:09:29" (1/1) ... [2025-03-08 18:09:29,246 INFO L175 MemorySlicer]: Split 24 memory accesses to 3 slices as follows [2, 5, 17]. 71 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5, 0]. The 6 writes are split as follows [0, 0, 6]. [2025-03-08 18:09:29,247 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:09:29" (1/1) ... [2025-03-08 18:09:29,247 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:09:29" (1/1) ... [2025-03-08 18:09:29,264 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:09:29" (1/1) ... [2025-03-08 18:09:29,265 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:09:29" (1/1) ... [2025-03-08 18:09:29,271 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:09:29" (1/1) ... [2025-03-08 18:09:29,272 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:09:29" (1/1) ... [2025-03-08 18:09:29,283 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 18:09:29,284 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 18:09:29,284 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 18:09:29,284 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 18:09:29,284 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:09:29" (1/1) ... [2025-03-08 18:09:29,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 18:09:29,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:09:29,322 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 18:09:29,324 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 18:09:29,345 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 18:09:29,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 18:09:29,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-08 18:09:29,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-03-08 18:09:29,346 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-08 18:09:29,346 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-08 18:09:29,346 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2025-03-08 18:09:29,346 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2025-03-08 18:09:29,346 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 18:09:29,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-08 18:09:29,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-08 18:09:29,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-08 18:09:29,347 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 18:09:29,347 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 18:09:29,347 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 18:09:29,347 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 18:09:29,347 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 18:09:29,347 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-08 18:09:29,347 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-08 18:09:29,347 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-08 18:09:29,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-08 18:09:29,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-08 18:09:29,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-08 18:09:29,348 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_prev_is_valid [2025-03-08 18:09:29,348 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_prev_is_valid [2025-03-08 18:09:29,544 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 18:09:29,546 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 18:09:29,600 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4720: havoc #t~mem299.base, #t~mem299.offset;havoc #t~short300;havoc #t~mem301.base, #t~mem301.offset;havoc #t~mem302.base, #t~mem302.offset;havoc #t~short303; [2025-03-08 18:09:29,624 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4731: havoc #t~mem304.base, #t~mem304.offset;havoc #t~short305;havoc #t~mem306.base, #t~mem306.offset;havoc #t~mem307.base, #t~mem307.offset;havoc #t~short308; [2025-03-08 18:09:30,126 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2025-03-08 18:09:30,126 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 18:09:30,155 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 18:09:30,156 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 18:09:30,157 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:09:30 BoogieIcfgContainer [2025-03-08 18:09:30,157 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 18:09:30,158 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 18:09:30,159 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 18:09:30,162 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 18:09:30,163 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 06:09:26" (1/3) ... [2025-03-08 18:09:30,163 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59521f8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:09:30, skipping insertion in model container [2025-03-08 18:09:30,163 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:09:29" (2/3) ... [2025-03-08 18:09:30,164 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59521f8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:09:30, skipping insertion in model container [2025-03-08 18:09:30,165 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:09:30" (3/3) ... [2025-03-08 18:09:30,166 INFO L128 eAbstractionObserver]: Analyzing ICFG aws_linked_list_insert_after_harness.i [2025-03-08 18:09:30,177 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 18:09:30,178 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG aws_linked_list_insert_after_harness.i that has 5 procedures, 63 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-08 18:09:30,213 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 18:09:30,221 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;@46435621, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 18:09:30,221 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 18:09:30,223 INFO L276 IsEmpty]: Start isEmpty. Operand has 63 states, 37 states have (on average 1.1891891891891893) internal successors, (44), 38 states have internal predecessors, (44), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-08 18:09:30,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-08 18:09:30,229 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:09:30,230 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 18:09:30,230 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:09:30,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:09:30,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1536983237, now seen corresponding path program 1 times [2025-03-08 18:09:30,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 18:09:30,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [701718234] [2025-03-08 18:09:30,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:09:30,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:09:30,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:09:30,244 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 18:09:30,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 18:09:30,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-08 18:09:30,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-08 18:09:30,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:09:30,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:09:30,423 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 18:09:30,427 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 18:09:30,442 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 18:09:30,443 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 18:09:30,443 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 18:09:30,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [701718234] [2025-03-08 18:09:30,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [701718234] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:09:30,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 18:09:30,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 18:09:30,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414605154] [2025-03-08 18:09:30,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:09:30,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 18:09:30,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 18:09:30,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 18:09:30,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 18:09:30,463 INFO L87 Difference]: Start difference. First operand has 63 states, 37 states have (on average 1.1891891891891893) internal successors, (44), 38 states have internal predecessors, (44), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 18:09:30,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:09:30,479 INFO L93 Difference]: Finished difference Result 122 states and 174 transitions. [2025-03-08 18:09:30,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 18:09:30,481 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 34 [2025-03-08 18:09:30,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:09:30,487 INFO L225 Difference]: With dead ends: 122 [2025-03-08 18:09:30,487 INFO L226 Difference]: Without dead ends: 58 [2025-03-08 18:09:30,490 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 18:09:30,494 INFO L435 NwaCegarLoop]: 82 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, 82 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 18:09:30,495 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 18:09:30,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-03-08 18:09:30,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2025-03-08 18:09:30,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 34 states have internal predecessors, (38), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-08 18:09:30,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 77 transitions. [2025-03-08 18:09:30,524 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 77 transitions. Word has length 34 [2025-03-08 18:09:30,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:09:30,525 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 77 transitions. [2025-03-08 18:09:30,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 18:09:30,525 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 77 transitions. [2025-03-08 18:09:30,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-08 18:09:30,526 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:09:30,526 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 18:09:30,534 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 18:09:30,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:09:30,727 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:09:30,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:09:30,728 INFO L85 PathProgramCache]: Analyzing trace with hash 209393593, now seen corresponding path program 1 times [2025-03-08 18:09:30,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 18:09:30,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1255949254] [2025-03-08 18:09:30,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:09:30,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:09:30,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:09:30,730 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 18:09:30,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 18:09:30,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-08 18:09:30,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-08 18:09:30,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:09:30,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:09:30,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-03-08 18:09:30,908 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 18:09:30,995 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2025-03-08 18:09:31,028 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-08 18:09:31,029 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 1 case distinctions, treesize of input 44 treesize of output 43 [2025-03-08 18:09:31,040 INFO L349 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2025-03-08 18:09:31,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 27 [2025-03-08 18:09:35,105 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_1| (_ BitVec 64)) (|v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.offset_BEFORE_CALL_1| (_ BitVec 64))) (not (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.offset_BEFORE_CALL_1|) |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_1|))) is different from true [2025-03-08 18:09:39,220 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_2| (_ BitVec 64)) (|v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.offset_BEFORE_CALL_2| (_ BitVec 64))) (not (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.offset_BEFORE_CALL_2|) |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_2|))) is different from true [2025-03-08 18:09:43,329 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_3| (_ BitVec 64)) (|v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.offset_BEFORE_CALL_3| (_ BitVec 64))) (not (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_3|) |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.offset_BEFORE_CALL_3|) |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_3|))) is different from true [2025-03-08 18:09:43,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:09:43,640 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 529 treesize of output 504 [2025-03-08 18:09:43,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:09:43,879 INFO L349 Elim1Store]: treesize reduction 174, result has 20.2 percent of original size [2025-03-08 18:09:43,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 213 treesize of output 76 [2025-03-08 18:09:43,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:09:43,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 66 [2025-03-08 18:09:43,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 19 [2025-03-08 18:09:46,929 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2025-03-08 18:09:46,934 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 18:09:50,747 INFO L349 Elim1Store]: treesize reduction 96, result has 45.8 percent of original size [2025-03-08 18:09:50,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 252 treesize of output 281 [2025-03-08 18:09:50,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:09:51,502 INFO L349 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2025-03-08 18:09:51,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 193 treesize of output 195 [2025-03-08 18:09:51,609 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 18:09:51,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 682 treesize of output 666 [2025-03-08 18:09:51,658 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 486 treesize of output 466 [2025-03-08 18:09:51,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2025-03-08 18:09:51,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2025-03-08 18:09:52,132 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 18:09:52,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 99 treesize of output 105 [2025-03-08 18:09:52,610 INFO L349 Elim1Store]: treesize reduction 9, result has 52.6 percent of original size [2025-03-08 18:09:52,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 26 [2025-03-08 18:09:52,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1740 treesize of output 1716 [2025-03-08 18:09:57,753 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 18:09:57,753 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 18:09:57,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1255949254] [2025-03-08 18:09:57,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1255949254] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 18:09:57,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 18:09:57,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [16] total 27 [2025-03-08 18:09:57,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411038906] [2025-03-08 18:09:57,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:09:57,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 18:09:57,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 18:09:57,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 18:09:57,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=491, Unknown=4, NotChecked=138, Total=702 [2025-03-08 18:09:57,757 INFO L87 Difference]: Start difference. First operand 58 states and 77 transitions. Second operand has 13 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 18:10:03,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:10:03,782 INFO L93 Difference]: Finished difference Result 69 states and 92 transitions. [2025-03-08 18:10:03,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 18:10:03,783 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 34 [2025-03-08 18:10:03,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:10:03,785 INFO L225 Difference]: With dead ends: 69 [2025-03-08 18:10:03,785 INFO L226 Difference]: Without dead ends: 67 [2025-03-08 18:10:03,786 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 19.9s TimeCoverageRelationStatistics Valid=82, Invalid=628, Unknown=4, NotChecked=156, Total=870 [2025-03-08 18:10:03,787 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 12 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2025-03-08 18:10:03,787 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 577 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2025-03-08 18:10:03,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-03-08 18:10:03,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2025-03-08 18:10:03,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 38 states have (on average 1.131578947368421) internal successors, (43), 40 states have internal predecessors, (43), 21 states have call successors, (21), 5 states have call predecessors, (21), 6 states have return successors, (25), 20 states have call predecessors, (25), 20 states have call successors, (25) [2025-03-08 18:10:03,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 89 transitions. [2025-03-08 18:10:03,798 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 89 transitions. Word has length 34 [2025-03-08 18:10:03,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:10:03,799 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 89 transitions. [2025-03-08 18:10:03,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 18:10:03,799 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 89 transitions. [2025-03-08 18:10:03,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-08 18:10:03,800 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:10:03,800 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 18:10:03,809 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 18:10:04,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:10:04,000 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:10:04,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:10:04,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1952203928, now seen corresponding path program 1 times [2025-03-08 18:10:04,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 18:10:04,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [126263680] [2025-03-08 18:10:04,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:10:04,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:10:04,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:10:04,003 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 18:10:04,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 18:10:04,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-08 18:10:04,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-08 18:10:04,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:10:04,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:10:04,102 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-08 18:10:04,104 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 18:10:04,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:10:28,857 WARN L286 SmtUtils]: Spent 24.72s on a formula simplification. DAG size of input: 51 DAG size of output: 27 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2025-03-08 18:10:28,857 INFO L349 Elim1Store]: treesize reduction 109, result has 29.7 percent of original size [2025-03-08 18:10:28,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 162 treesize of output 226 [2025-03-08 18:10:28,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:10:28,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 101 [2025-03-08 18:10:28,990 INFO L349 Elim1Store]: treesize reduction 27, result has 32.5 percent of original size [2025-03-08 18:10:28,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 101 treesize of output 95 [2025-03-08 18:10:29,001 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 18:10:29,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 56 [2025-03-08 18:10:29,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 38 [2025-03-08 18:10:29,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:10:29,421 INFO L349 Elim1Store]: treesize reduction 155, result has 17.6 percent of original size [2025-03-08 18:10:29,421 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 215 treesize of output 220 [2025-03-08 18:10:29,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:10:29,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 49 [2025-03-08 18:10:37,277 WARN L286 SmtUtils]: Spent 7.81s on a formula simplification. DAG size of input: 17 DAG size of output: 12 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2025-03-08 18:10:37,277 INFO L349 Elim1Store]: treesize reduction 27, result has 32.5 percent of original size [2025-03-08 18:10:37,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2025-03-08 18:10:37,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 482 treesize of output 428 [2025-03-08 18:10:39,452 INFO L349 Elim1Store]: treesize reduction 352, result has 2.5 percent of original size [2025-03-08 18:10:39,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 9 new quantified variables, introduced 13 case distinctions, treesize of input 975 treesize of output 672 [2025-03-08 18:10:39,752 INFO L349 Elim1Store]: treesize reduction 60, result has 28.6 percent of original size [2025-03-08 18:10:39,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 251 treesize of output 284 [2025-03-08 18:10:40,096 INFO L349 Elim1Store]: treesize reduction 60, result has 28.6 percent of original size [2025-03-08 18:10:40,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 271 treesize of output 302 [2025-03-08 18:10:40,112 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 18:10:40,142 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 114 treesize of output 100 [2025-03-08 18:10:40,416 INFO L349 Elim1Store]: treesize reduction 58, result has 23.7 percent of original size [2025-03-08 18:10:40,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 92 treesize of output 93 [2025-03-08 18:10:40,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2025-03-08 18:10:51,403 WARN L286 SmtUtils]: Spent 10.92s on a formula simplification. DAG size of input: 145 DAG size of output: 51 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2025-03-08 18:10:51,403 INFO L349 Elim1Store]: treesize reduction 642, result has 17.8 percent of original size [2025-03-08 18:10:51,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 8 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 12 new quantified variables, introduced 27 case distinctions, treesize of input 1328 treesize of output 1379 [2025-03-08 18:10:52,341 INFO L349 Elim1Store]: treesize reduction 60, result has 28.6 percent of original size [2025-03-08 18:10:52,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 919 treesize of output 800 [2025-03-08 18:10:52,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:10:52,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 81 [2025-03-08 18:10:52,978 INFO L349 Elim1Store]: treesize reduction 27, result has 32.5 percent of original size [2025-03-08 18:10:52,978 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 1 case distinctions, treesize of input 43 treesize of output 21