./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_linked_list_prev_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/aws-c-common/aws_linked_list_prev_harness.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 3cfefcdaebfc0d2ae96a13658913db77eb9f3dde98071b7e2682ec197ecbe65d --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 17:22:11,108 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 17:22:11,146 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-01-09 17:22:11,149 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 17:22:11,149 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 17:22:11,164 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 17:22:11,165 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 17:22:11,165 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 17:22:11,165 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 17:22:11,165 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 17:22:11,165 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 17:22:11,165 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 17:22:11,166 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 17:22:11,166 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 17:22:11,166 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 17:22:11,166 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 17:22:11,166 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 17:22:11,166 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 17:22:11,166 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 17:22:11,166 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 17:22:11,166 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 17:22:11,166 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 17:22:11,167 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 17:22:11,167 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 17:22:11,167 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 17:22:11,167 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 17:22:11,167 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 17:22:11,167 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 17:22:11,167 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 17:22:11,167 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 17:22:11,167 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 17:22:11,167 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 17:22:11,167 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 17:22:11,168 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 17:22:11,168 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 17:22:11,168 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 17:22:11,168 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 17:22:11,168 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 17:22:11,168 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 17:22:11,168 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 17:22:11,168 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 17:22:11,168 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 17:22:11,168 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 17:22:11,168 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 17:22:11,169 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 17:22:11,169 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3cfefcdaebfc0d2ae96a13658913db77eb9f3dde98071b7e2682ec197ecbe65d [2025-01-09 17:22:11,368 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 17:22:11,373 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 17:22:11,375 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 17:22:11,375 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 17:22:11,376 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 17:22:11,376 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_linked_list_prev_harness.i [2025-01-09 17:22:12,521 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d4fb0d1e2/3746df5abf424fd6b4adf8338b3818d9/FLAG29743e78f [2025-01-09 17:22:13,046 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 17:22:13,047 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_prev_harness.i [2025-01-09 17:22:13,077 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d4fb0d1e2/3746df5abf424fd6b4adf8338b3818d9/FLAG29743e78f [2025-01-09 17:22:13,099 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d4fb0d1e2/3746df5abf424fd6b4adf8338b3818d9 [2025-01-09 17:22:13,102 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 17:22:13,103 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 17:22:13,104 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 17:22:13,104 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 17:22:13,107 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 17:22:13,108 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:22:13" (1/1) ... [2025-01-09 17:22:13,108 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fdd72e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:22:13, skipping insertion in model container [2025-01-09 17:22:13,108 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:22:13" (1/1) ... [2025-01-09 17:22:13,166 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 17:22:13,375 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_prev_harness.i[4494,4507] [2025-01-09 17:22:13,383 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_prev_harness.i[4554,4567] [2025-01-09 17:22:13,824 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:22:13,828 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:22:13,828 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:22:13,829 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:22:13,831 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:22:13,842 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:22:13,843 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:22:13,844 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:22:13,845 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:22:13,846 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:22:13,847 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:22:13,847 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:22:13,847 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:22:14,146 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_prev_harness.i[150478,150491] [2025-01-09 17:22:14,147 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 17:22:14,164 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 17:22:14,174 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_prev_harness.i[4494,4507] [2025-01-09 17:22:14,176 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_prev_harness.i[4554,4567] [2025-01-09 17:22:14,224 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:22:14,224 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:22:14,224 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:22:14,225 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:22:14,225 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:22:14,238 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:22:14,239 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:22:14,240 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:22:14,240 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:22:14,241 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:22:14,241 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:22:14,242 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:22:14,242 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:22:14,309 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_prev_harness.i[150478,150491] [2025-01-09 17:22:14,309 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 17:22:14,450 INFO L204 MainTranslator]: Completed translation [2025-01-09 17:22:14,450 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:22:14 WrapperNode [2025-01-09 17:22:14,451 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 17:22:14,453 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 17:22:14,453 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 17:22:14,454 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 17:22:14,458 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:22:14" (1/1) ... [2025-01-09 17:22:14,499 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:22:14" (1/1) ... [2025-01-09 17:22:14,548 INFO L138 Inliner]: procedures = 668, calls = 1039, calls flagged for inlining = 51, calls inlined = 4, statements flattened = 56 [2025-01-09 17:22:14,548 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 17:22:14,549 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 17:22:14,549 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 17:22:14,549 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 17:22:14,555 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:22:14" (1/1) ... [2025-01-09 17:22:14,556 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:22:14" (1/1) ... [2025-01-09 17:22:14,558 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:22:14" (1/1) ... [2025-01-09 17:22:14,573 INFO L175 MemorySlicer]: Split 17 memory accesses to 4 slices as follows [2, 5, 4, 6]. 35 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5, 0, 0]. The 2 writes are split as follows [0, 0, 1, 1]. [2025-01-09 17:22:14,573 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:22:14" (1/1) ... [2025-01-09 17:22:14,573 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:22:14" (1/1) ... [2025-01-09 17:22:14,584 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:22:14" (1/1) ... [2025-01-09 17:22:14,589 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:22:14" (1/1) ... [2025-01-09 17:22:14,590 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:22:14" (1/1) ... [2025-01-09 17:22:14,594 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:22:14" (1/1) ... [2025-01-09 17:22:14,596 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:22:14" (1/1) ... [2025-01-09 17:22:14,604 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 17:22:14,604 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 17:22:14,604 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 17:22:14,604 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 17:22:14,605 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:22:14" (1/1) ... [2025-01-09 17:22:14,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 17:22:14,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 17:22:14,632 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 17:22:14,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 17:22:14,656 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 17:22:14,656 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-01-09 17:22:14,656 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-01-09 17:22:14,656 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2025-01-09 17:22:14,657 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2025-01-09 17:22:14,657 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 17:22:14,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 17:22:14,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 17:22:14,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-09 17:22:14,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-01-09 17:22:14,658 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 17:22:14,658 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 17:22:14,658 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 17:22:14,658 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 17:22:14,658 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 17:22:14,659 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 17:22:14,659 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 17:22:14,659 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-09 17:22:14,659 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-01-09 17:22:14,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-01-09 17:22:14,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-01-09 17:22:14,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-01-09 17:22:14,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-01-09 17:22:14,660 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_prev_is_valid [2025-01-09 17:22:14,660 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_prev_is_valid [2025-01-09 17:22:14,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 17:22:14,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 17:22:14,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 17:22:14,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 17:22:14,832 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 17:22:14,834 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 17:22:14,981 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2025-01-09 17:22:14,981 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 17:22:14,991 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 17:22:14,991 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 17:22:14,991 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:22:14 BoogieIcfgContainer [2025-01-09 17:22:14,991 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 17:22:14,993 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 17:22:14,993 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 17:22:14,997 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 17:22:14,997 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 05:22:13" (1/3) ... [2025-01-09 17:22:14,998 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19598d4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:22:14, skipping insertion in model container [2025-01-09 17:22:14,998 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:22:14" (2/3) ... [2025-01-09 17:22:15,001 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19598d4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:22:14, skipping insertion in model container [2025-01-09 17:22:15,002 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:22:14" (3/3) ... [2025-01-09 17:22:15,003 INFO L128 eAbstractionObserver]: Analyzing ICFG aws_linked_list_prev_harness.i [2025-01-09 17:22:15,016 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 17:22:15,017 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG aws_linked_list_prev_harness.i that has 5 procedures, 50 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-01-09 17:22:15,057 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 17:22:15,068 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;@59088583, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 17:22:15,068 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 17:22:15,072 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-01-09 17:22:15,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-01-09 17:22:15,078 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:22:15,078 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-01-09 17:22:15,079 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:22:15,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:22:15,083 INFO L85 PathProgramCache]: Analyzing trace with hash 690008246, now seen corresponding path program 1 times [2025-01-09 17:22:15,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:22:15,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011643069] [2025-01-09 17:22:15,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:22:15,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:22:15,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 17:22:15,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 17:22:15,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:22:15,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:22:15,329 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-09 17:22:15,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:22:15,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011643069] [2025-01-09 17:22:15,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011643069] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:22:15,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 17:22:15,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 17:22:15,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841015199] [2025-01-09 17:22:15,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:22:15,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 17:22:15,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:22:15,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 17:22:15,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 17:22:15,348 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-01-09 17:22:15,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:22:15,365 INFO L93 Difference]: Finished difference Result 94 states and 124 transitions. [2025-01-09 17:22:15,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 17:22:15,367 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-01-09 17:22:15,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:22:15,371 INFO L225 Difference]: With dead ends: 94 [2025-01-09 17:22:15,372 INFO L226 Difference]: Without dead ends: 45 [2025-01-09 17:22:15,374 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-01-09 17:22:15,376 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-01-09 17:22:15,378 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-01-09 17:22:15,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-01-09 17:22:15,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2025-01-09 17:22:15,401 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-01-09 17:22:15,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 56 transitions. [2025-01-09 17:22:15,407 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 56 transitions. Word has length 28 [2025-01-09 17:22:15,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:22:15,407 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 56 transitions. [2025-01-09 17:22:15,407 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-01-09 17:22:15,408 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 56 transitions. [2025-01-09 17:22:15,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-01-09 17:22:15,408 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:22:15,408 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-01-09 17:22:15,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 17:22:15,410 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:22:15,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:22:15,410 INFO L85 PathProgramCache]: Analyzing trace with hash -331060108, now seen corresponding path program 1 times [2025-01-09 17:22:15,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:22:15,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22074199] [2025-01-09 17:22:15,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:22:15,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:22:15,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 17:22:15,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 17:22:15,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:22:15,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:22:16,649 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 17:22:16,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:22:16,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22074199] [2025-01-09 17:22:16,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22074199] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:22:16,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 17:22:16,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 17:22:16,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088038495] [2025-01-09 17:22:16,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:22:16,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 17:22:16,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:22:16,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 17:22:16,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-01-09 17:22:16,655 INFO L87 Difference]: Start difference. First operand 45 states and 56 transitions. Second operand has 11 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 3 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-01-09 17:22:16,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:22:16,902 INFO L93 Difference]: Finished difference Result 56 states and 69 transitions. [2025-01-09 17:22:16,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 17:22:16,903 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 3 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-01-09 17:22:16,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:22:16,904 INFO L225 Difference]: With dead ends: 56 [2025-01-09 17:22:16,906 INFO L226 Difference]: Without dead ends: 54 [2025-01-09 17:22:16,906 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-01-09 17:22:16,907 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 14 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 17:22:16,907 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 345 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 17:22:16,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-01-09 17:22:16,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2025-01-09 17:22:16,917 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-01-09 17:22:16,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 66 transitions. [2025-01-09 17:22:16,919 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 66 transitions. Word has length 28 [2025-01-09 17:22:16,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:22:16,919 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 66 transitions. [2025-01-09 17:22:16,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 3 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-01-09 17:22:16,919 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 66 transitions. [2025-01-09 17:22:16,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-01-09 17:22:16,920 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:22:16,920 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-01-09 17:22:16,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 17:22:16,920 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:22:16,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:22:16,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1140406734, now seen corresponding path program 1 times [2025-01-09 17:22:16,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:22:16,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120248779] [2025-01-09 17:22:16,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:22:16,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:22:16,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 17:22:16,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 17:22:16,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:22:16,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:22:17,276 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 17:22:17,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:22:17,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120248779] [2025-01-09 17:22:17,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120248779] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 17:22:17,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [542183812] [2025-01-09 17:22:17,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:22:17,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:22:17,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 17:22:17,283 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 17:22:17,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 17:22:17,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 17:22:17,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 17:22:17,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:22:17,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:22:17,413 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-01-09 17:22:17,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 17:22:17,465 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-01-09 17:22:17,788 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 17:22:17,792 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 17:22:17,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [542183812] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:22:17,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 17:22:17,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 16 [2025-01-09 17:22:17,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076922638] [2025-01-09 17:22:17,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:22:17,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 17:22:17,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:22:17,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 17:22:17,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2025-01-09 17:22:17,794 INFO L87 Difference]: Start difference. First operand 53 states and 66 transitions. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 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-01-09 17:22:18,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:22:18,126 INFO L93 Difference]: Finished difference Result 108 states and 135 transitions. [2025-01-09 17:22:18,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 17:22:18,126 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 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-01-09 17:22:18,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:22:18,127 INFO L225 Difference]: With dead ends: 108 [2025-01-09 17:22:18,127 INFO L226 Difference]: Without dead ends: 58 [2025-01-09 17:22:18,128 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 20 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=364, Unknown=0, NotChecked=0, Total=462 [2025-01-09 17:22:18,128 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 67 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 17:22:18,129 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 165 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 17:22:18,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-01-09 17:22:18,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2025-01-09 17:22:18,135 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-01-09 17:22:18,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 72 transitions. [2025-01-09 17:22:18,136 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 72 transitions. Word has length 28 [2025-01-09 17:22:18,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:22:18,136 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 72 transitions. [2025-01-09 17:22:18,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 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-01-09 17:22:18,136 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 72 transitions. [2025-01-09 17:22:18,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-01-09 17:22:18,137 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:22:18,137 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-01-09 17:22:18,145 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 17:22:18,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:22:18,342 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:22:18,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:22:18,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1533433744, now seen corresponding path program 1 times [2025-01-09 17:22:18,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:22:18,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541174322] [2025-01-09 17:22:18,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:22:18,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:22:18,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 17:22:18,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 17:22:18,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:22:18,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:22:18,418 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 17:22:18,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:22:18,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541174322] [2025-01-09 17:22:18,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541174322] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:22:18,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 17:22:18,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 17:22:18,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903665879] [2025-01-09 17:22:18,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:22:18,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 17:22:18,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:22:18,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 17:22:18,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 17:22:18,419 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-01-09 17:22:18,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:22:18,441 INFO L93 Difference]: Finished difference Result 115 states and 142 transitions. [2025-01-09 17:22:18,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 17:22:18,441 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-01-09 17:22:18,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:22:18,442 INFO L225 Difference]: With dead ends: 115 [2025-01-09 17:22:18,442 INFO L226 Difference]: Without dead ends: 60 [2025-01-09 17:22:18,442 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-01-09 17:22:18,447 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-01-09 17:22:18,447 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-01-09 17:22:18,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-01-09 17:22:18,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 54. [2025-01-09 17:22:18,456 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-01-09 17:22:18,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 65 transitions. [2025-01-09 17:22:18,459 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 65 transitions. Word has length 28 [2025-01-09 17:22:18,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:22:18,459 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 65 transitions. [2025-01-09 17:22:18,459 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-01-09 17:22:18,460 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2025-01-09 17:22:18,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-01-09 17:22:18,461 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:22:18,461 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-01-09 17:22:18,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 17:22:18,461 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:22:18,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:22:18,462 INFO L85 PathProgramCache]: Analyzing trace with hash -398531466, now seen corresponding path program 1 times [2025-01-09 17:22:18,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:22:18,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942743836] [2025-01-09 17:22:18,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:22:18,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:22:18,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-09 17:22:18,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 17:22:18,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:22:18,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:22:19,455 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 17:22:19,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:22:19,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942743836] [2025-01-09 17:22:19,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942743836] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 17:22:19,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [333595254] [2025-01-09 17:22:19,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:22:19,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:22:19,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 17:22:19,457 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 17:22:19,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 17:22:19,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-09 17:22:19,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 17:22:19,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:22:19,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:22:19,567 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 69 conjuncts are in the unsatisfiable core [2025-01-09 17:22:19,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 17:22:19,578 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 23 treesize of output 13 [2025-01-09 17:22:19,583 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 13 treesize of output 9 [2025-01-09 17:22:19,587 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 1 [2025-01-09 17:22:19,590 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 23 treesize of output 13 [2025-01-09 17:22:20,680 INFO L349 Elim1Store]: treesize reduction 23, result has 43.9 percent of original size [2025-01-09 17:22:20,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 193 treesize of output 114 [2025-01-09 17:22:20,731 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 17:22:20,731 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 17:22:21,127 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-09 17:22:21,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [333595254] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 17:22:21,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 17:22:21,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [17, 15] total 35 [2025-01-09 17:22:21,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067845993] [2025-01-09 17:22:21,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:22:21,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 17:22:21,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:22:21,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 17:22:21,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1080, Unknown=0, NotChecked=0, Total=1190 [2025-01-09 17:22:21,129 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-01-09 17:22:21,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:22:21,362 INFO L93 Difference]: Finished difference Result 65 states and 77 transitions. [2025-01-09 17:22:21,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 17:22:21,362 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-01-09 17:22:21,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:22:21,364 INFO L225 Difference]: With dead ends: 65 [2025-01-09 17:22:21,365 INFO L226 Difference]: Without dead ends: 63 [2025-01-09 17:22:21,365 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 62 SyntacticMatches, 6 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=126, Invalid=1280, Unknown=0, NotChecked=0, Total=1406 [2025-01-09 17:22:21,366 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-01-09 17:22:21,366 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-01-09 17:22:21,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-01-09 17:22:21,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2025-01-09 17:22:21,384 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-01-09 17:22:21,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 74 transitions. [2025-01-09 17:22:21,384 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 74 transitions. Word has length 42 [2025-01-09 17:22:21,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:22:21,384 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 74 transitions. [2025-01-09 17:22:21,385 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-01-09 17:22:21,385 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 74 transitions. [2025-01-09 17:22:21,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-01-09 17:22:21,385 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:22:21,385 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-01-09 17:22:21,395 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 17:22:21,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:22:21,586 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:22:21,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:22:21,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1207878092, now seen corresponding path program 1 times [2025-01-09 17:22:21,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:22:21,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133855351] [2025-01-09 17:22:21,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:22:21,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:22:21,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-09 17:22:21,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 17:22:21,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:22:21,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:22:21,942 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-09 17:22:21,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:22:21,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133855351] [2025-01-09 17:22:21,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133855351] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:22:21,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 17:22:21,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 17:22:21,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344445532] [2025-01-09 17:22:21,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:22:21,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 17:22:21,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:22:21,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 17:22:21,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 17:22:21,944 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-01-09 17:22:22,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:22:22,075 INFO L93 Difference]: Finished difference Result 107 states and 129 transitions. [2025-01-09 17:22:22,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 17:22:22,075 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-01-09 17:22:22,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:22:22,076 INFO L225 Difference]: With dead ends: 107 [2025-01-09 17:22:22,076 INFO L226 Difference]: Without dead ends: 67 [2025-01-09 17:22:22,077 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-01-09 17:22:22,077 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 13 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 17:22:22,077 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 223 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 17:22:22,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-01-09 17:22:22,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2025-01-09 17:22:22,084 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-01-09 17:22:22,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 80 transitions. [2025-01-09 17:22:22,085 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 80 transitions. Word has length 42 [2025-01-09 17:22:22,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:22:22,085 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 80 transitions. [2025-01-09 17:22:22,085 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-01-09 17:22:22,085 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 80 transitions. [2025-01-09 17:22:22,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-01-09 17:22:22,086 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:22:22,086 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-01-09 17:22:22,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 17:22:22,086 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:22:22,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:22:22,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1600905102, now seen corresponding path program 1 times [2025-01-09 17:22:22,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:22:22,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205546114] [2025-01-09 17:22:22,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:22:22,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:22:22,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-09 17:22:22,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 17:22:22,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:22:22,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:22:22,257 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-09 17:22:22,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:22:22,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205546114] [2025-01-09 17:22:22,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205546114] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:22:22,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 17:22:22,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 17:22:22,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542043492] [2025-01-09 17:22:22,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:22:22,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 17:22:22,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:22:22,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 17:22:22,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 17:22:22,259 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-01-09 17:22:22,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:22:22,314 INFO L93 Difference]: Finished difference Result 119 states and 141 transitions. [2025-01-09 17:22:22,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 17:22:22,315 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-01-09 17:22:22,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:22:22,315 INFO L225 Difference]: With dead ends: 119 [2025-01-09 17:22:22,315 INFO L226 Difference]: Without dead ends: 69 [2025-01-09 17:22:22,316 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-01-09 17:22:22,316 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-01-09 17:22:22,316 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-01-09 17:22:22,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-01-09 17:22:22,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 63. [2025-01-09 17:22:22,324 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-01-09 17:22:22,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 74 transitions. [2025-01-09 17:22:22,325 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 74 transitions. Word has length 42 [2025-01-09 17:22:22,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:22:22,325 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 74 transitions. [2025-01-09 17:22:22,325 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-01-09 17:22:22,325 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 74 transitions. [2025-01-09 17:22:22,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-01-09 17:22:22,326 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:22:22,326 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-01-09 17:22:22,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 17:22:22,327 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:22:22,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:22:22,327 INFO L85 PathProgramCache]: Analyzing trace with hash -181120997, now seen corresponding path program 1 times [2025-01-09 17:22:22,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:22:22,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974300832] [2025-01-09 17:22:22,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:22:22,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:22:22,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-09 17:22:22,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-09 17:22:22,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:22:22,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:22:22,491 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-09 17:22:22,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:22:22,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974300832] [2025-01-09 17:22:22,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974300832] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:22:22,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 17:22:22,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 17:22:22,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012796707] [2025-01-09 17:22:22,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:22:22,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 17:22:22,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:22:22,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 17:22:22,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 17:22:22,493 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-01-09 17:22:22,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:22:22,541 INFO L93 Difference]: Finished difference Result 69 states and 79 transitions. [2025-01-09 17:22:22,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 17:22:22,542 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-01-09 17:22:22,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:22:22,543 INFO L225 Difference]: With dead ends: 69 [2025-01-09 17:22:22,543 INFO L226 Difference]: Without dead ends: 67 [2025-01-09 17:22:22,543 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-01-09 17:22:22,543 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-01-09 17:22:22,544 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-01-09 17:22:22,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-01-09 17:22:22,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2025-01-09 17:22:22,549 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-01-09 17:22:22,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 77 transitions. [2025-01-09 17:22:22,550 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 77 transitions. Word has length 48 [2025-01-09 17:22:22,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:22:22,550 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 77 transitions. [2025-01-09 17:22:22,550 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-01-09 17:22:22,551 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 77 transitions. [2025-01-09 17:22:22,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-09 17:22:22,551 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:22:22,552 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-01-09 17:22:22,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 17:22:22,552 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:22:22,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:22:22,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1509321987, now seen corresponding path program 1 times [2025-01-09 17:22:22,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:22:22,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181754176] [2025-01-09 17:22:22,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:22:22,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:22:22,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 17:22:22,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 17:22:22,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:22:22,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:22:23,135 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-09 17:22:23,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:22:23,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181754176] [2025-01-09 17:22:23,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181754176] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:22:23,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 17:22:23,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 17:22:23,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482938225] [2025-01-09 17:22:23,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:22:23,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 17:22:23,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:22:23,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 17:22:23,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 17:22:23,137 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-01-09 17:22:23,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:22:23,282 INFO L93 Difference]: Finished difference Result 78 states and 88 transitions. [2025-01-09 17:22:23,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 17:22:23,282 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-01-09 17:22:23,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:22:23,283 INFO L225 Difference]: With dead ends: 78 [2025-01-09 17:22:23,283 INFO L226 Difference]: Without dead ends: 76 [2025-01-09 17:22:23,284 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-01-09 17:22:23,284 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-01-09 17:22:23,284 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-01-09 17:22:23,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-01-09 17:22:23,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2025-01-09 17:22:23,291 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-01-09 17:22:23,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 85 transitions. [2025-01-09 17:22:23,292 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 85 transitions. Word has length 63 [2025-01-09 17:22:23,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:22:23,292 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 85 transitions. [2025-01-09 17:22:23,293 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-01-09 17:22:23,293 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 85 transitions. [2025-01-09 17:22:23,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-09 17:22:23,294 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:22:23,294 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-01-09 17:22:23,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 17:22:23,294 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:22:23,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:22:23,294 INFO L85 PathProgramCache]: Analyzing trace with hash 699975361, now seen corresponding path program 1 times [2025-01-09 17:22:23,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:22:23,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906870613] [2025-01-09 17:22:23,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:22:23,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:22:23,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 17:22:23,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 17:22:23,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:22:23,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:22:23,575 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-09 17:22:23,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:22:23,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906870613] [2025-01-09 17:22:23,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906870613] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:22:23,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 17:22:23,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 17:22:23,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364496824] [2025-01-09 17:22:23,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:22:23,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 17:22:23,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:22:23,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 17:22:23,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 17:22:23,577 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-01-09 17:22:23,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:22:23,700 INFO L93 Difference]: Finished difference Result 102 states and 116 transitions. [2025-01-09 17:22:23,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 17:22:23,701 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-01-09 17:22:23,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:22:23,702 INFO L225 Difference]: With dead ends: 102 [2025-01-09 17:22:23,702 INFO L226 Difference]: Without dead ends: 75 [2025-01-09 17:22:23,702 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 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-01-09 17:22:23,702 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 12 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 17:22:23,703 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 194 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 17:22:23,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-01-09 17:22:23,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2025-01-09 17:22:23,729 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-01-09 17:22:23,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 84 transitions. [2025-01-09 17:22:23,730 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 84 transitions. Word has length 63 [2025-01-09 17:22:23,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:22:23,731 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 84 transitions. [2025-01-09 17:22:23,731 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-01-09 17:22:23,732 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 84 transitions. [2025-01-09 17:22:23,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-09 17:22:23,733 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:22:23,733 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-01-09 17:22:23,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 17:22:23,736 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:22:23,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:22:23,736 INFO L85 PathProgramCache]: Analyzing trace with hash 306948351, now seen corresponding path program 1 times [2025-01-09 17:22:23,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:22:23,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154685151] [2025-01-09 17:22:23,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:22:23,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:22:23,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 17:22:23,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 17:22:23,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:22:23,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:22:23,859 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-09 17:22:23,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:22:23,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154685151] [2025-01-09 17:22:23,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154685151] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:22:23,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 17:22:23,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 17:22:23,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108936875] [2025-01-09 17:22:23,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:22:23,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 17:22:23,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:22:23,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 17:22:23,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 17:22:23,861 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-01-09 17:22:23,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:22:23,889 INFO L93 Difference]: Finished difference Result 103 states and 115 transitions. [2025-01-09 17:22:23,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 17:22:23,889 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-01-09 17:22:23,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:22:23,890 INFO L225 Difference]: With dead ends: 103 [2025-01-09 17:22:23,890 INFO L226 Difference]: Without dead ends: 66 [2025-01-09 17:22:23,891 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-01-09 17:22:23,891 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 3 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 17:22:23,891 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 193 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 17:22:23,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-01-09 17:22:23,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2025-01-09 17:22:23,900 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-01-09 17:22:23,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 72 transitions. [2025-01-09 17:22:23,901 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 72 transitions. Word has length 63 [2025-01-09 17:22:23,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:22:23,901 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 72 transitions. [2025-01-09 17:22:23,901 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-01-09 17:22:23,901 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 72 transitions. [2025-01-09 17:22:23,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-09 17:22:23,902 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:22:23,902 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-01-09 17:22:23,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 17:22:23,902 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:22:23,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:22:23,903 INFO L85 PathProgramCache]: Analyzing trace with hash 424365179, now seen corresponding path program 1 times [2025-01-09 17:22:23,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:22:23,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119200327] [2025-01-09 17:22:23,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:22:23,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:22:23,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 17:22:23,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 17:22:23,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:22:23,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:22:24,894 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 34 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-01-09 17:22:24,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:22:24,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119200327] [2025-01-09 17:22:24,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119200327] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 17:22:24,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1662180327] [2025-01-09 17:22:24,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:22:24,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:22:24,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 17:22:24,897 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 17:22:24,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 17:22:24,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 17:22:25,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 17:22:25,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:22:25,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:22:25,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 93 conjuncts are in the unsatisfiable core [2025-01-09 17:22:25,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 17:22:25,040 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 1 [2025-01-09 17:22:25,049 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 23 treesize of output 13 [2025-01-09 17:22:25,054 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 23 treesize of output 13 [2025-01-09 17:22:25,060 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 13 treesize of output 9 [2025-01-09 17:22:27,043 INFO L349 Elim1Store]: treesize reduction 23, result has 43.9 percent of original size [2025-01-09 17:22:27,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 193 treesize of output 114 [2025-01-09 17:22:27,096 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 15 proven. 11 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-09 17:22:27,096 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 17:22:31,817 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 19 proven. 4 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-01-09 17:22:31,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1662180327] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 17:22:31,817 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 17:22:31,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 16] total 48 [2025-01-09 17:22:31,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214514575] [2025-01-09 17:22:31,817 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 17:22:31,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-01-09 17:22:31,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:22:31,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-01-09 17:22:31,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=2091, Unknown=1, NotChecked=0, Total=2256 [2025-01-09 17:22:31,819 INFO L87 Difference]: Start difference. First operand 66 states and 72 transitions. Second operand has 48 states, 40 states have (on average 2.45) internal successors, (98), 40 states have internal predecessors, (98), 17 states have call successors, (32), 4 states have call predecessors, (32), 9 states have return successors, (30), 15 states have call predecessors, (30), 14 states have call successors, (30) [2025-01-09 17:22:32,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:22:32,847 INFO L93 Difference]: Finished difference Result 77 states and 83 transitions. [2025-01-09 17:22:32,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-01-09 17:22:32,848 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 40 states have (on average 2.45) internal successors, (98), 40 states have internal predecessors, (98), 17 states have call successors, (32), 4 states have call predecessors, (32), 9 states have return successors, (30), 15 states have call predecessors, (30), 14 states have call successors, (30) Word has length 77 [2025-01-09 17:22:32,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:22:32,848 INFO L225 Difference]: With dead ends: 77 [2025-01-09 17:22:32,849 INFO L226 Difference]: Without dead ends: 75 [2025-01-09 17:22:32,850 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 113 SyntacticMatches, 15 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 912 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=282, Invalid=3377, Unknown=1, NotChecked=0, Total=3660 [2025-01-09 17:22:32,850 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 39 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 870 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 911 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 870 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 17:22:32,850 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 574 Invalid, 911 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 870 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 17:22:32,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-01-09 17:22:32,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2025-01-09 17:22:32,859 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-01-09 17:22:32,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2025-01-09 17:22:32,860 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 77 [2025-01-09 17:22:32,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:22:32,860 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2025-01-09 17:22:32,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 40 states have (on average 2.45) internal successors, (98), 40 states have internal predecessors, (98), 17 states have call successors, (32), 4 states have call predecessors, (32), 9 states have return successors, (30), 15 states have call predecessors, (30), 14 states have call successors, (30) [2025-01-09 17:22:32,860 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2025-01-09 17:22:32,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-09 17:22:32,861 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:22:32,861 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-01-09 17:22:32,868 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 17:22:33,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:22:33,065 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:22:33,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:22:33,065 INFO L85 PathProgramCache]: Analyzing trace with hash -384981447, now seen corresponding path program 1 times [2025-01-09 17:22:33,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:22:33,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485208109] [2025-01-09 17:22:33,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:22:33,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:22:33,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 17:22:33,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 17:22:33,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:22:33,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:22:33,394 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2025-01-09 17:22:33,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:22:33,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485208109] [2025-01-09 17:22:33,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485208109] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 17:22:33,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1152432049] [2025-01-09 17:22:33,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:22:33,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:22:33,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 17:22:33,399 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 17:22:33,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 17:22:33,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 17:22:33,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 17:22:33,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:22:33,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:22:33,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 89 conjuncts are in the unsatisfiable core [2025-01-09 17:22:33,539 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 17:22:33,560 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 45 treesize of output 1 [2025-01-09 17:22:33,565 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 1 [2025-01-09 17:22:33,572 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 1 [2025-01-09 17:22:38,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 20 [2025-01-09 17:22:42,455 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base_BEFORE_CALL_16| Int) (|v_ULTIMATE.start_aws_linked_list_prev_#t~mem343#1.offset_BEFORE_CALL_3| Int) (|v_ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset_BEFORE_CALL_16| Int)) (and (<= |v_ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base_BEFORE_CALL_16| (select (select |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base_BEFORE_CALL_16|) (+ |v_ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset_BEFORE_CALL_16| 8))) |v_ULTIMATE.start_aws_linked_list_prev_#t~mem343#1.offset_BEFORE_CALL_3|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base_BEFORE_CALL_16|))) is different from true [2025-01-09 17:22:50,769 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base_BEFORE_CALL_17| Int) (|v_ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset_BEFORE_CALL_17| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base_BEFORE_CALL_17|) (<= |v_ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base_BEFORE_CALL_17| (select (select |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base_BEFORE_CALL_17|) (+ |v_ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset_BEFORE_CALL_17| 8))) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_7|)))) (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base_BEFORE_CALL_16| Int) (|v_ULTIMATE.start_aws_linked_list_prev_#t~mem343#1.offset_BEFORE_CALL_3| Int) (|v_ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset_BEFORE_CALL_16| Int)) (and (<= |v_ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base_BEFORE_CALL_16| (select (select |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base_BEFORE_CALL_16|) (+ |v_ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset_BEFORE_CALL_16| 8))) |v_ULTIMATE.start_aws_linked_list_prev_#t~mem343#1.offset_BEFORE_CALL_3|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base_BEFORE_CALL_16|)))) is different from true [2025-01-09 17:22:50,933 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 17:22:50,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 61 [2025-01-09 17:23:03,449 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 11 proven. 29 refuted. 1 times theorem prover too weak. 8 trivial. 11 not checked. [2025-01-09 17:23:03,449 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 17:23:08,317 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 21 proven. 8 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-01-09 17:23:08,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1152432049] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 17:23:08,318 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 17:23:08,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 25, 20] total 54 [2025-01-09 17:23:08,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50843490] [2025-01-09 17:23:08,318 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 17:23:08,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2025-01-09 17:23:08,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:23:08,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2025-01-09 17:23:08,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=2425, Unknown=5, NotChecked=202, Total=2862 [2025-01-09 17:23:08,321 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand has 54 states, 49 states have (on average 2.2244897959183674) internal successors, (109), 48 states have internal predecessors, (109), 15 states have call successors, (32), 7 states have call predecessors, (32), 13 states have return successors, (30), 14 states have call predecessors, (30), 14 states have call successors, (30) [2025-01-09 17:23:09,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:23:09,641 INFO L93 Difference]: Finished difference Result 86 states and 92 transitions. [2025-01-09 17:23:09,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-09 17:23:09,641 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 49 states have (on average 2.2244897959183674) internal successors, (109), 48 states have internal predecessors, (109), 15 states have call successors, (32), 7 states have call predecessors, (32), 13 states have return successors, (30), 14 states have call predecessors, (30), 14 states have call successors, (30) Word has length 77 [2025-01-09 17:23:09,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:23:09,642 INFO L225 Difference]: With dead ends: 86 [2025-01-09 17:23:09,642 INFO L226 Difference]: Without dead ends: 74 [2025-01-09 17:23:09,643 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 103 SyntacticMatches, 14 SemanticMatches, 69 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1213 ImplicationChecksByTransitivity, 34.7s TimeCoverageRelationStatistics Valid=459, Invalid=4236, Unknown=5, NotChecked=270, Total=4970 [2025-01-09 17:23:09,643 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 104 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 776 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 974 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 776 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 117 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 17:23:09,643 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 420 Invalid, 974 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 776 Invalid, 0 Unknown, 117 Unchecked, 0.6s Time] [2025-01-09 17:23:09,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-01-09 17:23:09,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2025-01-09 17:23:09,652 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-01-09 17:23:09,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 79 transitions. [2025-01-09 17:23:09,653 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 79 transitions. Word has length 77 [2025-01-09 17:23:09,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:23:09,653 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 79 transitions. [2025-01-09 17:23:09,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 49 states have (on average 2.2244897959183674) internal successors, (109), 48 states have internal predecessors, (109), 15 states have call successors, (32), 7 states have call predecessors, (32), 13 states have return successors, (30), 14 states have call predecessors, (30), 14 states have call successors, (30) [2025-01-09 17:23:09,653 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2025-01-09 17:23:09,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-09 17:23:09,654 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:23:09,654 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-01-09 17:23:09,662 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 17:23:09,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-01-09 17:23:09,859 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:23:09,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:23:09,860 INFO L85 PathProgramCache]: Analyzing trace with hash -778008457, now seen corresponding path program 1 times [2025-01-09 17:23:09,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:23:09,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136249197] [2025-01-09 17:23:09,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:23:09,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:23:09,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 17:23:09,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 17:23:09,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:23:09,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:23:10,009 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-01-09 17:23:10,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:23:10,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136249197] [2025-01-09 17:23:10,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136249197] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 17:23:10,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [460081083] [2025-01-09 17:23:10,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:23:10,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:23:10,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 17:23:10,012 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 17:23:10,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 17:23:10,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 17:23:10,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 17:23:10,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:23:10,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:23:10,136 INFO L256 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 56 conjuncts are in the unsatisfiable core [2025-01-09 17:23:10,141 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 17:23:14,267 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_linked_list_prev_~node#1.offset_BEFORE_CALL_37| Int) (|v_ULTIMATE.start_aws_linked_list_prev_~node#1.base_BEFORE_CALL_37| Int)) (not (= (select (select |c_#memory_$Pointer$#3.offset| |v_ULTIMATE.start_aws_linked_list_prev_~node#1.base_BEFORE_CALL_37|) (+ 8 |v_ULTIMATE.start_aws_linked_list_prev_~node#1.offset_BEFORE_CALL_37|)) 0))) (exists ((|v_ULTIMATE.start_aws_linked_list_prev_~node#1.offset_BEFORE_CALL_37| Int) (|v_ULTIMATE.start_aws_linked_list_prev_~node#1.base_BEFORE_CALL_37| Int)) (not (= (select (select |c_#memory_$Pointer$#3.base| |v_ULTIMATE.start_aws_linked_list_prev_~node#1.base_BEFORE_CALL_37|) (+ 8 |v_ULTIMATE.start_aws_linked_list_prev_~node#1.offset_BEFORE_CALL_37|)) 0)))) is different from true [2025-01-09 17:23:14,422 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 17:23:14,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 34 [2025-01-09 17:23:14,433 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 17:23:14,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 28 [2025-01-09 17:23:22,591 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 15 proven. 12 refuted. 5 times theorem prover too weak. 28 trivial. 0 not checked. [2025-01-09 17:23:22,591 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 17:23:27,157 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 15 proven. 14 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-01-09 17:23:27,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [460081083] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 17:23:27,158 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 17:23:27,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 20, 20] total 34 [2025-01-09 17:23:27,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90115564] [2025-01-09 17:23:27,158 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 17:23:27,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-01-09 17:23:27,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:23:27,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-01-09 17:23:27,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=925, Unknown=3, NotChecked=62, Total=1122 [2025-01-09 17:23:27,160 INFO L87 Difference]: Start difference. First operand 74 states and 79 transitions. Second operand has 34 states, 30 states have (on average 2.2333333333333334) internal successors, (67), 29 states have internal predecessors, (67), 9 states have call successors, (19), 4 states have call predecessors, (19), 9 states have return successors, (18), 9 states have call predecessors, (18), 8 states have call successors, (18) [2025-01-09 17:23:31,229 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 17:23:35,240 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 17:23:39,245 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 17:23:43,488 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 17:23:47,496 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]