./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_linked_list_back_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_back_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 baad12004cda93802c22774fa87dd5ddbc51e76f7e3c81692100acfcfda43c3a --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 18:08:11,506 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 18:08:11,554 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:11,557 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 18:08:11,558 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 18:08:11,572 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 18:08:11,572 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 18:08:11,572 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 18:08:11,573 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 18:08:11,573 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 18:08:11,573 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 18:08:11,573 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 18:08:11,573 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 18:08:11,573 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 18:08:11,573 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 18:08:11,574 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 18:08:11,574 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 18:08:11,574 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 18:08:11,574 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 18:08:11,574 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 18:08:11,574 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 18:08:11,574 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 18:08:11,574 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 18:08:11,574 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 18:08:11,574 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 18:08:11,575 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 18:08:11,575 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 18:08:11,575 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 18:08:11,575 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 18:08:11,575 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 18:08:11,575 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 18:08:11,575 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 18:08:11,575 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 18:08:11,575 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 18:08:11,575 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 18:08:11,575 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 18:08:11,575 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 18:08:11,575 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 18:08:11,575 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 18:08:11,575 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 18:08:11,576 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 -> baad12004cda93802c22774fa87dd5ddbc51e76f7e3c81692100acfcfda43c3a [2025-03-08 18:08:11,839 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 18:08:11,847 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 18:08:11,851 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 18:08:11,853 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 18:08:11,853 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 18:08:11,854 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_back_harness.i [2025-03-08 18:08:13,111 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7db380fce/0f2f4863924a4de38eb059df0c0f3809/FLAG27bec0fb7 [2025-03-08 18:08:13,559 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 18:08:13,560 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_back_harness.i [2025-03-08 18:08:13,601 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7db380fce/0f2f4863924a4de38eb059df0c0f3809/FLAG27bec0fb7 [2025-03-08 18:08:13,619 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7db380fce/0f2f4863924a4de38eb059df0c0f3809 [2025-03-08 18:08:13,621 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 18:08:13,623 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 18:08:13,625 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 18:08:13,626 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 18:08:13,629 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 18:08:13,630 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:08:13" (1/1) ... [2025-03-08 18:08:13,630 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61ade8fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:08:13, skipping insertion in model container [2025-03-08 18:08:13,631 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:08:13" (1/1) ... [2025-03-08 18:08:13,697 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 18:08:13,943 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_back_harness.i[4494,4507] [2025-03-08 18:08:13,952 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_back_harness.i[4554,4567] [2025-03-08 18:08:14,557 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:08:14,557 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:08:14,558 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:08:14,559 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:08:14,561 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:08:14,571 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:08:14,572 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:08:14,573 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:08:14,573 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:08:14,576 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:08:14,577 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:08:14,577 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:08:14,577 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:08:14,908 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_back_harness.i[150650,150663] [2025-03-08 18:08:14,913 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 18:08:14,929 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 18:08:14,943 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_back_harness.i[4494,4507] [2025-03-08 18:08:14,945 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_back_harness.i[4554,4567] [2025-03-08 18:08:14,990 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:08:14,990 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:08:14,991 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:08:14,991 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:08:14,991 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:08:15,005 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:08:15,005 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:08:15,006 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:08:15,006 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:08:15,007 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:08:15,007 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:08:15,007 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:08:15,008 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:08:15,085 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_back_harness.i[150650,150663] [2025-03-08 18:08:15,086 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 18:08:15,230 INFO L204 MainTranslator]: Completed translation [2025-03-08 18:08:15,231 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:08:15 WrapperNode [2025-03-08 18:08:15,231 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 18:08:15,232 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 18:08:15,232 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 18:08:15,232 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 18:08:15,236 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:15" (1/1) ... [2025-03-08 18:08:15,281 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:15" (1/1) ... [2025-03-08 18:08:15,316 INFO L138 Inliner]: procedures = 668, calls = 1043, calls flagged for inlining = 51, calls inlined = 5, statements flattened = 129 [2025-03-08 18:08:15,317 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 18:08:15,318 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 18:08:15,318 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 18:08:15,318 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 18:08:15,325 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:15" (1/1) ... [2025-03-08 18:08:15,326 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:15" (1/1) ... [2025-03-08 18:08:15,330 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:15" (1/1) ... [2025-03-08 18:08:15,356 INFO L175 MemorySlicer]: Split 27 memory accesses to 3 slices as follows [2, 20, 5]. 74 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 0, 5]. The 6 writes are split as follows [0, 6, 0]. [2025-03-08 18:08:15,357 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:15" (1/1) ... [2025-03-08 18:08:15,357 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:15" (1/1) ... [2025-03-08 18:08:15,368 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:15" (1/1) ... [2025-03-08 18:08:15,370 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:15" (1/1) ... [2025-03-08 18:08:15,377 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:15" (1/1) ... [2025-03-08 18:08:15,378 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:15" (1/1) ... [2025-03-08 18:08:15,381 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 18:08:15,382 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 18:08:15,382 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 18:08:15,382 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 18:08:15,383 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:08:15" (1/1) ... [2025-03-08 18:08:15,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 18:08:15,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:08:15,416 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:15,419 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:15,437 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_back [2025-03-08 18:08:15,437 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_back [2025-03-08 18:08:15,437 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 18:08:15,437 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-08 18:08:15,437 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-08 18:08:15,437 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2025-03-08 18:08:15,437 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2025-03-08 18:08:15,437 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 18:08:15,437 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2025-03-08 18:08:15,437 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2025-03-08 18:08:15,438 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 18:08:15,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-08 18:08:15,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-08 18:08:15,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-08 18:08:15,438 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 18:08:15,438 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 18:08:15,438 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_empty [2025-03-08 18:08:15,438 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_empty [2025-03-08 18:08:15,438 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 18:08:15,438 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 18:08:15,438 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 18:08:15,438 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-08 18:08:15,438 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-08 18:08:15,438 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-08 18:08:15,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-08 18:08:15,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-08 18:08:15,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-08 18:08:15,438 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2025-03-08 18:08:15,438 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2025-03-08 18:08:15,438 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_prev_is_valid [2025-03-08 18:08:15,438 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_prev_is_valid [2025-03-08 18:08:15,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 18:08:15,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 18:08:15,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 18:08:15,595 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 18:08:15,596 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 18:08:15,643 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:15,648 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L266: havoc #t~nondet9; [2025-03-08 18:08:15,678 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:15,834 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4700: havoc #t~ret311#1; [2025-03-08 18:08:15,845 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4685: havoc #t~mem302.base, #t~mem302.offset; [2025-03-08 18:08:15,872 INFO L? ?]: Removed 60 outVars from TransFormulas that were not future-live. [2025-03-08 18:08:15,872 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 18:08:15,883 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 18:08:15,884 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 18:08:15,884 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:08:15 BoogieIcfgContainer [2025-03-08 18:08:15,884 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 18:08:15,886 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 18:08:15,886 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 18:08:15,890 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 18:08:15,891 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 06:08:13" (1/3) ... [2025-03-08 18:08:15,891 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3180f9e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:08:15, skipping insertion in model container [2025-03-08 18:08:15,892 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:08:15" (2/3) ... [2025-03-08 18:08:15,892 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3180f9e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:08:15, skipping insertion in model container [2025-03-08 18:08:15,892 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:08:15" (3/3) ... [2025-03-08 18:08:15,893 INFO L128 eAbstractionObserver]: Analyzing ICFG aws_linked_list_back_harness.i [2025-03-08 18:08:15,905 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 18:08:15,907 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG aws_linked_list_back_harness.i that has 9 procedures, 97 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-08 18:08:15,952 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 18:08:15,964 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;@2a7a4948, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 18:08:15,964 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 18:08:15,968 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:15,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-08 18:08:15,976 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:08:15,976 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:15,977 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:08:15,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:08:15,983 INFO L85 PathProgramCache]: Analyzing trace with hash 2050953679, now seen corresponding path program 1 times [2025-03-08 18:08:15,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:08:15,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790502427] [2025-03-08 18:08:15,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:08:15,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:08:16,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-08 18:08:16,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-08 18:08:16,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:08:16,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:08:16,317 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:16,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:08:16,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790502427] [2025-03-08 18:08:16,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790502427] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 18:08:16,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1906350028] [2025-03-08 18:08:16,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:08:16,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:08:16,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:08:16,321 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:16,323 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:16,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-08 18:08:16,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-08 18:08:16,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:08:16,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:08:16,489 INFO L256 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 18:08:16,493 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 18:08:16,508 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:16,510 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 18:08:16,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1906350028] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:08:16,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 18:08:16,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 18:08:16,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858722956] [2025-03-08 18:08:16,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:08:16,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 18:08:16,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:08:16,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 18:08:16,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 18:08:16,532 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:16,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:08:16,550 INFO L93 Difference]: Finished difference Result 186 states and 262 transitions. [2025-03-08 18:08:16,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 18:08:16,552 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:16,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:08:16,557 INFO L225 Difference]: With dead ends: 186 [2025-03-08 18:08:16,557 INFO L226 Difference]: Without dead ends: 92 [2025-03-08 18:08:16,561 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:16,564 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:16,565 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:16,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-03-08 18:08:16,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2025-03-08 18:08:16,590 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:16,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 121 transitions. [2025-03-08 18:08:16,596 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 121 transitions. Word has length 85 [2025-03-08 18:08:16,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:08:16,596 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 121 transitions. [2025-03-08 18:08:16,596 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:16,596 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 121 transitions. [2025-03-08 18:08:16,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-08 18:08:16,598 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:08:16,598 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:16,605 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 18:08:16,799 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:16,799 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:08:16,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:08:16,800 INFO L85 PathProgramCache]: Analyzing trace with hash -50099217, now seen corresponding path program 1 times [2025-03-08 18:08:16,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:08:16,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250104064] [2025-03-08 18:08:16,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:08:16,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:08:16,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-08 18:08:16,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-08 18:08:16,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:08:16,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:08:17,509 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:08:17,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:08:17,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250104064] [2025-03-08 18:08:17,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250104064] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 18:08:17,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [522742590] [2025-03-08 18:08:17,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:08:17,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:08:17,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:08:17,513 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:17,515 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:17,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-08 18:08:17,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-08 18:08:17,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:08:17,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:08:17,669 INFO L256 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 56 conjuncts are in the unsatisfiable core [2025-03-08 18:08:17,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 18:08:17,821 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:17,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2025-03-08 18:08:19,577 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:19,577 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 18:08:32,485 INFO L349 Elim1Store]: treesize reduction 17, result has 63.0 percent of original size [2025-03-08 18:08:32,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 198 treesize of output 178 [2025-03-08 18:08:32,517 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 18:08:32,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 71 treesize of output 87 [2025-03-08 18:08:32,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2025-03-08 18:08:32,600 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 6 [2025-03-08 18:08:32,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2025-03-08 18:08:32,673 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 18:08:32,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2025-03-08 18:08:32,690 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 18:08:32,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 121 treesize of output 119 [2025-03-08 18:08:32,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:08:32,808 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 18:08:32,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2025-03-08 18:08:32,827 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-08 18:08:32,828 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 21 treesize of output 20 [2025-03-08 18:08:32,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:08:32,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-03-08 18:08:33,054 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:33,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [522742590] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 18:08:33,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-08 18:08:33,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [6, 17] total 34 [2025-03-08 18:08:33,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865279915] [2025-03-08 18:08:33,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:08:33,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-08 18:08:33,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:08:33,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-08 18:08:33,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=1013, Unknown=3, NotChecked=0, Total=1122 [2025-03-08 18:08:33,068 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:33,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:08:33,765 INFO L93 Difference]: Finished difference Result 166 states and 224 transitions. [2025-03-08 18:08:33,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 18:08:33,766 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:33,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:08:33,767 INFO L225 Difference]: With dead ends: 166 [2025-03-08 18:08:33,767 INFO L226 Difference]: Without dead ends: 93 [2025-03-08 18:08:33,768 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 134 SyntacticMatches, 8 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=121, Invalid=1208, Unknown=3, NotChecked=0, Total=1332 [2025-03-08 18:08:33,769 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 5 mSDsluCounter, 1127 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1243 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 18:08:33,769 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1243 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 18:08:33,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-03-08 18:08:33,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2025-03-08 18:08:33,789 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:33,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 122 transitions. [2025-03-08 18:08:33,791 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 122 transitions. Word has length 85 [2025-03-08 18:08:33,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:08:33,792 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 122 transitions. [2025-03-08 18:08:33,792 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:33,792 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 122 transitions. [2025-03-08 18:08:33,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-08 18:08:33,794 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:08:33,794 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:33,809 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 18:08:34,005 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:34,005 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:08:34,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:08:34,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1752557228, now seen corresponding path program 1 times [2025-03-08 18:08:34,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:08:34,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473132390] [2025-03-08 18:08:34,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:08:34,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:08:34,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-08 18:08:34,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-08 18:08:34,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:08:34,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:08:34,741 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:34,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:08:34,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473132390] [2025-03-08 18:08:34,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473132390] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 18:08:34,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1592227079] [2025-03-08 18:08:34,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:08:34,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:08:34,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:08:34,763 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:34,765 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:34,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-08 18:08:35,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-08 18:08:35,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:08:35,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:08:35,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 63 conjuncts are in the unsatisfiable core [2025-03-08 18:08:35,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 18:08:35,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-08 18:08:35,201 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:35,214 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:35,280 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-08 18:08:35,280 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:35,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:08:35,298 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2025-03-08 18:08:35,305 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 18 treesize of output 13 [2025-03-08 18:08:35,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:08:35,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:08:35,380 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:35,398 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 34 treesize of output 25 [2025-03-08 18:08:35,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 52 [2025-03-08 18:08:35,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:08:35,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:08:35,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:08:35,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 56 [2025-03-08 18:08:35,522 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 73 treesize of output 36 [2025-03-08 18:08:35,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 13 [2025-03-08 18:08:37,578 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:08:37,579 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 18:08:38,092 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_back_harness_~#list~0#1.offset|))) (and (forall ((|ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| Int)) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|) |ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| (+ |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 16))))) (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 |ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset|))) |c_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base|) .cse2) 0)) (forall ((|ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| Int) (v_ArrVal_247 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_247) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|) |ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|)) |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_back_harness_~#list~0#1.base|) .cse2) 0)))) is different from false [2025-03-08 18:08:38,107 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 18:08:38,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 96 treesize of output 100 [2025-03-08 18:08:38,117 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 18:08:38,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 93 treesize of output 92 [2025-03-08 18:08:38,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-03-08 18:08:38,183 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 6 [2025-03-08 18:08:38,374 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 18:08:38,375 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 18:08:38,528 INFO L349 Elim1Store]: treesize reduction 86, result has 45.2 percent of original size [2025-03-08 18:08:38,529 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 187 treesize of output 216 [2025-03-08 18:08:38,552 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 18:08:38,552 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 236 treesize of output 236 [2025-03-08 18:08:38,613 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 18:08:38,614 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 203 treesize of output 204 [2025-03-08 18:08:38,631 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 193 treesize of output 189 [2025-03-08 18:08:38,648 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 18:08:38,648 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 18:08:38,760 INFO L349 Elim1Store]: treesize reduction 86, result has 45.2 percent of original size [2025-03-08 18:08:38,761 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 261 treesize of output 290 [2025-03-08 18:08:38,801 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 18:08:38,802 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 328 treesize of output 324 [2025-03-08 18:08:38,835 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 18:08:38,835 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 277 treesize of output 274 [2025-03-08 18:08:41,599 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:08:41,643 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:08:43,979 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 18:08:43,980 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 18:08:44,011 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 18:08:44,012 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 1119 treesize of output 1077 [2025-03-08 18:08:46,165 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 18:08:46,166 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 1234 treesize of output 1106 [2025-03-08 18:08:49,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1592227079] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 18:08:49,243 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 18:08:49,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 13] total 17 [2025-03-08 18:08:49,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099596815] [2025-03-08 18:08:49,243 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 18:08:49,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-08 18:08:49,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:08:49,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-08 18:08:49,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=530, Unknown=1, NotChecked=46, Total=650 [2025-03-08 18:08:49,245 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:08:51,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:08:51,060 INFO L93 Difference]: Finished difference Result 179 states and 237 transitions. [2025-03-08 18:08:51,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-08 18:08:51,060 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:08:51,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:08:51,063 INFO L225 Difference]: With dead ends: 179 [2025-03-08 18:08:51,063 INFO L226 Difference]: Without dead ends: 100 [2025-03-08 18:08:51,064 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 139 SyntacticMatches, 7 SemanticMatches, 39 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=194, Invalid=1369, Unknown=1, NotChecked=76, Total=1640 [2025-03-08 18:08:51,064 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 148 mSDsluCounter, 761 mSDsCounter, 0 mSdLazyCounter, 765 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 842 SdHoareTripleChecker+Invalid, 891 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 765 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 18:08:51,064 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 842 Invalid, 891 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 765 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 18:08:51,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-03-08 18:08:51,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2025-03-08 18:08:51,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 65 states have (on average 1.2307692307692308) internal successors, (80), 67 states have internal predecessors, (80), 24 states have call successors, (24), 9 states have call predecessors, (24), 10 states have return successors, (25), 23 states have call predecessors, (25), 23 states have call successors, (25) [2025-03-08 18:08:51,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 129 transitions. [2025-03-08 18:08:51,078 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 129 transitions. Word has length 86 [2025-03-08 18:08:51,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:08:51,079 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 129 transitions. [2025-03-08 18:08:51,079 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:08:51,079 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 129 transitions. [2025-03-08 18:08:51,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-08 18:08:51,081 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:08:51,082 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:08:51,090 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:08:51,283 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:08:51,284 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:08:51,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:08:51,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1274911528, now seen corresponding path program 1 times [2025-03-08 18:08:51,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:08:51,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120654226] [2025-03-08 18:08:51,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:08:51,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:08:51,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-08 18:08:51,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-08 18:08:51,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:08:51,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:08:51,493 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:51,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:08:51,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120654226] [2025-03-08 18:08:51,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120654226] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 18:08:51,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1994978415] [2025-03-08 18:08:51,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:08:51,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:08:51,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:08:51,497 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:08:51,499 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:08:51,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-08 18:08:51,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-08 18:08:51,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:08:51,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:08:51,633 INFO L256 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-08 18:08:51,635 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 18:08:51,714 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:08:51,714 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 18:08:51,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1994978415] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:08:51,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 18:08:51,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 15 [2025-03-08 18:08:51,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022572277] [2025-03-08 18:08:51,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:08:51,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 18:08:51,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:08:51,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 18:08:51,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2025-03-08 18:08:51,716 INFO L87 Difference]: Start difference. First operand 100 states and 129 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:08:51,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:08:51,953 INFO L93 Difference]: Finished difference Result 183 states and 239 transitions. [2025-03-08 18:08:51,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 18:08:51,954 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:08:51,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:08:51,955 INFO L225 Difference]: With dead ends: 183 [2025-03-08 18:08:51,955 INFO L226 Difference]: Without dead ends: 102 [2025-03-08 18:08:51,955 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:08:51,956 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:08:51,956 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:08:51,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-03-08 18:08:51,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2025-03-08 18:08:51,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 65 states have (on average 1.2153846153846153) internal successors, (79), 67 states have internal predecessors, (79), 24 states have call successors, (24), 9 states have call predecessors, (24), 10 states have return successors, (25), 23 states have call predecessors, (25), 23 states have call successors, (25) [2025-03-08 18:08:51,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 128 transitions. [2025-03-08 18:08:51,978 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 128 transitions. Word has length 87 [2025-03-08 18:08:51,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:08:51,979 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 128 transitions. [2025-03-08 18:08:51,979 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:08:51,979 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 128 transitions. [2025-03-08 18:08:51,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-08 18:08:51,979 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:08:51,980 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:08:51,987 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 18:08:52,180 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:08:52,180 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:08:52,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:08:52,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1083723824, now seen corresponding path program 1 times [2025-03-08 18:08:52,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:08:52,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746498955] [2025-03-08 18:08:52,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:08:52,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:08:52,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-08 18:08:52,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-08 18:08:52,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:08:52,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:08:52,449 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:52,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:08:52,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746498955] [2025-03-08 18:08:52,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746498955] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 18:08:52,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [736645782] [2025-03-08 18:08:52,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:08:52,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:08:52,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:08:52,452 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:08:52,457 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:08:52,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-08 18:08:52,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-08 18:08:52,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:08:52,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:08:52,613 INFO L256 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-08 18:08:52,615 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 18:08:52,737 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:08:52,737 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 18:08:52,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [736645782] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:08:52,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 18:08:52,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [9] total 17 [2025-03-08 18:08:52,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938588392] [2025-03-08 18:08:52,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:08:52,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 18:08:52,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:08:52,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 18:08:52,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2025-03-08 18:08:52,739 INFO L87 Difference]: Start difference. First operand 100 states and 128 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:08:53,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:08:53,016 INFO L93 Difference]: Finished difference Result 189 states and 247 transitions. [2025-03-08 18:08:53,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 18:08:53,017 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:08:53,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:08:53,018 INFO L225 Difference]: With dead ends: 189 [2025-03-08 18:08:53,018 INFO L226 Difference]: Without dead ends: 107 [2025-03-08 18:08:53,019 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:08:53,020 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 146 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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:08:53,020 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:08:53,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-03-08 18:08:53,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 101. [2025-03-08 18:08:53,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 66 states have (on average 1.2121212121212122) internal successors, (80), 68 states have internal predecessors, (80), 24 states have call successors, (24), 9 states have call predecessors, (24), 10 states have return successors, (25), 23 states have call predecessors, (25), 23 states have call successors, (25) [2025-03-08 18:08:53,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 129 transitions. [2025-03-08 18:08:53,045 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 129 transitions. Word has length 89 [2025-03-08 18:08:53,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:08:53,045 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 129 transitions. [2025-03-08 18:08:53,045 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:08:53,045 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 129 transitions. [2025-03-08 18:08:53,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-08 18:08:53,046 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:08:53,046 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:08:53,053 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-08 18:08:53,248 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:08:53,249 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:08:53,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:08:53,250 INFO L85 PathProgramCache]: Analyzing trace with hash 724743938, now seen corresponding path program 1 times [2025-03-08 18:08:53,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:08:53,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563206978] [2025-03-08 18:08:53,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:08:53,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:08:53,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-08 18:08:53,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-08 18:08:53,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:08:53,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:08:53,500 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:53,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:08:53,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563206978] [2025-03-08 18:08:53,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563206978] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 18:08:53,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1789195208] [2025-03-08 18:08:53,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:08:53,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:08:53,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:08:53,502 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:08:53,504 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:08:53,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-08 18:08:53,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-08 18:08:53,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:08:53,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:08:53,636 INFO L256 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 18:08:53,638 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 18:08:53,651 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:08:53,651 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 18:08:53,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1789195208] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:08:53,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 18:08:53,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2025-03-08 18:08:53,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113078320] [2025-03-08 18:08:53,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:08:53,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 18:08:53,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:08:53,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 18:08:53,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-08 18:08:53,653 INFO L87 Difference]: Start difference. First operand 101 states and 129 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:08:53,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:08:53,680 INFO L93 Difference]: Finished difference Result 184 states and 242 transitions. [2025-03-08 18:08:53,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 18:08:53,681 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:08:53,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:08:53,682 INFO L225 Difference]: With dead ends: 184 [2025-03-08 18:08:53,682 INFO L226 Difference]: Without dead ends: 105 [2025-03-08 18:08:53,682 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:08:53,683 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:08:53,683 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:08:53,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-03-08 18:08:53,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 102. [2025-03-08 18:08:53,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 67 states have (on average 1.208955223880597) internal successors, (81), 69 states have internal predecessors, (81), 24 states have call successors, (24), 9 states have call predecessors, (24), 10 states have return successors, (25), 23 states have call predecessors, (25), 23 states have call successors, (25) [2025-03-08 18:08:53,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 130 transitions. [2025-03-08 18:08:53,704 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 130 transitions. Word has length 90 [2025-03-08 18:08:53,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:08:53,704 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 130 transitions. [2025-03-08 18:08:53,704 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:08:53,704 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 130 transitions. [2025-03-08 18:08:53,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-08 18:08:53,706 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:08:53,706 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:08:53,713 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:08:53,906 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:08:53,906 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:08:53,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:08:53,907 INFO L85 PathProgramCache]: Analyzing trace with hash 335918852, now seen corresponding path program 1 times [2025-03-08 18:08:53,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:08:53,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815254296] [2025-03-08 18:08:53,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:08:53,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:08:53,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-08 18:08:53,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-08 18:08:53,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:08:53,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:08:54,350 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-03-08 18:08:54,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:08:54,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815254296] [2025-03-08 18:08:54,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815254296] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 18:08:54,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [656740339] [2025-03-08 18:08:54,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:08:54,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:08:54,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:08:54,354 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:08:54,355 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:08:54,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-08 18:08:54,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-08 18:08:54,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:08:54,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:08:54,497 INFO L256 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-08 18:08:54,499 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 18:08:54,626 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:08:54,626 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 18:08:54,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [656740339] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:08:54,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 18:08:54,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [11] total 20 [2025-03-08 18:08:54,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753595943] [2025-03-08 18:08:54,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:08:54,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 18:08:54,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:08:54,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 18:08:54,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=338, Unknown=0, NotChecked=0, Total=380 [2025-03-08 18:08:54,627 INFO L87 Difference]: Start difference. First operand 102 states and 130 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:08:54,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:08:54,872 INFO L93 Difference]: Finished difference Result 185 states and 239 transitions. [2025-03-08 18:08:54,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 18:08:54,873 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:08:54,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:08:54,874 INFO L225 Difference]: With dead ends: 185 [2025-03-08 18:08:54,874 INFO L226 Difference]: Without dead ends: 105 [2025-03-08 18:08:54,875 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=676, Unknown=0, NotChecked=0, Total=756 [2025-03-08 18:08:54,875 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:08:54,875 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:08:54,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-03-08 18:08:54,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 103. [2025-03-08 18:08:54,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 68 states have (on average 1.2058823529411764) internal successors, (82), 70 states have internal predecessors, (82), 24 states have call successors, (24), 9 states have call predecessors, (24), 10 states have return successors, (25), 23 states have call predecessors, (25), 23 states have call successors, (25) [2025-03-08 18:08:54,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 131 transitions. [2025-03-08 18:08:54,893 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 131 transitions. Word has length 98 [2025-03-08 18:08:54,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:08:54,894 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 131 transitions. [2025-03-08 18:08:54,894 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:08:54,894 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 131 transitions. [2025-03-08 18:08:54,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-08 18:08:54,895 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:08:54,895 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:08:54,903 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:08:55,096 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:08:55,096 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:08:55,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:08:55,097 INFO L85 PathProgramCache]: Analyzing trace with hash -497988514, now seen corresponding path program 1 times [2025-03-08 18:08:55,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:08:55,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550097770] [2025-03-08 18:08:55,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:08:55,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:08:55,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-08 18:08:55,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-08 18:08:55,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:08:55,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:08:55,397 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:08:55,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:08:55,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550097770] [2025-03-08 18:08:55,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550097770] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 18:08:55,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1869344859] [2025-03-08 18:08:55,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:08:55,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:08:55,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:08:55,399 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:08:55,401 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:08:55,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-08 18:08:55,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-08 18:08:55,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:08:55,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:08:55,587 INFO L256 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-08 18:08:55,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 18:08:55,678 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-08 18:08:55,679 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 18:08:55,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1869344859] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:08:55,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 18:08:55,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 14 [2025-03-08 18:08:55,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597478220] [2025-03-08 18:08:55,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:08:55,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 18:08:55,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:08:55,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 18:08:55,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2025-03-08 18:08:55,680 INFO L87 Difference]: Start difference. First operand 103 states and 131 transitions. Second operand has 8 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 4 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-08 18:08:55,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:08:55,741 INFO L93 Difference]: Finished difference Result 188 states and 242 transitions. [2025-03-08 18:08:55,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 18:08:55,741 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 4 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 100 [2025-03-08 18:08:55,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:08:55,742 INFO L225 Difference]: With dead ends: 188 [2025-03-08 18:08:55,742 INFO L226 Difference]: Without dead ends: 107 [2025-03-08 18:08:55,743 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2025-03-08 18:08:55,743 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 1 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 758 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 18:08:55,743 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 758 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 18:08:55,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-03-08 18:08:55,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 104. [2025-03-08 18:08:55,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 69 states have (on average 1.2028985507246377) internal successors, (83), 71 states have internal predecessors, (83), 24 states have call successors, (24), 9 states have call predecessors, (24), 10 states have return successors, (25), 23 states have call predecessors, (25), 23 states have call successors, (25) [2025-03-08 18:08:55,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 132 transitions. [2025-03-08 18:08:55,768 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 132 transitions. Word has length 100 [2025-03-08 18:08:55,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:08:55,769 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 132 transitions. [2025-03-08 18:08:55,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 4 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-08 18:08:55,770 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 132 transitions. [2025-03-08 18:08:55,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-08 18:08:55,770 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:08:55,770 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:08:55,778 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-08 18:08:55,970 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:08:55,971 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:08:55,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:08:55,971 INFO L85 PathProgramCache]: Analyzing trace with hash -1063698284, now seen corresponding path program 1 times [2025-03-08 18:08:55,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:08:55,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437776083] [2025-03-08 18:08:55,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:08:55,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:08:55,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-08 18:08:55,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-08 18:08:55,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:08:55,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:08:56,283 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2025-03-08 18:08:56,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:08:56,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437776083] [2025-03-08 18:08:56,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437776083] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 18:08:56,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1211972240] [2025-03-08 18:08:56,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:08:56,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:08:56,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:08:56,285 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:08:56,287 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:08:56,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-08 18:08:56,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-08 18:08:56,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:08:56,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:08:56,435 INFO L256 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 57 conjuncts are in the unsatisfiable core [2025-03-08 18:08:56,438 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 18:08:56,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2025-03-08 18:08:56,653 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 52 proven. 2 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-08 18:08:56,653 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 18:08:57,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 243 treesize of output 227 [2025-03-08 18:08:57,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 47 [2025-03-08 18:08:57,145 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 53 treesize of output 45 [2025-03-08 18:08:57,191 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2025-03-08 18:08:57,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1211972240] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 18:08:57,192 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 18:08:57,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 16] total 35 [2025-03-08 18:08:57,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135577778] [2025-03-08 18:08:57,192 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 18:08:57,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-03-08 18:08:57,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:08:57,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-03-08 18:08:57,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1082, Unknown=0, NotChecked=0, Total=1190 [2025-03-08 18:08:57,193 INFO L87 Difference]: Start difference. First operand 104 states and 132 transitions. Second operand has 35 states, 33 states have (on average 3.8484848484848486) internal successors, (127), 30 states have internal predecessors, (127), 11 states have call successors, (28), 4 states have call predecessors, (28), 6 states have return successors, (26), 9 states have call predecessors, (26), 11 states have call successors, (26) [2025-03-08 18:08:57,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:08:57,985 INFO L93 Difference]: Finished difference Result 227 states and 309 transitions. [2025-03-08 18:08:57,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-08 18:08:57,990 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 33 states have (on average 3.8484848484848486) internal successors, (127), 30 states have internal predecessors, (127), 11 states have call successors, (28), 4 states have call predecessors, (28), 6 states have return successors, (26), 9 states have call predecessors, (26), 11 states have call successors, (26) Word has length 101 [2025-03-08 18:08:57,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:08:57,992 INFO L225 Difference]: With dead ends: 227 [2025-03-08 18:08:57,992 INFO L226 Difference]: Without dead ends: 137 [2025-03-08 18:08:57,993 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 181 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 393 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=232, Invalid=2024, Unknown=0, NotChecked=0, Total=2256 [2025-03-08 18:08:57,994 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 116 mSDsluCounter, 2199 mSDsCounter, 0 mSdLazyCounter, 898 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 2299 SdHoareTripleChecker+Invalid, 961 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 898 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 18:08:57,994 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 2299 Invalid, 961 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 898 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 18:08:57,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-03-08 18:08:58,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 111. [2025-03-08 18:08:58,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 75 states have (on average 1.2266666666666666) internal successors, (92), 77 states have internal predecessors, (92), 24 states have call successors, (24), 9 states have call predecessors, (24), 11 states have return successors, (28), 24 states have call predecessors, (28), 23 states have call successors, (28) [2025-03-08 18:08:58,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 144 transitions. [2025-03-08 18:08:58,036 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 144 transitions. Word has length 101 [2025-03-08 18:08:58,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:08:58,037 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 144 transitions. [2025-03-08 18:08:58,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 33 states have (on average 3.8484848484848486) internal successors, (127), 30 states have internal predecessors, (127), 11 states have call successors, (28), 4 states have call predecessors, (28), 6 states have return successors, (26), 9 states have call predecessors, (26), 11 states have call successors, (26) [2025-03-08 18:08:58,037 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 144 transitions. [2025-03-08 18:08:58,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-08 18:08:58,038 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:08:58,038 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:08:58,054 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-08 18:08:58,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:08:58,241 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:08:58,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:08:58,241 INFO L85 PathProgramCache]: Analyzing trace with hash -823158155, now seen corresponding path program 1 times [2025-03-08 18:08:58,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:08:58,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506639669] [2025-03-08 18:08:58,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:08:58,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:08:58,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-08 18:08:58,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-08 18:08:58,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:08:58,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:08:59,483 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:08:59,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:08:59,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506639669] [2025-03-08 18:08:59,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506639669] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 18:08:59,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [843003082] [2025-03-08 18:08:59,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:08:59,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:08:59,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:08:59,485 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 18:08:59,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-08 18:08:59,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-08 18:08:59,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-08 18:08:59,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:08:59,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:08:59,697 INFO L256 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 102 conjuncts are in the unsatisfiable core [2025-03-08 18:08:59,700 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 18:08:59,723 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,972 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-08 18:08:59,973 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:09:00,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2025-03-08 18:09:00,002 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:00,006 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 48 treesize of output 19 [2025-03-08 18:09:00,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2025-03-08 18:09:04,044 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_39| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_39|) (not (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_39|) 24) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_39|)))) is different from true [2025-03-08 18:09:08,146 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_40| Int)) (and (not (= |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_40| (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_40|) 24))) (<= 2 |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_40|))) is different from true [2025-03-08 18:09:12,248 WARN L873 $PredicateComparison]: unable to prove that (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_16 Int)) (and (<= 2 v_aws_linked_list_back_~list.base_BEFORE_CALL_16) (not (= v_aws_linked_list_back_~list.base_BEFORE_CALL_16 (select (select |c_#memory_$Pointer$#1.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_16) 24))))) is different from true [2025-03-08 18:09:20,945 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-08 18:09:20,951 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2025-03-08 18:09:20,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 35 treesize of output 1 [2025-03-08 18:09:20,955 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 52 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 12 not checked. [2025-03-08 18:09:20,955 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 18:09:32,117 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 18:09:32,230 INFO L349 Elim1Store]: treesize reduction 153, result has 52.3 percent of original size [2025-03-08 18:09:32,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 11 case distinctions, treesize of input 831 treesize of output 755 [2025-03-08 18:09:32,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1210 treesize of output 1174 [2025-03-08 18:09:32,377 INFO L349 Elim1Store]: treesize reduction 24, result has 81.7 percent of original size [2025-03-08 18:09:32,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 1242 treesize of output 1237 [2025-03-08 18:09:32,413 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 1064 treesize of output 1028 [2025-03-08 18:09:32,471 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 18:09:32,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 918 treesize of output 930 [2025-03-08 18:09:32,495 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 1028 treesize of output 1006 [2025-03-08 18:09:34,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-03-08 18:09:34,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-03-08 18:09:34,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-03-08 18:09:34,340 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 18:09:34,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2025-03-08 18:09:34,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-03-08 18:09:34,345 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 18:09:34,351 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 18:09:34,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 61 treesize of output 71 [2025-03-08 18:09:34,364 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 18:09:34,370 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 18:09:34,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 67 [2025-03-08 18:09:34,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [843003082] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 18:09:34,504 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 18:09:34,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 20] total 32 [2025-03-08 18:09:34,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935740907] [2025-03-08 18:09:34,504 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 18:09:34,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-08 18:09:34,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:09:34,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-08 18:09:34,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=1840, Unknown=7, NotChecked=264, Total=2256 [2025-03-08 18:09:34,506 INFO L87 Difference]: Start difference. First operand 111 states and 144 transitions. Second operand has 32 states, 30 states have (on average 3.8666666666666667) internal successors, (116), 28 states have internal predecessors, (116), 11 states have call successors, (26), 8 states have call predecessors, (26), 8 states have return successors, (23), 9 states have call predecessors, (23), 11 states have call successors, (23)