./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_linked_list_front_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_front_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 d60183102582204ad3b2c5c2967c5e39411556c79eb47cc4f179f5b1b7f07a77 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 18:08:35,759 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 18:08:35,824 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-08 18:08:35,830 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 18:08:35,832 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 18:08:35,855 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 18:08:35,856 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 18:08:35,856 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 18:08:35,856 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 18:08:35,856 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 18:08:35,857 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 18:08:35,857 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 18:08:35,857 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 18:08:35,857 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 18:08:35,858 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 18:08:35,858 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 18:08:35,858 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 18:08:35,858 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 18:08:35,858 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 18:08:35,858 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 18:08:35,859 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 18:08:35,859 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 18:08:35,859 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 18:08:35,859 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 18:08:35,859 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 18:08:35,859 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 18:08:35,859 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 18:08:35,859 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 18:08:35,859 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 18:08:35,859 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 18:08:35,859 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 18:08:35,860 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 18:08:35,860 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 18:08:35,860 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 18:08:35,860 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 18:08:35,860 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 18:08:35,860 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 18:08:35,860 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 18:08:35,860 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 18:08:35,861 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 18:08:35,861 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 -> d60183102582204ad3b2c5c2967c5e39411556c79eb47cc4f179f5b1b7f07a77 [2025-03-08 18:08:36,094 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 18:08:36,103 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 18:08:36,106 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 18:08:36,107 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 18:08:36,107 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 18:08:36,108 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_front_harness.i [2025-03-08 18:08:37,273 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7d891d59/46c8552166d441289d9f09cf4a434d02/FLAG27095bb35 [2025-03-08 18:08:37,769 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 18:08:37,770 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_front_harness.i [2025-03-08 18:08:37,801 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7d891d59/46c8552166d441289d9f09cf4a434d02/FLAG27095bb35 [2025-03-08 18:08:37,864 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7d891d59/46c8552166d441289d9f09cf4a434d02 [2025-03-08 18:08:37,868 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 18:08:37,869 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 18:08:37,870 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 18:08:37,870 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 18:08:37,874 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 18:08:37,875 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:08:37" (1/1) ... [2025-03-08 18:08:37,877 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64a4e0ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:08:37, skipping insertion in model container [2025-03-08 18:08:37,877 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:08:37" (1/1) ... [2025-03-08 18:08:37,943 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 18:08:38,175 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_front_harness.i[4495,4508] [2025-03-08 18:08:38,184 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_front_harness.i[4555,4568] [2025-03-08 18:08:38,771 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:08:38,771 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:08:38,772 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:08:38,772 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:08:38,773 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:08:38,781 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:08:38,782 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:08:38,783 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:08:38,784 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:08:38,786 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:08:38,787 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:08:38,788 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:08:38,788 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:08:39,115 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_front_harness.i[150660,150673] [2025-03-08 18:08:39,116 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 18:08:39,133 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 18:08:39,147 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_front_harness.i[4495,4508] [2025-03-08 18:08:39,147 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_front_harness.i[4555,4568] [2025-03-08 18:08:39,181 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:08:39,182 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:08:39,182 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:08:39,182 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:08:39,183 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:08:39,188 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:08:39,189 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:08:39,189 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:08:39,190 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:08:39,190 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:08:39,191 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:08:39,191 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:08:39,191 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:08:39,284 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_front_harness.i[150660,150673] [2025-03-08 18:08:39,285 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 18:08:39,413 INFO L204 MainTranslator]: Completed translation [2025-03-08 18:08:39,414 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:08:39 WrapperNode [2025-03-08 18:08:39,414 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 18:08:39,414 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 18:08:39,414 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 18:08:39,415 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 18:08:39,418 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:08:39" (1/1) ... [2025-03-08 18:08:39,461 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:08:39" (1/1) ... [2025-03-08 18:08:39,497 INFO L138 Inliner]: procedures = 668, calls = 1043, calls flagged for inlining = 51, calls inlined = 5, statements flattened = 129 [2025-03-08 18:08:39,497 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 18:08:39,498 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 18:08:39,498 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 18:08:39,498 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 18:08:39,504 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:08:39" (1/1) ... [2025-03-08 18:08:39,505 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:08:39" (1/1) ... [2025-03-08 18:08:39,507 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:08:39" (1/1) ... [2025-03-08 18:08:39,522 INFO L175 MemorySlicer]: Split 27 memory accesses to 3 slices as follows [2, 5, 20]. 74 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:08:39,523 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:08:39" (1/1) ... [2025-03-08 18:08:39,523 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:08:39" (1/1) ... [2025-03-08 18:08:39,538 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:08:39" (1/1) ... [2025-03-08 18:08:39,543 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:08:39" (1/1) ... [2025-03-08 18:08:39,546 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:08:39" (1/1) ... [2025-03-08 18:08:39,550 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:08:39" (1/1) ... [2025-03-08 18:08:39,558 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 18:08:39,559 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 18:08:39,559 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 18:08:39,559 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 18:08:39,560 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:08:39" (1/1) ... [2025-03-08 18:08:39,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 18:08:39,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:08:39,586 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:08:39,588 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:08:39,606 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 18:08:39,606 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-08 18:08:39,606 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-08 18:08:39,606 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2025-03-08 18:08:39,608 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2025-03-08 18:08:39,608 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 18:08:39,608 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2025-03-08 18:08:39,608 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2025-03-08 18:08:39,608 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 18:08:39,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-08 18:08:39,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-08 18:08:39,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-08 18:08:39,608 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_front [2025-03-08 18:08:39,608 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_front [2025-03-08 18:08:39,608 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 18:08:39,608 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 18:08:39,608 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_empty [2025-03-08 18:08:39,608 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_empty [2025-03-08 18:08:39,608 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 18:08:39,608 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 18:08:39,608 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 18:08:39,608 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-08 18:08:39,608 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-08 18:08:39,608 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-08 18:08:39,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-08 18:08:39,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-08 18:08:39,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-08 18:08:39,608 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2025-03-08 18:08:39,608 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2025-03-08 18:08:39,608 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_prev_is_valid [2025-03-08 18:08:39,608 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_prev_is_valid [2025-03-08 18:08:39,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 18:08:39,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 18:08:39,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 18:08:39,813 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 18:08:39,816 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 18:08:39,868 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4729: havoc #t~mem317.base, #t~mem317.offset;havoc #t~short318;havoc #t~mem319.base, #t~mem319.offset;havoc #t~mem320.base, #t~mem320.offset;havoc #t~short321; [2025-03-08 18:08:39,873 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L266: havoc #t~nondet9; [2025-03-08 18:08:39,904 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4718: havoc #t~mem312.base, #t~mem312.offset;havoc #t~short313;havoc #t~mem314.base, #t~mem314.offset;havoc #t~mem315.base, #t~mem315.offset;havoc #t~short316; [2025-03-08 18:08:40,108 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4700: havoc #t~ret311#1; [2025-03-08 18:08:40,116 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4685: havoc #t~mem302.base, #t~mem302.offset; [2025-03-08 18:08:40,146 INFO L? ?]: Removed 60 outVars from TransFormulas that were not future-live. [2025-03-08 18:08:40,146 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 18:08:40,156 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 18:08:40,157 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 18:08:40,157 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:08:40 BoogieIcfgContainer [2025-03-08 18:08:40,157 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 18:08:40,159 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 18:08:40,159 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 18:08:40,162 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 18:08:40,162 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 06:08:37" (1/3) ... [2025-03-08 18:08:40,163 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ad222ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:08:40, skipping insertion in model container [2025-03-08 18:08:40,163 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:08:39" (2/3) ... [2025-03-08 18:08:40,163 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ad222ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:08:40, skipping insertion in model container [2025-03-08 18:08:40,163 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:08:40" (3/3) ... [2025-03-08 18:08:40,164 INFO L128 eAbstractionObserver]: Analyzing ICFG aws_linked_list_front_harness.i [2025-03-08 18:08:40,174 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 18:08:40,175 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG aws_linked_list_front_harness.i that has 9 procedures, 97 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-08 18:08:40,225 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 18:08:40,235 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;@37766e99, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 18:08:40,235 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 18:08:40,241 INFO L276 IsEmpty]: Start isEmpty. Operand has 97 states, 63 states have (on average 1.2698412698412698) internal successors, (80), 64 states have internal predecessors, (80), 24 states have call successors, (24), 8 states have call predecessors, (24), 8 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-08 18:08:40,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-08 18:08:40,248 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:08:40,248 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 18:08:40,249 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:08:40,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:08:40,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1412685150, now seen corresponding path program 1 times [2025-03-08 18:08:40,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:08:40,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353588057] [2025-03-08 18:08:40,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:08:40,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:08:40,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-08 18:08:40,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-08 18:08:40,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:08:40,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:08:40,589 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2025-03-08 18:08:40,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:08:40,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353588057] [2025-03-08 18:08:40,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353588057] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 18:08:40,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [103895736] [2025-03-08 18:08:40,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:08:40,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:08:40,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:08:40,594 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:08:40,595 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:08:40,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-08 18:08:40,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-08 18:08:40,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:08:40,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:08:40,776 INFO L256 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 18:08:40,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 18:08:40,793 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2025-03-08 18:08:40,794 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 18:08:40,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [103895736] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:08:40,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 18:08:40,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 18:08:40,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577737698] [2025-03-08 18:08:40,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:08:40,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 18:08:40,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:08:40,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 18:08:40,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 18:08:40,814 INFO L87 Difference]: Start difference. First operand has 97 states, 63 states have (on average 1.2698412698412698) internal successors, (80), 64 states have internal predecessors, (80), 24 states have call successors, (24), 8 states have call predecessors, (24), 8 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-08 18:08:40,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:08:40,846 INFO L93 Difference]: Finished difference Result 186 states and 262 transitions. [2025-03-08 18:08:40,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 18:08:40,848 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 85 [2025-03-08 18:08:40,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:08:40,852 INFO L225 Difference]: With dead ends: 186 [2025-03-08 18:08:40,852 INFO L226 Difference]: Without dead ends: 92 [2025-03-08 18:08:40,856 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 86 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:08:40,860 INFO L435 NwaCegarLoop]: 126 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, 126 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:08:40,863 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 18:08:40,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-03-08 18:08:40,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2025-03-08 18:08:40,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 59 states have (on average 1.2542372881355932) internal successors, (74), 60 states have internal predecessors, (74), 24 states have call successors, (24), 8 states have call predecessors, (24), 8 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-08 18:08:40,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 121 transitions. [2025-03-08 18:08:40,893 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 121 transitions. Word has length 85 [2025-03-08 18:08:40,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:08:40,893 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 121 transitions. [2025-03-08 18:08:40,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-08 18:08:40,893 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 121 transitions. [2025-03-08 18:08:40,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-08 18:08:40,896 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:08:40,896 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 18:08:40,904 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:08:41,096 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:08:41,097 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:08:41,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:08:41,097 INFO L85 PathProgramCache]: Analyzing trace with hash 781229250, now seen corresponding path program 1 times [2025-03-08 18:08:41,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:08:41,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019642202] [2025-03-08 18:08:41,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:08:41,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:08:41,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-08 18:08:41,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-08 18:08:41,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:08:41,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:08:43,049 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 13 proven. 13 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-03-08 18:08:43,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:08:43,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019642202] [2025-03-08 18:08:43,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019642202] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 18:08:43,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [601775048] [2025-03-08 18:08:43,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:08:43,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:08:43,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:08:43,053 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:08:43,054 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:08:43,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-08 18:08:43,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-08 18:08:43,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:08:43,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:08:43,195 INFO L256 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 56 conjuncts are in the unsatisfiable core [2025-03-08 18:08:43,200 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 18:08:43,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2025-03-08 18:08:43,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 9 [2025-03-08 18:08:45,117 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 44 proven. 16 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-08 18:08:45,117 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 18:08:58,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 84 treesize of output 80 [2025-03-08 18:08:58,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:08:58,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:08:58,063 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 18:08:58,172 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-08 18:08:58,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [601775048] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 18:08:58,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-08 18:08:58,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [11, 17] total 39 [2025-03-08 18:08:58,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639733063] [2025-03-08 18:08:58,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:08:58,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-08 18:08:58,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:08:58,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-08 18:08:58,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1353, Unknown=3, NotChecked=0, Total=1482 [2025-03-08 18:08:58,179 INFO L87 Difference]: Start difference. First operand 92 states and 121 transitions. Second operand has 17 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 13 states have internal predecessors, (41), 7 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (11), 7 states have call predecessors, (11), 7 states have call successors, (11) [2025-03-08 18:08:58,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:08:58,659 INFO L93 Difference]: Finished difference Result 166 states and 224 transitions. [2025-03-08 18:08:58,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 18:08:58,660 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 13 states have internal predecessors, (41), 7 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (11), 7 states have call predecessors, (11), 7 states have call successors, (11) Word has length 85 [2025-03-08 18:08:58,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:08:58,661 INFO L225 Difference]: With dead ends: 166 [2025-03-08 18:08:58,661 INFO L226 Difference]: Without dead ends: 93 [2025-03-08 18:08:58,663 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 138 SyntacticMatches, 8 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=136, Invalid=1501, Unknown=3, NotChecked=0, Total=1640 [2025-03-08 18:08:58,663 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 4 mSDsluCounter, 1081 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1193 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 18:08:58,663 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1193 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 18:08:58,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-03-08 18:08:58,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2025-03-08 18:08:58,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 60 states have (on average 1.25) internal successors, (75), 61 states have internal predecessors, (75), 24 states have call successors, (24), 8 states have call predecessors, (24), 8 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-08 18:08:58,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 122 transitions. [2025-03-08 18:08:58,672 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 122 transitions. Word has length 85 [2025-03-08 18:08:58,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:08:58,677 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 122 transitions. [2025-03-08 18:08:58,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 13 states have internal predecessors, (41), 7 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (11), 7 states have call predecessors, (11), 7 states have call successors, (11) [2025-03-08 18:08:58,678 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 122 transitions. [2025-03-08 18:08:58,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-08 18:08:58,679 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:08:58,679 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 18:08:58,687 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 18:08:58,880 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,SelfDestructingSolverStorable1 [2025-03-08 18:08:58,880 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:08:58,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:08:58,881 INFO L85 PathProgramCache]: Analyzing trace with hash 1602052801, now seen corresponding path program 1 times [2025-03-08 18:08:58,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:08:58,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803369000] [2025-03-08 18:08:58,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:08:58,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:08:58,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-08 18:08:58,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-08 18:08:58,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:08:58,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:08:59,183 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-03-08 18:08:59,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:08:59,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803369000] [2025-03-08 18:08:59,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803369000] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 18:08:59,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1575323525] [2025-03-08 18:08:59,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:08:59,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:08:59,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:08:59,186 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:08:59,188 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:08:59,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-08 18:08:59,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-08 18:08:59,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:08:59,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:08:59,318 INFO L256 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 58 conjuncts are in the unsatisfiable core [2025-03-08 18:08:59,322 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 18:08:59,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-08 18:08:59,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2025-03-08 18:08:59,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2025-03-08 18:08:59,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:08:59,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:08:59,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 40 [2025-03-08 18:08:59,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:08:59,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:08:59,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 40 [2025-03-08 18:08:59,522 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-08 18:08:59,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 29 [2025-03-08 18:08:59,544 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-08 18:08:59,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 29 [2025-03-08 18:08:59,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:08:59,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:08:59,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 10 [2025-03-08 18:08:59,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:08:59,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:08:59,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 10 [2025-03-08 18:08:59,617 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-08 18:08:59,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-08 18:08:59,684 INFO L349 Elim1Store]: treesize reduction 42, result has 20.8 percent of original size [2025-03-08 18:08:59,684 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 4 new quantified variables, introduced 2 case distinctions, treesize of input 124 treesize of output 126 [2025-03-08 18:08:59,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:08:59,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:08:59,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:08:59,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 102 [2025-03-08 18:08:59,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 34 [2025-03-08 18:08:59,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:08:59,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 47 [2025-03-08 18:08:59,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:08:59,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:08:59,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:08:59,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 35 [2025-03-08 18:09:01,084 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 53 proven. 9 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-08 18:09:01,084 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 18:09:01,437 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 24)) (.cse2 (+ 16 |c_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.offset|))) (and (forall ((v_ArrVal_243 (Array Int Int))) (= 0 (select (select (let ((.cse0 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_243))) (store .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|))) |c_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base|) .cse2))) (forall ((v_ArrVal_241 Int) (v_ArrVal_244 (Array Int Int))) (= (select (select (let ((.cse3 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_244))) (store .cse3 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse3 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_ArrVal_241))) |c_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base|) .cse2) 0)))) is different from false [2025-03-08 18:09:01,533 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 18:09:01,534 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 18:09:01,611 INFO L349 Elim1Store]: treesize reduction 86, result has 45.2 percent of original size [2025-03-08 18:09:01,612 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 4 case distinctions, treesize of input 299 treesize of output 286 [2025-03-08 18:09:01,628 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 18:09:01,629 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 18:09:01,686 INFO L349 Elim1Store]: treesize reduction 86, result has 45.2 percent of original size [2025-03-08 18:09:01,686 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 4 case distinctions, treesize of input 365 treesize of output 352 [2025-03-08 18:09:01,708 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 18:09:01,708 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 306 treesize of output 302 [2025-03-08 18:09:01,720 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 255 treesize of output 243 [2025-03-08 18:09:01,759 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 18:09:01,760 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 360 treesize of output 332 [2025-03-08 18:09:01,776 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 291 treesize of output 279 [2025-03-08 18:09:01,798 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 8 treesize of output 4 [2025-03-08 18:09:02,454 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 18:09:02,455 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 18:09:02,467 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 18:09:02,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 286 treesize of output 290 [2025-03-08 18:09:03,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-08 18:09:03,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-08 18:09:03,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-08 18:09:03,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-08 18:09:03,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-08 18:09:03,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-08 18:09:03,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-08 18:09:03,285 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 18:09:03,286 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 18:09:03,300 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 18:09:03,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 573 treesize of output 523 [2025-03-08 18:09:04,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1575323525] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 18:09:04,654 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 18:09:04,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 13] total 17 [2025-03-08 18:09:04,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605981703] [2025-03-08 18:09:04,655 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 18:09:04,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-08 18:09:04,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:09:04,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-08 18:09:04,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=529, Unknown=2, NotChecked=46, Total=650 [2025-03-08 18:09:04,656 INFO L87 Difference]: Start difference. First operand 93 states and 122 transitions. Second operand has 17 states, 15 states have (on average 5.666666666666667) internal successors, (85), 15 states have internal predecessors, (85), 7 states have call successors, (24), 5 states have call predecessors, (24), 7 states have return successors, (21), 6 states have call predecessors, (21), 7 states have call successors, (21) [2025-03-08 18:09:06,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:09:06,433 INFO L93 Difference]: Finished difference Result 261 states and 352 transitions. [2025-03-08 18:09:06,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-08 18:09:06,433 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 5.666666666666667) internal successors, (85), 15 states have internal predecessors, (85), 7 states have call successors, (24), 5 states have call predecessors, (24), 7 states have return successors, (21), 6 states have call predecessors, (21), 7 states have call successors, (21) Word has length 86 [2025-03-08 18:09:06,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:09:06,436 INFO L225 Difference]: With dead ends: 261 [2025-03-08 18:09:06,436 INFO L226 Difference]: Without dead ends: 181 [2025-03-08 18:09:06,437 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 139 SyntacticMatches, 7 SemanticMatches, 41 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=205, Invalid=1519, Unknown=2, NotChecked=80, Total=1806 [2025-03-08 18:09:06,438 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 235 mSDsluCounter, 886 mSDsCounter, 0 mSdLazyCounter, 772 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 967 SdHoareTripleChecker+Invalid, 880 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 772 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 18:09:06,438 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 967 Invalid, 880 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 772 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 18:09:06,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2025-03-08 18:09:06,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 179. [2025-03-08 18:09:06,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 115 states have (on average 1.2608695652173914) internal successors, (145), 119 states have internal predecessors, (145), 46 states have call successors, (46), 15 states have call predecessors, (46), 17 states have return successors, (48), 44 states have call predecessors, (48), 44 states have call successors, (48) [2025-03-08 18:09:06,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 239 transitions. [2025-03-08 18:09:06,461 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 239 transitions. Word has length 86 [2025-03-08 18:09:06,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:09:06,462 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 239 transitions. [2025-03-08 18:09:06,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 5.666666666666667) internal successors, (85), 15 states have internal predecessors, (85), 7 states have call successors, (24), 5 states have call predecessors, (24), 7 states have return successors, (21), 6 states have call predecessors, (21), 7 states have call successors, (21) [2025-03-08 18:09:06,462 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 239 transitions. [2025-03-08 18:09:06,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-08 18:09:06,464 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:09:06,464 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06,471 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 18:09:06,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:09:06,665 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:09:06,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:09:06,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1690003979, now seen corresponding path program 1 times [2025-03-08 18:09:06,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:09:06,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640496947] [2025-03-08 18:09:06,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:09:06,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:09:06,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-08 18:09:06,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-08 18:09:06,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:09:06,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:09:06,806 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2025-03-08 18:09:06,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:09:06,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640496947] [2025-03-08 18:09:06,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640496947] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 18:09:06,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1460586980] [2025-03-08 18:09:06,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:09:06,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:09:06,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:09:06,809 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 18:09:06,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 18:09:06,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-08 18:09:06,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-08 18:09:06,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:09:06,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:09:06,928 INFO L256 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-08 18:09:06,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 18:09:07,008 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-08 18:09:07,008 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 18:09:07,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1460586980] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:09:07,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 18:09:07,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 15 [2025-03-08 18:09:07,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029778118] [2025-03-08 18:09:07,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:09:07,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 18:09:07,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:09:07,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 18:09:07,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2025-03-08 18:09:07,010 INFO L87 Difference]: Start difference. First operand 179 states and 239 transitions. Second operand has 9 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2025-03-08 18:09:07,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:09:07,234 INFO L93 Difference]: Finished difference Result 342 states and 457 transitions. [2025-03-08 18:09:07,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 18:09:07,235 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 87 [2025-03-08 18:09:07,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:09:07,237 INFO L225 Difference]: With dead ends: 342 [2025-03-08 18:09:07,237 INFO L226 Difference]: Without dead ends: 183 [2025-03-08 18:09:07,239 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2025-03-08 18:09:07,240 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 132 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 18:09:07,240 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 560 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 18:09:07,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2025-03-08 18:09:07,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 179. [2025-03-08 18:09:07,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 115 states have (on average 1.2434782608695651) internal successors, (143), 119 states have internal predecessors, (143), 46 states have call successors, (46), 15 states have call predecessors, (46), 17 states have return successors, (48), 44 states have call predecessors, (48), 44 states have call successors, (48) [2025-03-08 18:09:07,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 237 transitions. [2025-03-08 18:09:07,268 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 237 transitions. Word has length 87 [2025-03-08 18:09:07,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:09:07,269 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 237 transitions. [2025-03-08 18:09:07,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2025-03-08 18:09:07,269 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 237 transitions. [2025-03-08 18:09:07,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-08 18:09:07,272 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:09:07,272 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07,279 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 18:09:07,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:09:07,473 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:09:07,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:09:07,473 INFO L85 PathProgramCache]: Analyzing trace with hash 190316621, now seen corresponding path program 1 times [2025-03-08 18:09:07,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:09:07,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571275088] [2025-03-08 18:09:07,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:09:07,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:09:07,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-08 18:09:07,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-08 18:09:07,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:09:07,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:09:07,646 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2025-03-08 18:09:07,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:09:07,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571275088] [2025-03-08 18:09:07,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571275088] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 18:09:07,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [353259935] [2025-03-08 18:09:07,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:09:07,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:09:07,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:09:07,649 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 18:09:07,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 18:09:07,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-08 18:09:07,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-08 18:09:07,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:09:07,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:09:07,791 INFO L256 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-08 18:09:07,793 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 18:09:07,897 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-08 18:09:07,898 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 18:09:07,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [353259935] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:09:07,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 18:09:07,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [9] total 17 [2025-03-08 18:09:07,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210182995] [2025-03-08 18:09:07,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:09:07,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 18:09:07,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:09:07,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 18:09:07,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2025-03-08 18:09:07,900 INFO L87 Difference]: Start difference. First operand 179 states and 237 transitions. Second operand has 10 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2025-03-08 18:09:08,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:09:08,174 INFO L93 Difference]: Finished difference Result 354 states and 473 transitions. [2025-03-08 18:09:08,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 18:09:08,174 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 89 [2025-03-08 18:09:08,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:09:08,176 INFO L225 Difference]: With dead ends: 354 [2025-03-08 18:09:08,177 INFO L226 Difference]: Without dead ends: 193 [2025-03-08 18:09:08,178 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=529, Unknown=0, NotChecked=0, Total=600 [2025-03-08 18:09:08,179 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 146 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 18:09:08,180 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 623 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 18:09:08,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2025-03-08 18:09:08,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 181. [2025-03-08 18:09:08,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 117 states have (on average 1.2393162393162394) internal successors, (145), 121 states have internal predecessors, (145), 46 states have call successors, (46), 15 states have call predecessors, (46), 17 states have return successors, (48), 44 states have call predecessors, (48), 44 states have call successors, (48) [2025-03-08 18:09:08,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 239 transitions. [2025-03-08 18:09:08,206 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 239 transitions. Word has length 89 [2025-03-08 18:09:08,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:09:08,206 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 239 transitions. [2025-03-08 18:09:08,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2025-03-08 18:09:08,207 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 239 transitions. [2025-03-08 18:09:08,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-08 18:09:08,209 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:09:08,209 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08,216 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-08 18:09:08,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:09:08,413 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:09:08,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:09:08,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1245498089, now seen corresponding path program 1 times [2025-03-08 18:09:08,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:09:08,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615250891] [2025-03-08 18:09:08,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:09:08,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:09:08,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-08 18:09:08,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-08 18:09:08,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:09:08,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:09:08,587 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2025-03-08 18:09:08,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:09:08,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615250891] [2025-03-08 18:09:08,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615250891] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 18:09:08,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1403739243] [2025-03-08 18:09:08,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:09:08,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:09:08,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:09:08,590 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 18:09:08,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 18:09:08,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-08 18:09:08,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-08 18:09:08,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:09:08,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:09:08,719 INFO L256 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 18:09:08,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 18:09:08,733 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-08 18:09:08,734 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 18:09:08,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1403739243] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:09:08,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 18:09:08,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2025-03-08 18:09:08,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787250529] [2025-03-08 18:09:08,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:09:08,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 18:09:08,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:09:08,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 18:09:08,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-08 18:09:08,735 INFO L87 Difference]: Start difference. First operand 181 states and 239 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 18:09:08,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:09:08,758 INFO L93 Difference]: Finished difference Result 344 states and 463 transitions. [2025-03-08 18:09:08,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 18:09:08,759 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 90 [2025-03-08 18:09:08,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:09:08,760 INFO L225 Difference]: With dead ends: 344 [2025-03-08 18:09:08,760 INFO L226 Difference]: Without dead ends: 189 [2025-03-08 18:09:08,761 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-08 18:09:08,761 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 2 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 18:09:08,761 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 229 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 18:09:08,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2025-03-08 18:09:08,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 183. [2025-03-08 18:09:08,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 119 states have (on average 1.2352941176470589) internal successors, (147), 123 states have internal predecessors, (147), 46 states have call successors, (46), 15 states have call predecessors, (46), 17 states have return successors, (48), 44 states have call predecessors, (48), 44 states have call successors, (48) [2025-03-08 18:09:08,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 241 transitions. [2025-03-08 18:09:08,783 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 241 transitions. Word has length 90 [2025-03-08 18:09:08,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:09:08,784 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 241 transitions. [2025-03-08 18:09:08,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 18:09:08,784 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 241 transitions. [2025-03-08 18:09:08,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-08 18:09:08,785 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:09:08,785 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08,792 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-08 18:09:08,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:09:08,989 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:09:08,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:09:08,989 INFO L85 PathProgramCache]: Analyzing trace with hash 841299064, now seen corresponding path program 1 times [2025-03-08 18:09:08,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:09:08,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105080854] [2025-03-08 18:09:08,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:09:08,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:09:09,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-08 18:09:09,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-08 18:09:09,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:09:09,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:09:09,311 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-08 18:09:09,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:09:09,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105080854] [2025-03-08 18:09:09,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105080854] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 18:09:09,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [786522630] [2025-03-08 18:09:09,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:09:09,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:09:09,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:09:09,313 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 18:09:09,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-08 18:09:09,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-08 18:09:09,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-08 18:09:09,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:09:09,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:09:09,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-08 18:09:09,466 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 18:09:09,567 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-08 18:09:09,567 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 18:09:09,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [786522630] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:09:09,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 18:09:09,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [7] total 13 [2025-03-08 18:09:09,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750352544] [2025-03-08 18:09:09,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:09:09,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 18:09:09,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:09:09,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 18:09:09,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-03-08 18:09:09,568 INFO L87 Difference]: Start difference. First operand 183 states and 241 transitions. Second operand has 11 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 5 states have call successors, (14), 3 states have call predecessors, (14), 4 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) [2025-03-08 18:09:09,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:09:09,823 INFO L93 Difference]: Finished difference Result 346 states and 457 transitions. [2025-03-08 18:09:09,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 18:09:09,824 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 5 states have call successors, (14), 3 states have call predecessors, (14), 4 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) Word has length 98 [2025-03-08 18:09:09,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:09:09,826 INFO L225 Difference]: With dead ends: 346 [2025-03-08 18:09:09,826 INFO L226 Difference]: Without dead ends: 189 [2025-03-08 18:09:09,827 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420 [2025-03-08 18:09:09,827 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 110 mSDsluCounter, 605 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 696 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 18:09:09,827 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 696 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 18:09:09,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2025-03-08 18:09:09,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 185. [2025-03-08 18:09:09,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 121 states have (on average 1.2314049586776858) internal successors, (149), 125 states have internal predecessors, (149), 46 states have call successors, (46), 15 states have call predecessors, (46), 17 states have return successors, (48), 44 states have call predecessors, (48), 44 states have call successors, (48) [2025-03-08 18:09:09,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 243 transitions. [2025-03-08 18:09:09,846 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 243 transitions. Word has length 98 [2025-03-08 18:09:09,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:09:09,847 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 243 transitions. [2025-03-08 18:09:09,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 5 states have call successors, (14), 3 states have call predecessors, (14), 4 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) [2025-03-08 18:09:09,847 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 243 transitions. [2025-03-08 18:09:09,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-08 18:09:09,848 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:09:09,848 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09,855 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-08 18:09:10,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:09:10,049 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:09:10,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:09:10,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1580429550, now seen corresponding path program 1 times [2025-03-08 18:09:10,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:09:10,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068356767] [2025-03-08 18:09:10,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:09:10,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:09:10,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-08 18:09:10,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-08 18:09:10,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:09:10,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:09:10,297 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-03-08 18:09:10,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:09:10,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068356767] [2025-03-08 18:09:10,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068356767] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 18:09:10,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [425264218] [2025-03-08 18:09:10,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:09:10,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:09:10,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:09:10,300 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 18:09:10,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-08 18:09:10,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-08 18:09:10,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-08 18:09:10,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:09:10,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:09:10,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 59 conjuncts are in the unsatisfiable core [2025-03-08 18:09:10,450 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 18:09:10,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-08 18:09:10,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-08 18:09:11,014 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 43 proven. 10 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-08 18:09:11,014 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 18:09:11,408 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2025-03-08 18:09:11,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [425264218] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 18:09:11,408 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 18:09:11,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 17, 12] total 32 [2025-03-08 18:09:11,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147808039] [2025-03-08 18:09:11,408 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 18:09:11,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-08 18:09:11,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:09:11,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-08 18:09:11,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=896, Unknown=0, NotChecked=0, Total=992 [2025-03-08 18:09:11,410 INFO L87 Difference]: Start difference. First operand 185 states and 243 transitions. Second operand has 32 states, 31 states have (on average 4.064516129032258) internal successors, (126), 31 states have internal predecessors, (126), 11 states have call successors, (30), 4 states have call predecessors, (30), 6 states have return successors, (28), 10 states have call predecessors, (28), 11 states have call successors, (28) [2025-03-08 18:09:13,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:09:13,286 INFO L93 Difference]: Finished difference Result 684 states and 932 transitions. [2025-03-08 18:09:13,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-03-08 18:09:13,286 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 4.064516129032258) internal successors, (126), 31 states have internal predecessors, (126), 11 states have call successors, (30), 4 states have call predecessors, (30), 6 states have return successors, (28), 10 states have call predecessors, (28), 11 states have call successors, (28) Word has length 100 [2025-03-08 18:09:13,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:09:13,291 INFO L225 Difference]: With dead ends: 684 [2025-03-08 18:09:13,291 INFO L226 Difference]: Without dead ends: 525 [2025-03-08 18:09:13,293 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 180 SyntacticMatches, 6 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 735 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=481, Invalid=3551, Unknown=0, NotChecked=0, Total=4032 [2025-03-08 18:09:13,293 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 378 mSDsluCounter, 2113 mSDsCounter, 0 mSdLazyCounter, 1889 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 2245 SdHoareTripleChecker+Invalid, 2032 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 1889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 18:09:13,294 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 2245 Invalid, 2032 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 1889 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 18:09:13,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2025-03-08 18:09:13,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 447. [2025-03-08 18:09:13,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 319 states have (on average 1.2821316614420062) internal successors, (409), 325 states have internal predecessors, (409), 92 states have call successors, (92), 29 states have call predecessors, (92), 35 states have return successors, (102), 92 states have call predecessors, (102), 88 states have call successors, (102) [2025-03-08 18:09:13,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 603 transitions. [2025-03-08 18:09:13,357 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 603 transitions. Word has length 100 [2025-03-08 18:09:13,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:09:13,358 INFO L471 AbstractCegarLoop]: Abstraction has 447 states and 603 transitions. [2025-03-08 18:09:13,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 4.064516129032258) internal successors, (126), 31 states have internal predecessors, (126), 11 states have call successors, (30), 4 states have call predecessors, (30), 6 states have return successors, (28), 10 states have call predecessors, (28), 11 states have call successors, (28) [2025-03-08 18:09:13,358 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 603 transitions. [2025-03-08 18:09:13,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-08 18:09:13,359 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:09:13,359 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13,367 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-08 18:09:13,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-03-08 18:09:13,564 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:09:13,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:09:13,565 INFO L85 PathProgramCache]: Analyzing trace with hash -304054542, now seen corresponding path program 1 times [2025-03-08 18:09:13,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:09:13,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169422458] [2025-03-08 18:09:13,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:09:13,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:09:13,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-08 18:09:13,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-08 18:09:13,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:09:13,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:09:14,116 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2025-03-08 18:09:14,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:09:14,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169422458] [2025-03-08 18:09:14,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169422458] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 18:09:14,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [262189713] [2025-03-08 18:09:14,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:09:14,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:09:14,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:09:14,119 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 18:09:14,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-08 18:09:14,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-08 18:09:14,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-08 18:09:14,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:09:14,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:09:14,278 INFO L256 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 87 conjuncts are in the unsatisfiable core [2025-03-08 18:09:14,281 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 18:09:14,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:09:14,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:09:14,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2025-03-08 18:09:14,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2025-03-08 18:09:14,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:09:14,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 1 [2025-03-08 18:09:18,434 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_37| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_37|) (<= (+ 2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_37|) 24)) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_37|))) is different from true [2025-03-08 18:09:22,488 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_38| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_38|) (<= (+ (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_38|) 24) 2) |v_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base_BEFORE_CALL_38|))) is different from true [2025-03-08 18:09:26,564 WARN L873 $PredicateComparison]: unable to prove that (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_23 Int)) (and (<= 2 v_aws_linked_list_front_~list.base_BEFORE_CALL_23) (<= (+ (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_23) 24) 2) v_aws_linked_list_front_~list.base_BEFORE_CALL_23))) is different from true