./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_linked_list_next_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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_next_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 b9d976a5c157b7db1e6b0f8b3d73c13a2dd8a00281a198d3aafefb7aed58d842 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 02:57:43,126 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 02:57:43,182 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-04 02:57:43,185 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 02:57:43,187 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 02:57:43,207 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 02:57:43,207 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 02:57:43,208 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 02:57:43,208 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 02:57:43,208 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 02:57:43,209 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 02:57:43,209 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 02:57:43,209 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 02:57:43,209 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 02:57:43,209 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 02:57:43,210 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 02:57:43,210 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 02:57:43,210 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 02:57:43,210 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 02:57:43,210 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 02:57:43,210 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 02:57:43,210 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 02:57:43,210 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 02:57:43,210 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 02:57:43,211 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 02:57:43,211 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 02:57:43,211 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 02:57:43,211 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 02:57:43,211 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 02:57:43,211 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:57:43,211 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 02:57:43,211 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 02:57:43,211 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 02:57:43,211 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 02:57:43,212 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 02:57:43,212 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 02:57:43,212 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 02:57:43,212 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 02:57:43,212 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 02:57:43,212 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 02:57:43,212 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 -> b9d976a5c157b7db1e6b0f8b3d73c13a2dd8a00281a198d3aafefb7aed58d842 [2025-03-04 02:57:43,428 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 02:57:43,433 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 02:57:43,435 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 02:57:43,436 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 02:57:43,436 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 02:57:43,437 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_next_harness.i [2025-03-04 02:57:44,550 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5c741713/3c6f26249202408aad138047c7ee9fa3/FLAG1a6fc3630 [2025-03-04 02:57:44,910 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 02:57:44,911 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_next_harness.i [2025-03-04 02:57:44,934 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5c741713/3c6f26249202408aad138047c7ee9fa3/FLAG1a6fc3630 [2025-03-04 02:57:44,947 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5c741713/3c6f26249202408aad138047c7ee9fa3 [2025-03-04 02:57:44,949 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 02:57:44,950 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 02:57:44,951 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 02:57:44,951 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 02:57:44,954 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 02:57:44,954 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:57:44" (1/1) ... [2025-03-04 02:57:44,955 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f3aca65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:57:44, skipping insertion in model container [2025-03-04 02:57:44,955 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:57:44" (1/1) ... [2025-03-04 02:57:45,005 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 02:57:45,165 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_next_harness.i[4494,4507] [2025-03-04 02:57:45,170 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_next_harness.i[4554,4567] [2025-03-04 02:57:45,545 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:57:45,546 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:57:45,546 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:57:45,548 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:57:45,549 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:57:45,561 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:57:45,562 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:57:45,563 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:57:45,563 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:57:45,564 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:57:45,565 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:57:45,565 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:57:45,565 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:57:45,844 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_next_harness.i[150474,150487] [2025-03-04 02:57:45,847 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:57:45,857 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 02:57:45,866 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_next_harness.i[4494,4507] [2025-03-04 02:57:45,866 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_next_harness.i[4554,4567] [2025-03-04 02:57:45,905 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:57:45,906 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:57:45,906 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:57:45,906 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:57:45,906 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:57:45,916 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:57:45,917 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:57:45,918 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:57:45,918 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:57:45,919 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:57:45,919 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:57:45,920 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:57:45,920 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:57:45,994 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_next_harness.i[150474,150487] [2025-03-04 02:57:45,995 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:57:46,115 INFO L204 MainTranslator]: Completed translation [2025-03-04 02:57:46,115 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:57:46 WrapperNode [2025-03-04 02:57:46,116 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 02:57:46,117 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 02:57:46,117 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 02:57:46,117 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 02:57:46,120 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:57:46" (1/1) ... [2025-03-04 02:57:46,162 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:57:46" (1/1) ... [2025-03-04 02:57:46,187 INFO L138 Inliner]: procedures = 668, calls = 1039, calls flagged for inlining = 51, calls inlined = 4, statements flattened = 56 [2025-03-04 02:57:46,188 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 02:57:46,188 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 02:57:46,188 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 02:57:46,188 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 02:57:46,194 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:57:46" (1/1) ... [2025-03-04 02:57:46,195 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:57:46" (1/1) ... [2025-03-04 02:57:46,197 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:57:46" (1/1) ... [2025-03-04 02:57:46,215 INFO L175 MemorySlicer]: Split 17 memory accesses to 4 slices as follows [2, 6, 5, 4]. 35 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 0, 5, 0]. The 2 writes are split as follows [0, 1, 0, 1]. [2025-03-04 02:57:46,216 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:57:46" (1/1) ... [2025-03-04 02:57:46,216 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:57:46" (1/1) ... [2025-03-04 02:57:46,222 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:57:46" (1/1) ... [2025-03-04 02:57:46,223 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:57:46" (1/1) ... [2025-03-04 02:57:46,224 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:57:46" (1/1) ... [2025-03-04 02:57:46,225 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:57:46" (1/1) ... [2025-03-04 02:57:46,227 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 02:57:46,228 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 02:57:46,228 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 02:57:46,228 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 02:57:46,229 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:57:46" (1/1) ... [2025-03-04 02:57:46,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:57:46,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:57:46,257 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-04 02:57:46,261 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-04 02:57:46,275 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 02:57:46,275 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-04 02:57:46,275 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-04 02:57:46,275 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2025-03-04 02:57:46,275 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2025-03-04 02:57:46,275 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 02:57:46,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 02:57:46,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 02:57:46,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 02:57:46,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-04 02:57:46,276 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 02:57:46,276 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 02:57:46,276 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 02:57:46,276 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 02:57:46,276 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 02:57:46,276 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 02:57:46,276 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 02:57:46,276 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 02:57:46,276 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-04 02:57:46,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-04 02:57:46,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-04 02:57:46,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-04 02:57:46,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-04 02:57:46,276 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_prev_is_valid [2025-03-04 02:57:46,276 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_prev_is_valid [2025-03-04 02:57:46,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 02:57:46,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 02:57:46,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 02:57:46,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 02:57:46,416 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 02:57:46,417 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 02:57:46,457 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4720: havoc #t~mem308.base, #t~mem308.offset;havoc #t~short309;havoc #t~mem310.base, #t~mem310.offset;havoc #t~mem311.base, #t~mem311.offset;havoc #t~short312; [2025-03-04 02:57:46,469 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4731: havoc #t~mem313.base, #t~mem313.offset;havoc #t~short314;havoc #t~mem315.base, #t~mem315.offset;havoc #t~mem316.base, #t~mem316.offset;havoc #t~short317; [2025-03-04 02:57:46,545 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2025-03-04 02:57:46,545 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 02:57:46,553 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 02:57:46,553 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 02:57:46,554 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:57:46 BoogieIcfgContainer [2025-03-04 02:57:46,554 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 02:57:46,555 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 02:57:46,555 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 02:57:46,579 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 02:57:46,579 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:57:44" (1/3) ... [2025-03-04 02:57:46,579 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b0e56dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:57:46, skipping insertion in model container [2025-03-04 02:57:46,580 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:57:46" (2/3) ... [2025-03-04 02:57:46,580 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b0e56dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:57:46, skipping insertion in model container [2025-03-04 02:57:46,580 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:57:46" (3/3) ... [2025-03-04 02:57:46,581 INFO L128 eAbstractionObserver]: Analyzing ICFG aws_linked_list_next_harness.i [2025-03-04 02:57:46,591 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 02:57:46,592 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG aws_linked_list_next_harness.i that has 5 procedures, 50 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-04 02:57:46,625 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:57:46,632 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;@6bd003e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:57:46,632 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 02:57:46,634 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 02:57:46,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-04 02:57:46,638 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:57:46,638 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:57:46,639 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:57:46,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:57:46,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1687714860, now seen corresponding path program 1 times [2025-03-04 02:57:46,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:57:46,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061667993] [2025-03-04 02:57:46,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:57:46,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:57:46,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 02:57:46,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 02:57:46,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:57:46,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:57:46,890 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 02:57:46,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:57:46,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061667993] [2025-03-04 02:57:46,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061667993] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:57:46,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:57:46,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 02:57:46,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024756580] [2025-03-04 02:57:46,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:57:46,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 02:57:46,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:57:46,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 02:57:46,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 02:57:46,908 INFO L87 Difference]: Start difference. First operand has 50 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 02:57:46,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:57:46,924 INFO L93 Difference]: Finished difference Result 94 states and 124 transitions. [2025-03-04 02:57:46,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 02:57:46,925 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 28 [2025-03-04 02:57:46,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:57:46,930 INFO L225 Difference]: With dead ends: 94 [2025-03-04 02:57:46,930 INFO L226 Difference]: Without dead ends: 45 [2025-03-04 02:57:46,933 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 02:57:46,935 INFO L435 NwaCegarLoop]: 61 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, 61 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-04 02:57:46,937 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 02:57:46,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-03-04 02:57:46,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2025-03-04 02:57:46,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 29 states have internal predecessors, (33), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 02:57:46,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 56 transitions. [2025-03-04 02:57:46,959 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 56 transitions. Word has length 28 [2025-03-04 02:57:46,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:57:46,959 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 56 transitions. [2025-03-04 02:57:46,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 02:57:46,961 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 56 transitions. [2025-03-04 02:57:46,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-04 02:57:46,962 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:57:46,962 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:57:46,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 02:57:46,963 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:57:46,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:57:46,963 INFO L85 PathProgramCache]: Analyzing trace with hash 2096718259, now seen corresponding path program 1 times [2025-03-04 02:57:46,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:57:46,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244766737] [2025-03-04 02:57:46,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:57:46,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:57:47,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 02:57:47,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 02:57:47,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:57:47,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:57:48,108 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:57:48,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:57:48,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244766737] [2025-03-04 02:57:48,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244766737] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:57:48,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:57:48,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 02:57:48,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809924110] [2025-03-04 02:57:48,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:57:48,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 02:57:48,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:57:48,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 02:57:48,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 02:57:48,112 INFO L87 Difference]: Start difference. First operand 45 states and 56 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 02:57:48,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:57:48,291 INFO L93 Difference]: Finished difference Result 56 states and 69 transitions. [2025-03-04 02:57:48,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 02:57:48,291 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2025-03-04 02:57:48,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:57:48,293 INFO L225 Difference]: With dead ends: 56 [2025-03-04 02:57:48,293 INFO L226 Difference]: Without dead ends: 54 [2025-03-04 02:57:48,293 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-04 02:57:48,294 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 9 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 02:57:48,294 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 312 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 02:57:48,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-03-04 02:57:48,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2025-03-04 02:57:48,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 35 states have internal predecessors, (38), 13 states have call successors, (13), 5 states have call predecessors, (13), 6 states have return successors, (15), 12 states have call predecessors, (15), 12 states have call successors, (15) [2025-03-04 02:57:48,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 66 transitions. [2025-03-04 02:57:48,307 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 66 transitions. Word has length 28 [2025-03-04 02:57:48,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:57:48,307 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 66 transitions. [2025-03-04 02:57:48,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 02:57:48,308 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 66 transitions. [2025-03-04 02:57:48,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-04 02:57:48,309 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:57:48,309 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:57:48,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 02:57:48,309 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:57:48,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:57:48,309 INFO L85 PathProgramCache]: Analyzing trace with hash -455438702, now seen corresponding path program 1 times [2025-03-04 02:57:48,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:57:48,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846959564] [2025-03-04 02:57:48,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:57:48,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:57:48,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 02:57:48,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 02:57:48,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:57:48,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:57:48,523 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:57:48,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:57:48,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846959564] [2025-03-04 02:57:48,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846959564] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:57:48,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:57:48,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 02:57:48,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388148149] [2025-03-04 02:57:48,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:57:48,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 02:57:48,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:57:48,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 02:57:48,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 02:57:48,525 INFO L87 Difference]: Start difference. First operand 53 states and 66 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 02:57:48,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:57:48,641 INFO L93 Difference]: Finished difference Result 108 states and 135 transitions. [2025-03-04 02:57:48,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 02:57:48,643 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2025-03-04 02:57:48,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:57:48,644 INFO L225 Difference]: With dead ends: 108 [2025-03-04 02:57:48,644 INFO L226 Difference]: Without dead ends: 58 [2025-03-04 02:57:48,644 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-04 02:57:48,645 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 11 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 02:57:48,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 201 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 02:57:48,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-03-04 02:57:48,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2025-03-04 02:57:48,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 37 states have (on average 1.162162162162162) internal successors, (43), 40 states have internal predecessors, (43), 13 states have call successors, (13), 5 states have call predecessors, (13), 7 states have return successors, (16), 12 states have call predecessors, (16), 12 states have call successors, (16) [2025-03-04 02:57:48,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 72 transitions. [2025-03-04 02:57:48,654 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 72 transitions. Word has length 28 [2025-03-04 02:57:48,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:57:48,656 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 72 transitions. [2025-03-04 02:57:48,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 02:57:48,656 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 72 transitions. [2025-03-04 02:57:48,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-04 02:57:48,656 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:57:48,656 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:57:48,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 02:57:48,657 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:57:48,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:57:48,659 INFO L85 PathProgramCache]: Analyzing trace with hash -651952207, now seen corresponding path program 1 times [2025-03-04 02:57:48,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:57:48,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681223012] [2025-03-04 02:57:48,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:57:48,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:57:48,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 02:57:48,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 02:57:48,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:57:48,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:57:48,756 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:57:48,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:57:48,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681223012] [2025-03-04 02:57:48,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681223012] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:57:48,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:57:48,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:57:48,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049786658] [2025-03-04 02:57:48,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:57:48,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:57:48,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:57:48,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:57:48,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:57:48,758 INFO L87 Difference]: Start difference. First operand 58 states and 72 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 02:57:48,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:57:48,790 INFO L93 Difference]: Finished difference Result 115 states and 142 transitions. [2025-03-04 02:57:48,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:57:48,791 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2025-03-04 02:57:48,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:57:48,791 INFO L225 Difference]: With dead ends: 115 [2025-03-04 02:57:48,791 INFO L226 Difference]: Without dead ends: 60 [2025-03-04 02:57:48,792 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:57:48,792 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 3 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 02:57:48,792 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 151 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 02:57:48,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-03-04 02:57:48,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 54. [2025-03-04 02:57:48,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 37 states have internal predecessors, (41), 12 states have call successors, (12), 5 states have call predecessors, (12), 6 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2025-03-04 02:57:48,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 65 transitions. [2025-03-04 02:57:48,801 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 65 transitions. Word has length 28 [2025-03-04 02:57:48,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:57:48,801 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 65 transitions. [2025-03-04 02:57:48,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 02:57:48,802 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2025-03-04 02:57:48,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-04 02:57:48,802 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:57:48,803 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:57:48,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 02:57:48,803 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:57:48,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:57:48,804 INFO L85 PathProgramCache]: Analyzing trace with hash -837677627, now seen corresponding path program 1 times [2025-03-04 02:57:48,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:57:48,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416104160] [2025-03-04 02:57:48,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:57:48,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:57:48,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 02:57:48,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 02:57:48,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:57:48,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:57:50,020 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:57:50,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:57:50,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416104160] [2025-03-04 02:57:50,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416104160] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:57:50,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [694285333] [2025-03-04 02:57:50,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:57:50,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:57:50,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:57:50,023 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-04 02:57:50,025 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-04 02:57:50,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 02:57:50,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 02:57:50,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:57:50,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:57:50,136 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 69 conjuncts are in the unsatisfiable core [2025-03-04 02:57:50,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:57:50,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-04 02:57:50,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 02:57:50,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-04 02:57:50,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 02:57:51,121 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 02:57:51,121 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:57:51,593 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 02:57:51,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [694285333] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 02:57:51,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 02:57:51,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [19, 13] total 35 [2025-03-04 02:57:51,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188482879] [2025-03-04 02:57:51,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:57:51,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 02:57:51,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:57:51,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 02:57:51,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1088, Unknown=0, NotChecked=0, Total=1190 [2025-03-04 02:57:51,595 INFO L87 Difference]: Start difference. First operand 54 states and 65 transitions. Second operand has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 02:57:51,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:57:51,817 INFO L93 Difference]: Finished difference Result 65 states and 77 transitions. [2025-03-04 02:57:51,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 02:57:51,818 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 42 [2025-03-04 02:57:51,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:57:51,819 INFO L225 Difference]: With dead ends: 65 [2025-03-04 02:57:51,820 INFO L226 Difference]: Without dead ends: 63 [2025-03-04 02:57:51,820 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 60 SyntacticMatches, 9 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=117, Invalid=1289, Unknown=0, NotChecked=0, Total=1406 [2025-03-04 02:57:51,821 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 11 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 02:57:51,821 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 343 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 02:57:51,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-03-04 02:57:51,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2025-03-04 02:57:51,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 40 states have (on average 1.15) internal successors, (46), 43 states have internal predecessors, (46), 13 states have call successors, (13), 6 states have call predecessors, (13), 8 states have return successors, (15), 12 states have call predecessors, (15), 12 states have call successors, (15) [2025-03-04 02:57:51,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 74 transitions. [2025-03-04 02:57:51,832 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 74 transitions. Word has length 42 [2025-03-04 02:57:51,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:57:51,833 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 74 transitions. [2025-03-04 02:57:51,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 02:57:51,833 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 74 transitions. [2025-03-04 02:57:51,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-04 02:57:51,834 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:57:51,834 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:57:51,842 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 02:57:52,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:57:52,039 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:57:52,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:57:52,039 INFO L85 PathProgramCache]: Analyzing trace with hash 905132708, now seen corresponding path program 1 times [2025-03-04 02:57:52,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:57:52,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426246436] [2025-03-04 02:57:52,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:57:52,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:57:52,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 02:57:52,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 02:57:52,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:57:52,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:57:52,446 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 02:57:52,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:57:52,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426246436] [2025-03-04 02:57:52,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426246436] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:57:52,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:57:52,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 02:57:52,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429291430] [2025-03-04 02:57:52,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:57:52,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 02:57:52,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:57:52,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 02:57:52,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-04 02:57:52,448 INFO L87 Difference]: Start difference. First operand 62 states and 74 transitions. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 02:57:52,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:57:52,596 INFO L93 Difference]: Finished difference Result 107 states and 129 transitions. [2025-03-04 02:57:52,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 02:57:52,597 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 42 [2025-03-04 02:57:52,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:57:52,597 INFO L225 Difference]: With dead ends: 107 [2025-03-04 02:57:52,597 INFO L226 Difference]: Without dead ends: 67 [2025-03-04 02:57:52,598 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-03-04 02:57:52,598 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 13 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 02:57:52,598 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 257 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 02:57:52,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-03-04 02:57:52,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2025-03-04 02:57:52,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 44 states have (on average 1.1590909090909092) internal successors, (51), 48 states have internal predecessors, (51), 13 states have call successors, (13), 6 states have call predecessors, (13), 9 states have return successors, (16), 12 states have call predecessors, (16), 12 states have call successors, (16) [2025-03-04 02:57:52,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 80 transitions. [2025-03-04 02:57:52,610 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 80 transitions. Word has length 42 [2025-03-04 02:57:52,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:57:52,610 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 80 transitions. [2025-03-04 02:57:52,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 02:57:52,610 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 80 transitions. [2025-03-04 02:57:52,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-04 02:57:52,612 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:57:52,612 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:57:52,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 02:57:52,612 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:57:52,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:57:52,613 INFO L85 PathProgramCache]: Analyzing trace with hash 708619203, now seen corresponding path program 1 times [2025-03-04 02:57:52,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:57:52,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693434722] [2025-03-04 02:57:52,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:57:52,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:57:52,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 02:57:52,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 02:57:52,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:57:52,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:57:52,733 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 02:57:52,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:57:52,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693434722] [2025-03-04 02:57:52,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693434722] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:57:52,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:57:52,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 02:57:52,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625945210] [2025-03-04 02:57:52,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:57:52,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 02:57:52,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:57:52,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 02:57:52,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 02:57:52,738 INFO L87 Difference]: Start difference. First operand 67 states and 80 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 02:57:52,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:57:52,794 INFO L93 Difference]: Finished difference Result 119 states and 141 transitions. [2025-03-04 02:57:52,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 02:57:52,797 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 42 [2025-03-04 02:57:52,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:57:52,797 INFO L225 Difference]: With dead ends: 119 [2025-03-04 02:57:52,798 INFO L226 Difference]: Without dead ends: 69 [2025-03-04 02:57:52,798 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 02:57:52,798 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 4 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 02:57:52,798 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 235 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 02:57:52,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-03-04 02:57:52,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 63. [2025-03-04 02:57:52,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 42 states have (on average 1.1666666666666667) internal successors, (49), 45 states have internal predecessors, (49), 12 states have call successors, (12), 6 states have call predecessors, (12), 8 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2025-03-04 02:57:52,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 74 transitions. [2025-03-04 02:57:52,812 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 74 transitions. Word has length 42 [2025-03-04 02:57:52,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:57:52,813 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 74 transitions. [2025-03-04 02:57:52,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 02:57:52,813 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 74 transitions. [2025-03-04 02:57:52,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-04 02:57:52,814 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:57:52,814 INFO L218 NwaCegarLoop]: trace histogram [3, 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] [2025-03-04 02:57:52,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 02:57:52,814 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:57:52,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:57:52,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1872017092, now seen corresponding path program 1 times [2025-03-04 02:57:52,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:57:52,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780391042] [2025-03-04 02:57:52,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:57:52,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:57:52,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-04 02:57:52,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-04 02:57:52,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:57:52,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:57:52,981 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-04 02:57:52,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:57:52,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780391042] [2025-03-04 02:57:52,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780391042] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:57:52,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:57:52,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 02:57:52,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756926660] [2025-03-04 02:57:52,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:57:52,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 02:57:52,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:57:52,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 02:57:52,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 02:57:52,983 INFO L87 Difference]: Start difference. First operand 63 states and 74 transitions. Second operand has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-04 02:57:53,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:57:53,034 INFO L93 Difference]: Finished difference Result 69 states and 79 transitions. [2025-03-04 02:57:53,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 02:57:53,035 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 48 [2025-03-04 02:57:53,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:57:53,036 INFO L225 Difference]: With dead ends: 69 [2025-03-04 02:57:53,036 INFO L226 Difference]: Without dead ends: 67 [2025-03-04 02:57:53,036 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 02:57:53,036 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 3 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 02:57:53,037 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 237 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 02:57:53,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-03-04 02:57:53,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2025-03-04 02:57:53,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 48 states have internal predecessors, (52), 12 states have call successors, (12), 7 states have call predecessors, (12), 9 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2025-03-04 02:57:53,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 77 transitions. [2025-03-04 02:57:53,043 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 77 transitions. Word has length 48 [2025-03-04 02:57:53,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:57:53,043 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 77 transitions. [2025-03-04 02:57:53,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-04 02:57:53,043 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 77 transitions. [2025-03-04 02:57:53,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-04 02:57:53,044 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:57:53,044 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:57:53,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 02:57:53,044 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:57:53,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:57:53,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1741554262, now seen corresponding path program 1 times [2025-03-04 02:57:53,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:57:53,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572763129] [2025-03-04 02:57:53,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:57:53,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:57:53,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-04 02:57:53,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-04 02:57:53,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:57:53,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:57:53,600 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-04 02:57:53,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:57:53,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572763129] [2025-03-04 02:57:53,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572763129] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:57:53,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:57:53,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 02:57:53,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620121258] [2025-03-04 02:57:53,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:57:53,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 02:57:53,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:57:53,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 02:57:53,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 02:57:53,602 INFO L87 Difference]: Start difference. First operand 67 states and 77 transitions. Second operand has 9 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-04 02:57:53,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:57:53,745 INFO L93 Difference]: Finished difference Result 78 states and 88 transitions. [2025-03-04 02:57:53,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 02:57:53,746 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 63 [2025-03-04 02:57:53,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:57:53,747 INFO L225 Difference]: With dead ends: 78 [2025-03-04 02:57:53,747 INFO L226 Difference]: Without dead ends: 76 [2025-03-04 02:57:53,747 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-04 02:57:53,747 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 10 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 02:57:53,747 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 301 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 02:57:53,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-03-04 02:57:53,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2025-03-04 02:57:53,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 50 states have (on average 1.14) internal successors, (57), 54 states have internal predecessors, (57), 13 states have call successors, (13), 8 states have call predecessors, (13), 11 states have return successors, (15), 12 states have call predecessors, (15), 12 states have call successors, (15) [2025-03-04 02:57:53,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 85 transitions. [2025-03-04 02:57:53,758 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 85 transitions. Word has length 63 [2025-03-04 02:57:53,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:57:53,759 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 85 transitions. [2025-03-04 02:57:53,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-04 02:57:53,759 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 85 transitions. [2025-03-04 02:57:53,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-04 02:57:53,760 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:57:53,760 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 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-04 02:57:53,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 02:57:53,761 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:57:53,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:57:53,762 INFO L85 PathProgramCache]: Analyzing trace with hash -810602699, now seen corresponding path program 1 times [2025-03-04 02:57:53,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:57:53,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532380195] [2025-03-04 02:57:53,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:57:53,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:57:53,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-04 02:57:53,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-04 02:57:53,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:57:53,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:57:53,936 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-04 02:57:53,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:57:53,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532380195] [2025-03-04 02:57:53,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532380195] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:57:53,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:57:53,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 02:57:53,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718659249] [2025-03-04 02:57:53,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:57:53,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 02:57:53,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:57:53,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 02:57:53,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 02:57:53,937 INFO L87 Difference]: Start difference. First operand 75 states and 85 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-04 02:57:54,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:57:54,033 INFO L93 Difference]: Finished difference Result 102 states and 116 transitions. [2025-03-04 02:57:54,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 02:57:54,034 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 63 [2025-03-04 02:57:54,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:57:54,035 INFO L225 Difference]: With dead ends: 102 [2025-03-04 02:57:54,035 INFO L226 Difference]: Without dead ends: 75 [2025-03-04 02:57:54,035 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-04 02:57:54,035 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 12 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 02:57:54,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 167 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 02:57:54,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-03-04 02:57:54,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2025-03-04 02:57:54,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 50 states have (on average 1.12) internal successors, (56), 54 states have internal predecessors, (56), 13 states have call successors, (13), 8 states have call predecessors, (13), 11 states have return successors, (15), 12 states have call predecessors, (15), 12 states have call successors, (15) [2025-03-04 02:57:54,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 84 transitions. [2025-03-04 02:57:54,042 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 84 transitions. Word has length 63 [2025-03-04 02:57:54,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:57:54,042 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 84 transitions. [2025-03-04 02:57:54,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-04 02:57:54,042 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 84 transitions. [2025-03-04 02:57:54,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-04 02:57:54,043 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:57:54,043 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:57:54,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 02:57:54,043 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:57:54,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:57:54,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1007116204, now seen corresponding path program 1 times [2025-03-04 02:57:54,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:57:54,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211210704] [2025-03-04 02:57:54,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:57:54,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:57:54,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-04 02:57:54,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-04 02:57:54,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:57:54,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:57:54,122 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-04 02:57:54,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:57:54,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211210704] [2025-03-04 02:57:54,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211210704] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:57:54,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:57:54,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:57:54,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862572428] [2025-03-04 02:57:54,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:57:54,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:57:54,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:57:54,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:57:54,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:57:54,124 INFO L87 Difference]: Start difference. First operand 75 states and 84 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-04 02:57:54,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:57:54,141 INFO L93 Difference]: Finished difference Result 103 states and 115 transitions. [2025-03-04 02:57:54,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:57:54,141 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 63 [2025-03-04 02:57:54,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:57:54,142 INFO L225 Difference]: With dead ends: 103 [2025-03-04 02:57:54,142 INFO L226 Difference]: Without dead ends: 66 [2025-03-04 02:57:54,143 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:57:54,144 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 4 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 02:57:54,144 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 144 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 02:57:54,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-03-04 02:57:54,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2025-03-04 02:57:54,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 44 states have (on average 1.0909090909090908) internal successors, (48), 46 states have internal predecessors, (48), 12 states have call successors, (12), 8 states have call predecessors, (12), 9 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2025-03-04 02:57:54,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 72 transitions. [2025-03-04 02:57:54,154 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 72 transitions. Word has length 63 [2025-03-04 02:57:54,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:57:54,154 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 72 transitions. [2025-03-04 02:57:54,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-04 02:57:54,155 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 72 transitions. [2025-03-04 02:57:54,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-04 02:57:54,155 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:57:54,155 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:57:54,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 02:57:54,155 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:57:54,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:57:54,156 INFO L85 PathProgramCache]: Analyzing trace with hash 498681714, now seen corresponding path program 1 times [2025-03-04 02:57:54,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:57:54,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955661602] [2025-03-04 02:57:54,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:57:54,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:57:54,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-04 02:57:54,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-04 02:57:54,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:57:54,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:57:54,966 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-04 02:57:54,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:57:54,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955661602] [2025-03-04 02:57:54,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955661602] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:57:54,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:57:54,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-04 02:57:54,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469359368] [2025-03-04 02:57:54,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:57:54,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 02:57:54,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:57:54,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 02:57:54,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-03-04 02:57:54,969 INFO L87 Difference]: Start difference. First operand 66 states and 72 transitions. Second operand has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 states have internal predecessors, (35), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) [2025-03-04 02:57:55,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:57:55,167 INFO L93 Difference]: Finished difference Result 77 states and 83 transitions. [2025-03-04 02:57:55,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 02:57:55,168 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 states have internal predecessors, (35), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) Word has length 77 [2025-03-04 02:57:55,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:57:55,169 INFO L225 Difference]: With dead ends: 77 [2025-03-04 02:57:55,169 INFO L226 Difference]: Without dead ends: 75 [2025-03-04 02:57:55,169 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2025-03-04 02:57:55,169 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 9 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 02:57:55,170 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 348 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 02:57:55,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-03-04 02:57:55,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2025-03-04 02:57:55,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 49 states have (on average 1.0816326530612246) internal successors, (53), 52 states have internal predecessors, (53), 13 states have call successors, (13), 9 states have call predecessors, (13), 11 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) [2025-03-04 02:57:55,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2025-03-04 02:57:55,176 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 77 [2025-03-04 02:57:55,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:57:55,176 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2025-03-04 02:57:55,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 states have internal predecessors, (35), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) [2025-03-04 02:57:55,177 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2025-03-04 02:57:55,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-04 02:57:55,177 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:57:55,177 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 3, 3, 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-04 02:57:55,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 02:57:55,177 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:57:55,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:57:55,177 INFO L85 PathProgramCache]: Analyzing trace with hash -2053475247, now seen corresponding path program 1 times [2025-03-04 02:57:55,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:57:55,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868487141] [2025-03-04 02:57:55,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:57:55,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:57:55,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-04 02:57:55,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-04 02:57:55,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:57:55,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:57:55,618 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-04 02:57:55,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:57:55,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868487141] [2025-03-04 02:57:55,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868487141] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:57:55,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:57:55,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 02:57:55,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218300994] [2025-03-04 02:57:55,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:57:55,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 02:57:55,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:57:55,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 02:57:55,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-04 02:57:55,619 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) [2025-03-04 02:57:55,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:57:55,808 INFO L93 Difference]: Finished difference Result 86 states and 92 transitions. [2025-03-04 02:57:55,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 02:57:55,809 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) Word has length 77 [2025-03-04 02:57:55,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:57:55,809 INFO L225 Difference]: With dead ends: 86 [2025-03-04 02:57:55,809 INFO L226 Difference]: Without dead ends: 74 [2025-03-04 02:57:55,810 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2025-03-04 02:57:55,810 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 13 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 02:57:55,810 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 240 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 02:57:55,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-03-04 02:57:55,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2025-03-04 02:57:55,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 49 states have (on average 1.0612244897959184) internal successors, (52), 52 states have internal predecessors, (52), 13 states have call successors, (13), 9 states have call predecessors, (13), 11 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) [2025-03-04 02:57:55,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 79 transitions. [2025-03-04 02:57:55,816 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 79 transitions. Word has length 77 [2025-03-04 02:57:55,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:57:55,817 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 79 transitions. [2025-03-04 02:57:55,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) [2025-03-04 02:57:55,817 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2025-03-04 02:57:55,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-04 02:57:55,817 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:57:55,817 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2025-03-04 02:57:55,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 02:57:55,817 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:57:55,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:57:55,817 INFO L85 PathProgramCache]: Analyzing trace with hash 2044978544, now seen corresponding path program 1 times [2025-03-04 02:57:55,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:57:55,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812997280] [2025-03-04 02:57:55,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:57:55,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:57:55,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-04 02:57:55,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-04 02:57:55,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:57:55,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:57:56,005 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-04 02:57:56,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:57:56,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812997280] [2025-03-04 02:57:56,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812997280] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:57:56,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:57:56,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 02:57:56,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83293638] [2025-03-04 02:57:56,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:57:56,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 02:57:56,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:57:56,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 02:57:56,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 02:57:56,006 INFO L87 Difference]: Start difference. First operand 74 states and 79 transitions. Second operand has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) [2025-03-04 02:57:56,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:57:56,070 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2025-03-04 02:57:56,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 02:57:56,071 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) Word has length 77 [2025-03-04 02:57:56,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:57:56,071 INFO L225 Difference]: With dead ends: 87 [2025-03-04 02:57:56,071 INFO L226 Difference]: Without dead ends: 63 [2025-03-04 02:57:56,072 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-04 02:57:56,072 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 4 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 02:57:56,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 356 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 02:57:56,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-03-04 02:57:56,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2025-03-04 02:57:56,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 42 states have (on average 1.0) internal successors, (42), 42 states have internal predecessors, (42), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 02:57:56,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2025-03-04 02:57:56,079 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 65 transitions. Word has length 77 [2025-03-04 02:57:56,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:57:56,080 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 65 transitions. [2025-03-04 02:57:56,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) [2025-03-04 02:57:56,080 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2025-03-04 02:57:56,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-04 02:57:56,080 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:57:56,081 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:57:56,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 02:57:56,081 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:57:56,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:57:56,081 INFO L85 PathProgramCache]: Analyzing trace with hash 938991667, now seen corresponding path program 1 times [2025-03-04 02:57:56,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:57:56,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088668805] [2025-03-04 02:57:56,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:57:56,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:57:56,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-04 02:57:56,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-04 02:57:56,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:57:56,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:57:56,318 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-03-04 02:57:56,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:57:56,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088668805] [2025-03-04 02:57:56,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088668805] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:57:56,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:57:56,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 02:57:56,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114512106] [2025-03-04 02:57:56,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:57:56,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 02:57:56,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:57:56,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 02:57:56,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-04 02:57:56,320 INFO L87 Difference]: Start difference. First operand 63 states and 65 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 4 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2025-03-04 02:57:56,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:57:56,402 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2025-03-04 02:57:56,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 02:57:56,402 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 4 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) Word has length 83 [2025-03-04 02:57:56,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:57:56,402 INFO L225 Difference]: With dead ends: 63 [2025-03-04 02:57:56,402 INFO L226 Difference]: Without dead ends: 0 [2025-03-04 02:57:56,403 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-04 02:57:56,403 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 3 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 02:57:56,403 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 252 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 02:57:56,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-04 02:57:56,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-04 02:57:56,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:57:56,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-04 02:57:56,404 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 83 [2025-03-04 02:57:56,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:57:56,404 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 02:57:56,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 4 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2025-03-04 02:57:56,404 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-04 02:57:56,404 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-04 02:57:56,406 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 02:57:56,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 02:57:56,408 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:57:56,409 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-04 02:57:57,076 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 02:57:57,080 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 02:57:57 BoogieIcfgContainer [2025-03-04 02:57:57,080 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 02:57:57,080 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 02:57:57,080 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 02:57:57,080 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 02:57:57,081 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:57:46" (3/4) ... [2025-03-04 02:57:57,082 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 02:57:57,087 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure aws_linked_list_node_next_is_valid [2025-03-04 02:57:57,087 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure aws_linked_list_node_prev_is_valid [2025-03-04 02:57:57,087 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-03-04 02:57:57,087 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-03-04 02:57:57,089 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2025-03-04 02:57:57,089 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-04 02:57:57,089 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-03-04 02:57:57,090 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 02:57:57,157 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 02:57:57,157 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 02:57:57,157 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 02:57:57,158 INFO L158 Benchmark]: Toolchain (without parser) took 12207.78ms. Allocated memory was 167.8MB in the beginning and 511.7MB in the end (delta: 343.9MB). Free memory was 115.5MB in the beginning and 312.9MB in the end (delta: -197.4MB). Peak memory consumption was 144.0MB. Max. memory is 16.1GB. [2025-03-04 02:57:57,158 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory is still 119.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 02:57:57,158 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1165.27ms. Allocated memory is still 167.8MB. Free memory was 115.5MB in the beginning and 76.0MB in the end (delta: 39.4MB). Peak memory consumption was 102.8MB. Max. memory is 16.1GB. [2025-03-04 02:57:57,158 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.01ms. Allocated memory is still 167.8MB. Free memory was 76.0MB in the beginning and 71.5MB in the end (delta: 4.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 02:57:57,159 INFO L158 Benchmark]: Boogie Preprocessor took 39.39ms. Allocated memory is still 167.8MB. Free memory was 71.5MB in the beginning and 68.4MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 02:57:57,159 INFO L158 Benchmark]: IcfgBuilder took 325.64ms. Allocated memory is still 167.8MB. Free memory was 67.6MB in the beginning and 48.4MB in the end (delta: 19.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 02:57:57,159 INFO L158 Benchmark]: TraceAbstraction took 10524.75ms. Allocated memory was 167.8MB in the beginning and 511.7MB in the end (delta: 343.9MB). Free memory was 47.9MB in the beginning and 321.1MB in the end (delta: -273.2MB). Peak memory consumption was 228.0MB. Max. memory is 16.1GB. [2025-03-04 02:57:57,159 INFO L158 Benchmark]: Witness Printer took 77.23ms. Allocated memory is still 511.7MB. Free memory was 321.1MB in the beginning and 312.9MB in the end (delta: 8.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 02:57:57,160 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory is still 119.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1165.27ms. Allocated memory is still 167.8MB. Free memory was 115.5MB in the beginning and 76.0MB in the end (delta: 39.4MB). Peak memory consumption was 102.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 71.01ms. Allocated memory is still 167.8MB. Free memory was 76.0MB in the beginning and 71.5MB in the end (delta: 4.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.39ms. Allocated memory is still 167.8MB. Free memory was 71.5MB in the beginning and 68.4MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 325.64ms. Allocated memory is still 167.8MB. Free memory was 67.6MB in the beginning and 48.4MB in the end (delta: 19.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 10524.75ms. Allocated memory was 167.8MB in the beginning and 511.7MB in the end (delta: 343.9MB). Free memory was 47.9MB in the beginning and 321.1MB in the end (delta: -273.2MB). Peak memory consumption was 228.0MB. Max. memory is 16.1GB. * Witness Printer took 77.23ms. Allocated memory is still 511.7MB. Free memory was 321.1MB in the beginning and 312.9MB in the end (delta: 8.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 223]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 50 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.8s, OverallIterations: 15, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 146 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 109 mSDsluCounter, 3605 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2824 mSDsCounter, 43 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1604 IncrementalHoareTripleChecker+Invalid, 1647 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 43 mSolverCounterUnsat, 781 mSDtfsCounter, 1604 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 244 GetRequests, 96 SyntacticMatches, 9 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 334 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=75occurred in iteration=9, InterpolantAutomatonStates: 119, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 16 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 6.9s InterpolantComputationTime, 831 NumberOfCodeBlocks, 831 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 856 ConstructedInterpolants, 29 QuantifiedInterpolants, 6304 SizeOfPredicates, 17 NumberOfNonLiveVariables, 244 ConjunctsInSsa, 69 ConjunctsInUnsatCore, 17 InterpolantComputations, 15 PerfectInterpolantSequences, 455/463 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-04 02:57:57,171 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE