./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_linked_list_init_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_init_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 c37a0beecaaffccfccd39c8b76dad022f083d470c5665e9f01bdfeab207ad41e --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 17:20:37,921 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 17:20:37,981 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:20:37,987 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 17:20:37,990 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 17:20:38,011 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 17:20:38,012 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 17:20:38,012 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 17:20:38,013 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 17:20:38,013 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 17:20:38,013 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 17:20:38,014 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 17:20:38,014 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 17:20:38,014 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 17:20:38,014 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 17:20:38,014 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 17:20:38,014 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 17:20:38,015 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 17:20:38,015 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 17:20:38,015 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 17:20:38,015 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 17:20:38,015 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 17:20:38,015 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 17:20:38,015 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 17:20:38,015 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 17:20:38,015 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 17:20:38,015 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 17:20:38,015 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 17:20:38,015 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 17:20:38,015 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 17:20:38,016 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 17:20:38,016 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 17:20:38,016 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 17:20:38,016 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 17:20:38,016 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 17:20:38,016 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 17:20:38,016 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 17:20:38,017 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 17:20:38,017 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 17:20:38,017 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 17:20:38,017 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 17:20:38,017 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 17:20:38,017 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 17:20:38,017 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 17:20:38,017 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 17:20:38,017 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 -> c37a0beecaaffccfccd39c8b76dad022f083d470c5665e9f01bdfeab207ad41e [2025-01-09 17:20:38,236 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 17:20:38,246 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 17:20:38,248 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 17:20:38,249 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 17:20:38,250 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 17:20:38,250 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_init_harness.i [2025-01-09 17:20:39,446 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8e431b6a7/a3ab35d236c4448f95473a777156c892/FLAGf5591a77f [2025-01-09 17:20:39,841 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 17:20:39,841 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_init_harness.i [2025-01-09 17:20:39,869 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8e431b6a7/a3ab35d236c4448f95473a777156c892/FLAGf5591a77f [2025-01-09 17:20:40,020 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8e431b6a7/a3ab35d236c4448f95473a777156c892 [2025-01-09 17:20:40,023 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 17:20:40,024 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 17:20:40,026 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 17:20:40,026 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 17:20:40,029 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 17:20:40,029 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:20:40" (1/1) ... [2025-01-09 17:20:40,030 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52cd458f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:20:40, skipping insertion in model container [2025-01-09 17:20:40,030 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:20:40" (1/1) ... [2025-01-09 17:20:40,092 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 17:20:40,273 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_init_harness.i[4494,4507] [2025-01-09 17:20:40,280 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_init_harness.i[4554,4567] [2025-01-09 17:20:40,749 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:40,751 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:40,752 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:40,753 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:40,754 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:40,762 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:40,762 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:40,763 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:40,763 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:40,765 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:40,765 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:40,766 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:40,766 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:41,062 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_init_harness.i[150277,150290] [2025-01-09 17:20:41,063 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 17:20:41,073 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 17:20:41,081 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_init_harness.i[4494,4507] [2025-01-09 17:20:41,081 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_init_harness.i[4554,4567] [2025-01-09 17:20:41,119 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:41,120 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:41,120 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:41,120 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:41,121 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:41,126 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:41,126 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:41,127 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:41,127 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:41,128 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:41,128 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:41,129 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:41,129 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:41,199 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_init_harness.i[150277,150290] [2025-01-09 17:20:41,199 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 17:20:41,316 INFO L204 MainTranslator]: Completed translation [2025-01-09 17:20:41,317 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:20:41 WrapperNode [2025-01-09 17:20:41,317 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 17:20:41,318 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 17:20:41,318 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 17:20:41,318 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 17:20:41,322 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:20:41" (1/1) ... [2025-01-09 17:20:41,379 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:20:41" (1/1) ... [2025-01-09 17:20:41,411 INFO L138 Inliner]: procedures = 668, calls = 1034, calls flagged for inlining = 51, calls inlined = 4, statements flattened = 89 [2025-01-09 17:20:41,411 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 17:20:41,413 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 17:20:41,413 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 17:20:41,413 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 17:20:41,420 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:20:41" (1/1) ... [2025-01-09 17:20:41,420 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:20:41" (1/1) ... [2025-01-09 17:20:41,424 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:20:41" (1/1) ... [2025-01-09 17:20:41,440 INFO L175 MemorySlicer]: Split 20 memory accesses to 3 slices as follows [2, 13, 5]. 65 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 0, 5]. The 4 writes are split as follows [0, 4, 0]. [2025-01-09 17:20:41,440 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:20:41" (1/1) ... [2025-01-09 17:20:41,440 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:20:41" (1/1) ... [2025-01-09 17:20:41,455 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:20:41" (1/1) ... [2025-01-09 17:20:41,455 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:20:41" (1/1) ... [2025-01-09 17:20:41,461 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:20:41" (1/1) ... [2025-01-09 17:20:41,467 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:20:41" (1/1) ... [2025-01-09 17:20:41,468 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:20:41" (1/1) ... [2025-01-09 17:20:41,471 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 17:20:41,471 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 17:20:41,471 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 17:20:41,471 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 17:20:41,476 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:20:41" (1/1) ... [2025-01-09 17:20:41,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 17:20:41,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 17:20:41,505 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:20:41,508 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:20:41,528 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_init [2025-01-09 17:20:41,528 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_init [2025-01-09 17:20:41,528 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 17:20:41,528 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-01-09 17:20:41,528 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-01-09 17:20:41,528 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2025-01-09 17:20:41,528 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2025-01-09 17:20:41,528 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2025-01-09 17:20:41,528 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2025-01-09 17:20:41,528 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 17:20:41,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 17:20:41,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 17:20:41,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-09 17:20:41,528 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 17:20:41,528 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 17:20:41,528 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_empty [2025-01-09 17:20:41,528 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_empty [2025-01-09 17:20:41,528 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 17:20:41,528 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 17:20:41,528 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 17:20:41,528 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 17:20:41,529 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 17:20:41,529 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-09 17:20:41,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-01-09 17:20:41,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-01-09 17:20:41,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-01-09 17:20:41,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 17:20:41,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 17:20:41,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 17:20:41,670 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 17:20:41,672 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 17:20:41,805 INFO L? ?]: Removed 41 outVars from TransFormulas that were not future-live. [2025-01-09 17:20:41,805 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 17:20:41,813 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 17:20:41,813 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 17:20:41,814 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:20:41 BoogieIcfgContainer [2025-01-09 17:20:41,814 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 17:20:41,815 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 17:20:41,815 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 17:20:41,819 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 17:20:41,819 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 05:20:40" (1/3) ... [2025-01-09 17:20:41,820 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2315fa5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:20:41, skipping insertion in model container [2025-01-09 17:20:41,820 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:20:41" (2/3) ... [2025-01-09 17:20:41,820 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2315fa5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:20:41, skipping insertion in model container [2025-01-09 17:20:41,820 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:20:41" (3/3) ... [2025-01-09 17:20:41,821 INFO L128 eAbstractionObserver]: Analyzing ICFG aws_linked_list_init_harness.i [2025-01-09 17:20:41,831 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 17:20:41,835 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG aws_linked_list_init_harness.i that has 7 procedures, 61 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 17:20:41,873 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 17:20:41,881 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;@6c9059e0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 17:20:41,881 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 17:20:41,883 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 44 states have internal predecessors, (57), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-09 17:20:41,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-09 17:20:41,888 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:20:41,888 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 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:20:41,888 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:20:41,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:20:41,892 INFO L85 PathProgramCache]: Analyzing trace with hash -424318463, now seen corresponding path program 1 times [2025-01-09 17:20:41,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:20:41,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560508324] [2025-01-09 17:20:41,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:20:41,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:20:41,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 17:20:42,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 17:20:42,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:20:42,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:20:42,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 17:20:42,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:20:42,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560508324] [2025-01-09 17:20:42,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560508324] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:20:42,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 17:20:42,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 17:20:42,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636681283] [2025-01-09 17:20:42,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:20:42,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 17:20:42,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:20:42,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 17:20:42,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 17:20:42,102 INFO L87 Difference]: Start difference. First operand has 61 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 44 states have internal predecessors, (57), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 17:20:42,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:20:42,115 INFO L93 Difference]: Finished difference Result 117 states and 154 transitions. [2025-01-09 17:20:42,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 17:20:42,116 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2025-01-09 17:20:42,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:20:42,120 INFO L225 Difference]: With dead ends: 117 [2025-01-09 17:20:42,120 INFO L226 Difference]: Without dead ends: 56 [2025-01-09 17:20:42,122 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:20:42,125 INFO L435 NwaCegarLoop]: 75 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, 75 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:20:42,127 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 17:20:42,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-01-09 17:20:42,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-01-09 17:20:42,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 40 states have internal predecessors, (51), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 17:20:42,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 70 transitions. [2025-01-09 17:20:42,153 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 70 transitions. Word has length 26 [2025-01-09 17:20:42,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:20:42,153 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 70 transitions. [2025-01-09 17:20:42,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 17:20:42,156 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 70 transitions. [2025-01-09 17:20:42,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-09 17:20:42,157 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:20:42,157 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 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:20:42,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 17:20:42,158 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:20:42,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:20:42,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1241966913, now seen corresponding path program 1 times [2025-01-09 17:20:42,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:20:42,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132346557] [2025-01-09 17:20:42,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:20:42,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:20:42,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 17:20:42,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 17:20:42,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:20:42,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:20:43,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 17:20:43,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:20:43,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132346557] [2025-01-09 17:20:43,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132346557] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:20:43,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 17:20:43,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 17:20:43,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475143207] [2025-01-09 17:20:43,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:20:43,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 17:20:43,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:20:43,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 17:20:43,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-09 17:20:43,102 INFO L87 Difference]: Start difference. First operand 56 states and 70 transitions. Second operand has 9 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 17:20:43,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:20:43,306 INFO L93 Difference]: Finished difference Result 110 states and 139 transitions. [2025-01-09 17:20:43,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 17:20:43,306 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2025-01-09 17:20:43,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:20:43,308 INFO L225 Difference]: With dead ends: 110 [2025-01-09 17:20:43,308 INFO L226 Difference]: Without dead ends: 61 [2025-01-09 17:20:43,309 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2025-01-09 17:20:43,309 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 17 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 17:20:43,310 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 357 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 17:20:43,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-01-09 17:20:43,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2025-01-09 17:20:43,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 43 states have internal predecessors, (54), 10 states have call successors, (10), 6 states have call predecessors, (10), 7 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2025-01-09 17:20:43,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 74 transitions. [2025-01-09 17:20:43,320 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 74 transitions. Word has length 26 [2025-01-09 17:20:43,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:20:43,321 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 74 transitions. [2025-01-09 17:20:43,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 17:20:43,321 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 74 transitions. [2025-01-09 17:20:43,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-09 17:20:43,322 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:20:43,322 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 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:20:43,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 17:20:43,322 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:20:43,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:20:43,323 INFO L85 PathProgramCache]: Analyzing trace with hash -2051313539, now seen corresponding path program 1 times [2025-01-09 17:20:43,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:20:43,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292202582] [2025-01-09 17:20:43,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:20:43,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:20:43,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 17:20:43,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 17:20:43,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:20:43,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:20:43,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 17:20:43,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:20:43,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292202582] [2025-01-09 17:20:43,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292202582] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:20:43,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 17:20:43,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 17:20:43,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289181093] [2025-01-09 17:20:43,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:20:43,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 17:20:43,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:20:43,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 17:20:43,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-01-09 17:20:43,913 INFO L87 Difference]: Start difference. First operand 59 states and 74 transitions. Second operand has 10 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 17:20:44,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:20:44,181 INFO L93 Difference]: Finished difference Result 127 states and 165 transitions. [2025-01-09 17:20:44,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 17:20:44,182 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2025-01-09 17:20:44,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:20:44,183 INFO L225 Difference]: With dead ends: 127 [2025-01-09 17:20:44,183 INFO L226 Difference]: Without dead ends: 75 [2025-01-09 17:20:44,183 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2025-01-09 17:20:44,184 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 35 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 17:20:44,184 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 515 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 17:20:44,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-01-09 17:20:44,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 69. [2025-01-09 17:20:44,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 50 states have (on average 1.38) internal successors, (69), 52 states have internal predecessors, (69), 11 states have call successors, (11), 6 states have call predecessors, (11), 7 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2025-01-09 17:20:44,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 91 transitions. [2025-01-09 17:20:44,198 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 91 transitions. Word has length 26 [2025-01-09 17:20:44,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:20:44,199 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 91 transitions. [2025-01-09 17:20:44,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 17:20:44,199 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 91 transitions. [2025-01-09 17:20:44,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-09 17:20:44,200 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:20:44,200 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 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:20:44,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 17:20:44,201 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:20:44,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:20:44,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1850626747, now seen corresponding path program 1 times [2025-01-09 17:20:44,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:20:44,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559647256] [2025-01-09 17:20:44,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:20:44,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:20:44,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 17:20:44,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 17:20:44,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:20:44,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:20:44,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 17:20:44,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:20:44,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559647256] [2025-01-09 17:20:44,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559647256] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:20:44,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 17:20:44,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 17:20:44,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011591516] [2025-01-09 17:20:44,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:20:44,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 17:20:44,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:20:44,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 17:20:44,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-01-09 17:20:44,661 INFO L87 Difference]: Start difference. First operand 69 states and 91 transitions. Second operand has 10 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 17:20:44,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:20:44,856 INFO L93 Difference]: Finished difference Result 154 states and 208 transitions. [2025-01-09 17:20:44,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 17:20:44,857 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2025-01-09 17:20:44,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:20:44,858 INFO L225 Difference]: With dead ends: 154 [2025-01-09 17:20:44,858 INFO L226 Difference]: Without dead ends: 92 [2025-01-09 17:20:44,858 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2025-01-09 17:20:44,859 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 48 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 17:20:44,859 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 422 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 17:20:44,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-01-09 17:20:44,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 73. [2025-01-09 17:20:44,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 54 states have (on average 1.3888888888888888) internal successors, (75), 56 states have internal predecessors, (75), 11 states have call successors, (11), 6 states have call predecessors, (11), 7 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2025-01-09 17:20:44,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 97 transitions. [2025-01-09 17:20:44,875 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 97 transitions. Word has length 26 [2025-01-09 17:20:44,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:20:44,876 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 97 transitions. [2025-01-09 17:20:44,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 17:20:44,876 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 97 transitions. [2025-01-09 17:20:44,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-09 17:20:44,877 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:20:44,877 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 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:20:44,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 17:20:44,877 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:20:44,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:20:44,879 INFO L85 PathProgramCache]: Analyzing trace with hash 2108792185, now seen corresponding path program 1 times [2025-01-09 17:20:44,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:20:44,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977993709] [2025-01-09 17:20:44,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:20:44,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:20:44,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 17:20:44,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 17:20:44,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:20:44,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:20:45,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 17:20:45,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:20:45,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977993709] [2025-01-09 17:20:45,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977993709] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:20:45,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 17:20:45,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 17:20:45,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930583561] [2025-01-09 17:20:45,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:20:45,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 17:20:45,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:20:45,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 17:20:45,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-01-09 17:20:45,071 INFO L87 Difference]: Start difference. First operand 73 states and 97 transitions. Second operand has 10 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 17:20:45,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:20:45,250 INFO L93 Difference]: Finished difference Result 176 states and 242 transitions. [2025-01-09 17:20:45,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 17:20:45,251 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2025-01-09 17:20:45,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:20:45,252 INFO L225 Difference]: With dead ends: 176 [2025-01-09 17:20:45,252 INFO L226 Difference]: Without dead ends: 110 [2025-01-09 17:20:45,252 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2025-01-09 17:20:45,253 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 41 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 17:20:45,253 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 535 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 17:20:45,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-01-09 17:20:45,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 77. [2025-01-09 17:20:45,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 58 states have (on average 1.396551724137931) internal successors, (81), 60 states have internal predecessors, (81), 11 states have call successors, (11), 6 states have call predecessors, (11), 7 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2025-01-09 17:20:45,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 103 transitions. [2025-01-09 17:20:45,268 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 103 transitions. Word has length 26 [2025-01-09 17:20:45,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:20:45,268 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 103 transitions. [2025-01-09 17:20:45,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 17:20:45,268 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 103 transitions. [2025-01-09 17:20:45,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-09 17:20:45,269 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:20:45,269 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 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:20:45,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 17:20:45,269 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:20:45,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:20:45,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1097674935, now seen corresponding path program 1 times [2025-01-09 17:20:45,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:20:45,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737046657] [2025-01-09 17:20:45,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:20:45,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:20:45,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 17:20:45,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 17:20:45,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:20:45,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:20:45,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 17:20:45,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:20:45,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737046657] [2025-01-09 17:20:45,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737046657] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:20:45,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 17:20:45,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 17:20:45,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519123484] [2025-01-09 17:20:45,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:20:45,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 17:20:45,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:20:45,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 17:20:45,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 17:20:45,348 INFO L87 Difference]: Start difference. First operand 77 states and 103 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 17:20:45,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:20:45,399 INFO L93 Difference]: Finished difference Result 173 states and 239 transitions. [2025-01-09 17:20:45,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 17:20:45,400 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2025-01-09 17:20:45,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:20:45,401 INFO L225 Difference]: With dead ends: 173 [2025-01-09 17:20:45,401 INFO L226 Difference]: Without dead ends: 70 [2025-01-09 17:20:45,402 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 17:20:45,405 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 36 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 17:20:45,405 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 397 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 17:20:45,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-01-09 17:20:45,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2025-01-09 17:20:45,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 51 states have (on average 1.3529411764705883) internal successors, (69), 53 states have internal predecessors, (69), 11 states have call successors, (11), 6 states have call predecessors, (11), 7 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2025-01-09 17:20:45,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 91 transitions. [2025-01-09 17:20:45,413 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 91 transitions. Word has length 26 [2025-01-09 17:20:45,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:20:45,413 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 91 transitions. [2025-01-09 17:20:45,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 17:20:45,413 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 91 transitions. [2025-01-09 17:20:45,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-01-09 17:20:45,414 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:20:45,414 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 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:20:45,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 17:20:45,415 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:20:45,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:20:45,416 INFO L85 PathProgramCache]: Analyzing trace with hash 936375003, now seen corresponding path program 1 times [2025-01-09 17:20:45,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:20:45,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827866349] [2025-01-09 17:20:45,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:20:45,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:20:45,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 17:20:45,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 17:20:45,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:20:45,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:20:45,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 17:20:45,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:20:45,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827866349] [2025-01-09 17:20:45,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827866349] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:20:45,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 17:20:45,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 17:20:45,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043416871] [2025-01-09 17:20:45,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:20:45,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 17:20:45,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:20:45,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 17:20:45,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 17:20:45,511 INFO L87 Difference]: Start difference. First operand 70 states and 91 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 17:20:45,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:20:45,597 INFO L93 Difference]: Finished difference Result 145 states and 186 transitions. [2025-01-09 17:20:45,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 17:20:45,597 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2025-01-09 17:20:45,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:20:45,598 INFO L225 Difference]: With dead ends: 145 [2025-01-09 17:20:45,598 INFO L226 Difference]: Without dead ends: 76 [2025-01-09 17:20:45,599 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-09 17:20:45,600 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 20 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 17:20:45,600 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 360 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 17:20:45,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-01-09 17:20:45,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 70. [2025-01-09 17:20:45,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 51 states have (on average 1.3137254901960784) internal successors, (67), 53 states have internal predecessors, (67), 11 states have call successors, (11), 6 states have call predecessors, (11), 7 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2025-01-09 17:20:45,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 89 transitions. [2025-01-09 17:20:45,609 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 89 transitions. Word has length 28 [2025-01-09 17:20:45,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:20:45,610 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 89 transitions. [2025-01-09 17:20:45,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 17:20:45,610 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 89 transitions. [2025-01-09 17:20:45,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-01-09 17:20:45,613 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:20:45,613 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 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:20:45,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 17:20:45,613 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:20:45,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:20:45,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1603387799, now seen corresponding path program 1 times [2025-01-09 17:20:45,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:20:45,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032780402] [2025-01-09 17:20:45,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:20:45,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:20:45,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-09 17:20:45,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 17:20:45,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:20:45,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:20:45,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 17:20:45,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:20:45,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032780402] [2025-01-09 17:20:45,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032780402] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:20:45,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 17:20:45,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 17:20:45,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603087249] [2025-01-09 17:20:45,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:20:45,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 17:20:45,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:20:45,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 17:20:45,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 17:20:45,718 INFO L87 Difference]: Start difference. First operand 70 states and 89 transitions. Second operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 17:20:45,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:20:45,830 INFO L93 Difference]: Finished difference Result 157 states and 202 transitions. [2025-01-09 17:20:45,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 17:20:45,830 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2025-01-09 17:20:45,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:20:45,831 INFO L225 Difference]: With dead ends: 157 [2025-01-09 17:20:45,831 INFO L226 Difference]: Without dead ends: 86 [2025-01-09 17:20:45,832 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-01-09 17:20:45,832 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 29 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 17:20:45,832 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 394 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 17:20:45,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-01-09 17:20:45,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 72. [2025-01-09 17:20:45,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 53 states have (on average 1.3018867924528301) internal successors, (69), 55 states have internal predecessors, (69), 11 states have call successors, (11), 6 states have call predecessors, (11), 7 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2025-01-09 17:20:45,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 91 transitions. [2025-01-09 17:20:45,838 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 91 transitions. Word has length 30 [2025-01-09 17:20:45,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:20:45,838 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 91 transitions. [2025-01-09 17:20:45,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 17:20:45,839 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 91 transitions. [2025-01-09 17:20:45,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-01-09 17:20:45,839 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:20:45,839 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 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:20:45,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 17:20:45,839 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:20:45,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:20:45,840 INFO L85 PathProgramCache]: Analyzing trace with hash -258619564, now seen corresponding path program 1 times [2025-01-09 17:20:45,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:20:45,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073168166] [2025-01-09 17:20:45,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:20:45,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:20:45,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-09 17:20:45,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 17:20:45,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:20:45,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:20:45,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 17:20:45,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:20:45,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073168166] [2025-01-09 17:20:45,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073168166] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:20:45,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 17:20:45,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 17:20:45,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956453397] [2025-01-09 17:20:45,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:20:45,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 17:20:45,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:20:45,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 17:20:45,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 17:20:45,974 INFO L87 Difference]: Start difference. First operand 72 states and 91 transitions. Second operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 17:20:46,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:20:46,085 INFO L93 Difference]: Finished difference Result 159 states and 202 transitions. [2025-01-09 17:20:46,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 17:20:46,086 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2025-01-09 17:20:46,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:20:46,087 INFO L225 Difference]: With dead ends: 159 [2025-01-09 17:20:46,087 INFO L226 Difference]: Without dead ends: 86 [2025-01-09 17:20:46,087 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-01-09 17:20:46,087 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 26 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 17:20:46,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 403 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 17:20:46,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-01-09 17:20:46,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 74. [2025-01-09 17:20:46,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 55 states have (on average 1.290909090909091) internal successors, (71), 57 states have internal predecessors, (71), 11 states have call successors, (11), 6 states have call predecessors, (11), 7 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2025-01-09 17:20:46,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 93 transitions. [2025-01-09 17:20:46,095 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 93 transitions. Word has length 31 [2025-01-09 17:20:46,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:20:46,095 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 93 transitions. [2025-01-09 17:20:46,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 17:20:46,095 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 93 transitions. [2025-01-09 17:20:46,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-01-09 17:20:46,096 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:20:46,096 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:46,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 17:20:46,096 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:20:46,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:20:46,097 INFO L85 PathProgramCache]: Analyzing trace with hash 633938102, now seen corresponding path program 1 times [2025-01-09 17:20:46,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:20:46,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103720041] [2025-01-09 17:20:46,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:20:46,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:20:46,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-09 17:20:46,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-09 17:20:46,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:20:46,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:20:46,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 17:20:46,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:20:46,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103720041] [2025-01-09 17:20:46,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103720041] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:20:46,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 17:20:46,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 17:20:46,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55780494] [2025-01-09 17:20:46,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:20:46,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 17:20:46,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:20:46,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 17:20:46,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2025-01-09 17:20:46,754 INFO L87 Difference]: Start difference. First operand 74 states and 93 transitions. Second operand has 14 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 17:20:47,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:20:47,049 INFO L93 Difference]: Finished difference Result 164 states and 210 transitions. [2025-01-09 17:20:47,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 17:20:47,050 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 39 [2025-01-09 17:20:47,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:20:47,051 INFO L225 Difference]: With dead ends: 164 [2025-01-09 17:20:47,052 INFO L226 Difference]: Without dead ends: 97 [2025-01-09 17:20:47,053 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2025-01-09 17:20:47,053 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 32 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 17:20:47,053 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 568 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 17:20:47,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-01-09 17:20:47,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 79. [2025-01-09 17:20:47,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 58 states have (on average 1.293103448275862) internal successors, (75), 61 states have internal predecessors, (75), 12 states have call successors, (12), 6 states have call predecessors, (12), 8 states have return successors, (15), 11 states have call predecessors, (15), 11 states have call successors, (15) [2025-01-09 17:20:47,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 102 transitions. [2025-01-09 17:20:47,068 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 102 transitions. Word has length 39 [2025-01-09 17:20:47,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:20:47,068 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 102 transitions. [2025-01-09 17:20:47,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 17:20:47,068 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 102 transitions. [2025-01-09 17:20:47,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-01-09 17:20:47,070 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:20:47,070 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:47,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 17:20:47,071 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:20:47,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:20:47,071 INFO L85 PathProgramCache]: Analyzing trace with hash 892103540, now seen corresponding path program 1 times [2025-01-09 17:20:47,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:20:47,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431288130] [2025-01-09 17:20:47,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:20:47,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:20:47,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-09 17:20:47,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-09 17:20:47,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:20:47,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:20:47,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 17:20:47,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:20:47,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431288130] [2025-01-09 17:20:47,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431288130] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:20:47,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 17:20:47,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 17:20:47,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794817423] [2025-01-09 17:20:47,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:20:47,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 17:20:47,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:20:47,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 17:20:47,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2025-01-09 17:20:47,364 INFO L87 Difference]: Start difference. First operand 79 states and 102 transitions. Second operand has 14 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 13 states have internal predecessors, (31), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 17:20:47,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:20:47,656 INFO L93 Difference]: Finished difference Result 191 states and 258 transitions. [2025-01-09 17:20:47,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 17:20:47,657 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 13 states have internal predecessors, (31), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 39 [2025-01-09 17:20:47,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:20:47,658 INFO L225 Difference]: With dead ends: 191 [2025-01-09 17:20:47,658 INFO L226 Difference]: Without dead ends: 119 [2025-01-09 17:20:47,658 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=394, Unknown=0, NotChecked=0, Total=462 [2025-01-09 17:20:47,659 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 49 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 17:20:47,659 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 571 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 17:20:47,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-01-09 17:20:47,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 84. [2025-01-09 17:20:47,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 62 states have (on average 1.2903225806451613) internal successors, (80), 66 states have internal predecessors, (80), 12 states have call successors, (12), 6 states have call predecessors, (12), 9 states have return successors, (18), 11 states have call predecessors, (18), 11 states have call successors, (18) [2025-01-09 17:20:47,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 110 transitions. [2025-01-09 17:20:47,667 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 110 transitions. Word has length 39 [2025-01-09 17:20:47,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:20:47,667 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 110 transitions. [2025-01-09 17:20:47,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 13 states have internal predecessors, (31), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 17:20:47,667 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 110 transitions. [2025-01-09 17:20:47,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-01-09 17:20:47,668 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:20:47,668 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:47,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 17:20:47,668 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:20:47,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:20:47,668 INFO L85 PathProgramCache]: Analyzing trace with hash -119013710, now seen corresponding path program 1 times [2025-01-09 17:20:47,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:20:47,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37566930] [2025-01-09 17:20:47,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:20:47,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:20:47,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-09 17:20:47,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-09 17:20:47,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:20:47,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:20:47,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 17:20:47,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:20:47,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37566930] [2025-01-09 17:20:47,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37566930] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:20:47,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 17:20:47,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 17:20:47,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528862688] [2025-01-09 17:20:47,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:20:47,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 17:20:47,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:20:47,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 17:20:47,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-01-09 17:20:47,799 INFO L87 Difference]: Start difference. First operand 84 states and 110 transitions. Second operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 4 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 17:20:47,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:20:47,960 INFO L93 Difference]: Finished difference Result 198 states and 273 transitions. [2025-01-09 17:20:47,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 17:20:47,961 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 4 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 39 [2025-01-09 17:20:47,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:20:47,961 INFO L225 Difference]: With dead ends: 198 [2025-01-09 17:20:47,962 INFO L226 Difference]: Without dead ends: 96 [2025-01-09 17:20:47,962 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2025-01-09 17:20:47,962 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 36 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 17:20:47,963 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 568 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 17:20:47,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-01-09 17:20:47,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 85. [2025-01-09 17:20:47,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 62 states have (on average 1.2903225806451613) internal successors, (80), 67 states have internal predecessors, (80), 13 states have call successors, (13), 6 states have call predecessors, (13), 9 states have return successors, (19), 11 states have call predecessors, (19), 12 states have call successors, (19) [2025-01-09 17:20:47,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 112 transitions. [2025-01-09 17:20:47,973 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 112 transitions. Word has length 39 [2025-01-09 17:20:47,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:20:47,973 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 112 transitions. [2025-01-09 17:20:47,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 4 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 17:20:47,973 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 112 transitions. [2025-01-09 17:20:47,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-01-09 17:20:47,974 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:20:47,974 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:47,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 17:20:47,974 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:20:47,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:20:47,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1275665230, now seen corresponding path program 1 times [2025-01-09 17:20:47,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:20:47,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447223672] [2025-01-09 17:20:47,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:20:47,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:20:47,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-09 17:20:47,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-09 17:20:47,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:20:47,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:20:48,225 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 17:20:48,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:20:48,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447223672] [2025-01-09 17:20:48,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447223672] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 17:20:48,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1877438441] [2025-01-09 17:20:48,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:20:48,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:20:48,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 17:20:48,227 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:20:48,232 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:20:48,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-09 17:20:48,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-09 17:20:48,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:20:48,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:20:48,355 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-01-09 17:20:48,359 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 17:20:48,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 29 [2025-01-09 17:20:48,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 7 [2025-01-09 17:20:49,256 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 17:20:49,256 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 17:20:49,563 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 17:20:49,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1877438441] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 17:20:49,564 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 17:20:49,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14, 12] total 33 [2025-01-09 17:20:49,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636063763] [2025-01-09 17:20:49,564 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 17:20:49,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-01-09 17:20:49,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:20:49,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-01-09 17:20:49,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=945, Unknown=0, NotChecked=0, Total=1056 [2025-01-09 17:20:49,566 INFO L87 Difference]: Start difference. First operand 85 states and 112 transitions. Second operand has 33 states, 27 states have (on average 3.0) internal successors, (81), 30 states have internal predecessors, (81), 13 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 17:20:50,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:20:50,306 INFO L93 Difference]: Finished difference Result 196 states and 264 transitions. [2025-01-09 17:20:50,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 17:20:50,306 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 27 states have (on average 3.0) internal successors, (81), 30 states have internal predecessors, (81), 13 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) Word has length 41 [2025-01-09 17:20:50,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:20:50,308 INFO L225 Difference]: With dead ends: 196 [2025-01-09 17:20:50,308 INFO L226 Difference]: Without dead ends: 118 [2025-01-09 17:20:50,309 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=249, Invalid=1821, Unknown=0, NotChecked=0, Total=2070 [2025-01-09 17:20:50,309 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 167 mSDsluCounter, 757 mSDsCounter, 0 mSdLazyCounter, 636 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 810 SdHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 17:20:50,309 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 810 Invalid, 712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 636 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 17:20:50,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-01-09 17:20:50,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 90. [2025-01-09 17:20:50,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 66 states have (on average 1.2878787878787878) internal successors, (85), 71 states have internal predecessors, (85), 13 states have call successors, (13), 7 states have call predecessors, (13), 10 states have return successors, (19), 11 states have call predecessors, (19), 12 states have call successors, (19) [2025-01-09 17:20:50,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 117 transitions. [2025-01-09 17:20:50,317 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 117 transitions. Word has length 41 [2025-01-09 17:20:50,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:20:50,318 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 117 transitions. [2025-01-09 17:20:50,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 27 states have (on average 3.0) internal successors, (81), 30 states have internal predecessors, (81), 13 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 17:20:50,318 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 117 transitions. [2025-01-09 17:20:50,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-01-09 17:20:50,318 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:20:50,318 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 17:20:50,325 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 17:20:50,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-01-09 17:20:50,522 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:20:50,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:20:50,523 INFO L85 PathProgramCache]: Analyzing trace with hash 685049753, now seen corresponding path program 1 times [2025-01-09 17:20:50,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:20:50,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747308228] [2025-01-09 17:20:50,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:20:50,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:20:50,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-09 17:20:50,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 17:20:50,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:20:50,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:20:50,697 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 17:20:50,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:20:50,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747308228] [2025-01-09 17:20:50,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747308228] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:20:50,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 17:20:50,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 17:20:50,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158182925] [2025-01-09 17:20:50,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:20:50,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 17:20:50,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:20:50,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 17:20:50,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 17:20:50,698 INFO L87 Difference]: Start difference. First operand 90 states and 117 transitions. Second operand has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 17:20:50,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:20:50,747 INFO L93 Difference]: Finished difference Result 106 states and 134 transitions. [2025-01-09 17:20:50,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 17:20:50,748 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 42 [2025-01-09 17:20:50,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:20:50,749 INFO L225 Difference]: With dead ends: 106 [2025-01-09 17:20:50,749 INFO L226 Difference]: Without dead ends: 104 [2025-01-09 17:20:50,750 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-09 17:20:50,750 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 3 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 17:20:50,750 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 454 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 17:20:50,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-01-09 17:20:50,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 99. [2025-01-09 17:20:50,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 72 states have (on average 1.2638888888888888) internal successors, (91), 78 states have internal predecessors, (91), 14 states have call successors, (14), 8 states have call predecessors, (14), 12 states have return successors, (22), 12 states have call predecessors, (22), 13 states have call successors, (22) [2025-01-09 17:20:50,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 127 transitions. [2025-01-09 17:20:50,762 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 127 transitions. Word has length 42 [2025-01-09 17:20:50,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:20:50,762 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 127 transitions. [2025-01-09 17:20:50,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 17:20:50,762 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 127 transitions. [2025-01-09 17:20:50,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-01-09 17:20:50,763 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:20:50,763 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 17:20:50,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 17:20:50,763 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:20:50,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:20:50,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1053144069, now seen corresponding path program 1 times [2025-01-09 17:20:50,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:20:50,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392512568] [2025-01-09 17:20:50,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:20:50,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:20:50,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-09 17:20:50,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-09 17:20:50,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:20:50,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:20:51,157 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 17:20:51,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:20:51,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392512568] [2025-01-09 17:20:51,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392512568] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 17:20:51,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1065080347] [2025-01-09 17:20:51,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:20:51,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:20:51,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 17:20:51,160 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:20:51,162 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:20:51,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-09 17:20:51,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-09 17:20:51,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:20:51,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:20:51,275 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-01-09 17:20:51,277 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 17:20:51,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 29 [2025-01-09 17:20:51,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 7 [2025-01-09 17:20:52,109 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-09 17:20:52,109 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 17:20:52,497 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-09 17:20:52,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1065080347] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 17:20:52,498 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 17:20:52,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 8] total 28 [2025-01-09 17:20:52,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221129873] [2025-01-09 17:20:52,498 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 17:20:52,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-01-09 17:20:52,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:20:52,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-01-09 17:20:52,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=670, Unknown=0, NotChecked=0, Total=756 [2025-01-09 17:20:52,500 INFO L87 Difference]: Start difference. First operand 99 states and 127 transitions. Second operand has 28 states, 24 states have (on average 3.5833333333333335) internal successors, (86), 27 states have internal predecessors, (86), 13 states have call successors, (14), 4 states have call predecessors, (14), 6 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 17:20:53,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:20:53,502 INFO L93 Difference]: Finished difference Result 240 states and 327 transitions. [2025-01-09 17:20:53,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-01-09 17:20:53,502 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 24 states have (on average 3.5833333333333335) internal successors, (86), 27 states have internal predecessors, (86), 13 states have call successors, (14), 4 states have call predecessors, (14), 6 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) Word has length 50 [2025-01-09 17:20:53,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:20:53,506 INFO L225 Difference]: With dead ends: 240 [2025-01-09 17:20:53,506 INFO L226 Difference]: Without dead ends: 152 [2025-01-09 17:20:53,506 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=190, Invalid=1370, Unknown=0, NotChecked=0, Total=1560 [2025-01-09 17:20:53,507 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 94 mSDsluCounter, 865 mSDsCounter, 0 mSdLazyCounter, 920 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 920 SdHoareTripleChecker+Invalid, 955 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 920 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 17:20:53,507 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 920 Invalid, 955 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 920 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 17:20:53,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2025-01-09 17:20:53,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 91. [2025-01-09 17:20:53,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 67 states have (on average 1.2537313432835822) internal successors, (84), 72 states have internal predecessors, (84), 12 states have call successors, (12), 8 states have call predecessors, (12), 11 states have return successors, (16), 10 states have call predecessors, (16), 11 states have call successors, (16) [2025-01-09 17:20:53,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 112 transitions. [2025-01-09 17:20:53,529 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 112 transitions. Word has length 50 [2025-01-09 17:20:53,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:20:53,529 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 112 transitions. [2025-01-09 17:20:53,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 24 states have (on average 3.5833333333333335) internal successors, (86), 27 states have internal predecessors, (86), 13 states have call successors, (14), 4 states have call predecessors, (14), 6 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 17:20:53,529 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 112 transitions. [2025-01-09 17:20:53,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-01-09 17:20:53,529 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:20:53,530 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, 1, 1, 1, 1, 1, 1, 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:20:53,536 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:20:53,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-01-09 17:20:53,734 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:20:53,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:20:53,738 INFO L85 PathProgramCache]: Analyzing trace with hash 56196669, now seen corresponding path program 1 times [2025-01-09 17:20:53,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:20:53,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210713047] [2025-01-09 17:20:53,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:20:53,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:20:53,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-01-09 17:20:53,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-09 17:20:53,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:20:53,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:20:54,225 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 17:20:54,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:20:54,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210713047] [2025-01-09 17:20:54,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210713047] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:20:54,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 17:20:54,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 17:20:54,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981732512] [2025-01-09 17:20:54,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:20:54,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 17:20:54,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:20:54,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 17:20:54,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2025-01-09 17:20:54,227 INFO L87 Difference]: Start difference. First operand 91 states and 112 transitions. Second operand has 12 states, 10 states have (on average 4.0) internal successors, (40), 9 states have internal predecessors, (40), 6 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2025-01-09 17:20:54,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:20:54,363 INFO L93 Difference]: Finished difference Result 99 states and 119 transitions. [2025-01-09 17:20:54,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 17:20:54,364 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 4.0) internal successors, (40), 9 states have internal predecessors, (40), 6 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 58 [2025-01-09 17:20:54,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:20:54,365 INFO L225 Difference]: With dead ends: 99 [2025-01-09 17:20:54,365 INFO L226 Difference]: Without dead ends: 95 [2025-01-09 17:20:54,365 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2025-01-09 17:20:54,365 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 15 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 17:20:54,366 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 566 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 17:20:54,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-01-09 17:20:54,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 93. [2025-01-09 17:20:54,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 69 states have (on average 1.2318840579710144) internal successors, (85), 73 states have internal predecessors, (85), 12 states have call successors, (12), 9 states have call predecessors, (12), 11 states have return successors, (16), 10 states have call predecessors, (16), 11 states have call successors, (16) [2025-01-09 17:20:54,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 113 transitions. [2025-01-09 17:20:54,374 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 113 transitions. Word has length 58 [2025-01-09 17:20:54,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:20:54,375 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 113 transitions. [2025-01-09 17:20:54,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 4.0) internal successors, (40), 9 states have internal predecessors, (40), 6 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2025-01-09 17:20:54,375 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 113 transitions. [2025-01-09 17:20:54,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-01-09 17:20:54,375 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:20:54,376 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 17:20:54,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 17:20:54,376 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:20:54,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:20:54,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1235162659, now seen corresponding path program 1 times [2025-01-09 17:20:54,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:20:54,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230024755] [2025-01-09 17:20:54,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:20:54,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:20:54,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-09 17:20:54,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-09 17:20:54,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:20:54,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:20:54,753 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-09 17:20:54,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:20:54,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230024755] [2025-01-09 17:20:54,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230024755] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:20:54,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 17:20:54,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 17:20:54,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884229802] [2025-01-09 17:20:54,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:20:54,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 17:20:54,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:20:54,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 17:20:54,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-01-09 17:20:54,755 INFO L87 Difference]: Start difference. First operand 93 states and 113 transitions. Second operand has 10 states, 8 states have (on average 6.5) internal successors, (52), 9 states have internal predecessors, (52), 7 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2025-01-09 17:20:54,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:20:54,885 INFO L93 Difference]: Finished difference Result 103 states and 123 transitions. [2025-01-09 17:20:54,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 17:20:54,885 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 6.5) internal successors, (52), 9 states have internal predecessors, (52), 7 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) Word has length 78 [2025-01-09 17:20:54,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:20:54,886 INFO L225 Difference]: With dead ends: 103 [2025-01-09 17:20:54,886 INFO L226 Difference]: Without dead ends: 96 [2025-01-09 17:20:54,886 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-01-09 17:20:54,886 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 12 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 17:20:54,887 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 386 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 17:20:54,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-01-09 17:20:54,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2025-01-09 17:20:54,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 70 states have (on average 1.2142857142857142) internal successors, (85), 74 states have internal predecessors, (85), 12 states have call successors, (12), 9 states have call predecessors, (12), 11 states have return successors, (16), 10 states have call predecessors, (16), 11 states have call successors, (16) [2025-01-09 17:20:54,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 113 transitions. [2025-01-09 17:20:54,897 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 113 transitions. Word has length 78 [2025-01-09 17:20:54,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:20:54,897 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 113 transitions. [2025-01-09 17:20:54,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 6.5) internal successors, (52), 9 states have internal predecessors, (52), 7 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2025-01-09 17:20:54,897 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 113 transitions. [2025-01-09 17:20:54,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-01-09 17:20:54,898 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:20:54,898 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 17:20:54,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 17:20:54,898 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:20:54,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:20:54,899 INFO L85 PathProgramCache]: Analyzing trace with hash -2044509285, now seen corresponding path program 1 times [2025-01-09 17:20:54,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:20:54,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29173127] [2025-01-09 17:20:54,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:20:54,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:20:54,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-09 17:20:54,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-09 17:20:54,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:20:54,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:20:55,591 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-01-09 17:20:55,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:20:55,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29173127] [2025-01-09 17:20:55,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29173127] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 17:20:55,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1363909350] [2025-01-09 17:20:55,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:20:55,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:20:55,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 17:20:55,594 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:20:55,602 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:20:55,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-09 17:20:55,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-09 17:20:55,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:20:55,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:20:55,732 INFO L256 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-01-09 17:20:55,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 17:20:55,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 1 [2025-01-09 17:20:59,800 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_aws_linked_list_init_#in~list.base_BEFORE_CALL_2| Int) (|v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_2| Int)) (<= |v_aws_linked_list_init_#in~list.base_BEFORE_CALL_2| (select (select |c_#memory_$Pointer$#1.base| |v_aws_linked_list_init_#in~list.base_BEFORE_CALL_2|) (+ |v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_2| 24)))) is different from true [2025-01-09 17:21:03,903 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_aws_linked_list_init_#in~list.base_BEFORE_CALL_3| Int) (|v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_3| Int)) (<= |v_aws_linked_list_init_#in~list.base_BEFORE_CALL_3| (select (select |c_#memory_$Pointer$#1.base| |v_aws_linked_list_init_#in~list.base_BEFORE_CALL_3|) (+ |v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_3| 24)))) (exists ((|v_aws_linked_list_init_#in~list.base_BEFORE_CALL_2| Int) (|v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_2| Int)) (<= |v_aws_linked_list_init_#in~list.base_BEFORE_CALL_2| (select (select |c_#memory_$Pointer$#1.base| |v_aws_linked_list_init_#in~list.base_BEFORE_CALL_2|) (+ |v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_2| 24))))) is different from true [2025-01-09 17:21:07,959 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_aws_linked_list_init_#in~list.base_BEFORE_CALL_4| Int) (|v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_4| Int)) (<= |v_aws_linked_list_init_#in~list.base_BEFORE_CALL_4| (select (select |c_#memory_$Pointer$#1.base| |v_aws_linked_list_init_#in~list.base_BEFORE_CALL_4|) (+ |v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_4| 24)))) (exists ((|v_aws_linked_list_init_#in~list.base_BEFORE_CALL_2| Int) (|v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_2| Int)) (<= |v_aws_linked_list_init_#in~list.base_BEFORE_CALL_2| (select (select |c_#memory_$Pointer$#1.base| |v_aws_linked_list_init_#in~list.base_BEFORE_CALL_2|) (+ |v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_2| 24))))) is different from true [2025-01-09 17:21:12,041 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_aws_linked_list_init_#in~list.base_BEFORE_CALL_5| Int) (|v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_5| Int)) (<= |v_aws_linked_list_init_#in~list.base_BEFORE_CALL_5| (select (select |c_#memory_$Pointer$#1.base| |v_aws_linked_list_init_#in~list.base_BEFORE_CALL_5|) (+ |v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_5| 24)))) (exists ((|v_aws_linked_list_init_#in~list.base_BEFORE_CALL_2| Int) (|v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_2| Int)) (<= |v_aws_linked_list_init_#in~list.base_BEFORE_CALL_2| (select (select |c_#memory_$Pointer$#1.base| |v_aws_linked_list_init_#in~list.base_BEFORE_CALL_2|) (+ |v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_2| 24))))) is different from true [2025-01-09 17:21:12,456 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 15 not checked. [2025-01-09 17:21:12,456 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 17:21:12,801 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 3142 treesize of output 3094 [2025-01-09 17:21:12,941 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-09 17:21:12,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1363909350] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 17:21:12,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 17:21:12,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [14, 17] total 37 [2025-01-09 17:21:12,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933560247] [2025-01-09 17:21:12,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:21:12,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 17:21:12,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:21:12,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 17:21:12,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=963, Unknown=4, NotChecked=260, Total=1332 [2025-01-09 17:21:12,943 INFO L87 Difference]: Start difference. First operand 94 states and 113 transitions. Second operand has 11 states, 9 states have (on average 5.777777777777778) internal successors, (52), 10 states have internal predecessors, (52), 6 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2025-01-09 17:21:13,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:21:13,276 INFO L93 Difference]: Finished difference Result 116 states and 144 transitions. [2025-01-09 17:21:13,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 17:21:13,277 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 5.777777777777778) internal successors, (52), 10 states have internal predecessors, (52), 6 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) Word has length 78 [2025-01-09 17:21:13,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:21:13,278 INFO L225 Difference]: With dead ends: 116 [2025-01-09 17:21:13,278 INFO L226 Difference]: Without dead ends: 98 [2025-01-09 17:21:13,278 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 134 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 17.0s TimeCoverageRelationStatistics Valid=151, Invalid=1501, Unknown=4, NotChecked=324, Total=1980 [2025-01-09 17:21:13,279 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 98 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 17:21:13,279 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 400 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 17:21:13,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-01-09 17:21:13,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96. [2025-01-09 17:21:13,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 72 states have (on average 1.1944444444444444) internal successors, (86), 76 states have internal predecessors, (86), 12 states have call successors, (12), 9 states have call predecessors, (12), 11 states have return successors, (16), 10 states have call predecessors, (16), 11 states have call successors, (16) [2025-01-09 17:21:13,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 114 transitions. [2025-01-09 17:21:13,291 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 114 transitions. Word has length 78 [2025-01-09 17:21:13,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:21:13,291 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 114 transitions. [2025-01-09 17:21:13,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 5.777777777777778) internal successors, (52), 10 states have internal predecessors, (52), 6 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2025-01-09 17:21:13,291 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 114 transitions. [2025-01-09 17:21:13,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-01-09 17:21:13,293 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:21:13,293 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 17:21:13,303 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 17:21:13,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:21:13,498 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:21:13,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:21:13,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1857431001, now seen corresponding path program 1 times [2025-01-09 17:21:13,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:21:13,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620746544] [2025-01-09 17:21:13,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:21:13,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:21:13,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-09 17:21:13,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-09 17:21:13,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:21:13,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:21:14,035 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-01-09 17:21:14,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:21:14,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620746544] [2025-01-09 17:21:14,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620746544] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 17:21:14,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [122229560] [2025-01-09 17:21:14,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:21:14,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:21:14,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 17:21:14,037 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:21:14,038 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:21:14,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-09 17:21:14,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-09 17:21:14,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:21:14,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:21:14,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-01-09 17:21:14,177 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 17:21:14,195 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 28 treesize of output 37 [2025-01-09 17:21:14,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 9 [2025-01-09 17:21:15,464 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-09 17:21:15,465 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 17:21:15,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [122229560] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:21:15,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 17:21:15,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [14] total 22 [2025-01-09 17:21:15,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585833990] [2025-01-09 17:21:15,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:21:15,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 17:21:15,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:21:15,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 17:21:15,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2025-01-09 17:21:15,466 INFO L87 Difference]: Start difference. First operand 96 states and 114 transitions. Second operand has 11 states, 9 states have (on average 6.111111111111111) internal successors, (55), 10 states have internal predecessors, (55), 7 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (9), 5 states have call predecessors, (9), 6 states have call successors, (9) [2025-01-09 17:21:15,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:21:15,978 INFO L93 Difference]: Finished difference Result 121 states and 148 transitions. [2025-01-09 17:21:15,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 17:21:15,979 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 6.111111111111111) internal successors, (55), 10 states have internal predecessors, (55), 7 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (9), 5 states have call predecessors, (9), 6 states have call successors, (9) Word has length 78 [2025-01-09 17:21:15,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:21:15,979 INFO L225 Difference]: With dead ends: 121 [2025-01-09 17:21:15,980 INFO L226 Difference]: Without dead ends: 98 [2025-01-09 17:21:15,980 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 69 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=109, Invalid=593, Unknown=0, NotChecked=0, Total=702 [2025-01-09 17:21:15,980 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 41 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 17:21:15,980 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 406 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 17:21:15,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-01-09 17:21:15,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96. [2025-01-09 17:21:15,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 72 states have (on average 1.1805555555555556) internal successors, (85), 76 states have internal predecessors, (85), 12 states have call successors, (12), 9 states have call predecessors, (12), 11 states have return successors, (16), 10 states have call predecessors, (16), 11 states have call successors, (16) [2025-01-09 17:21:15,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 113 transitions. [2025-01-09 17:21:15,991 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 113 transitions. Word has length 78 [2025-01-09 17:21:15,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:21:15,992 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 113 transitions. [2025-01-09 17:21:15,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 6.111111111111111) internal successors, (55), 10 states have internal predecessors, (55), 7 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (9), 5 states have call predecessors, (9), 6 states have call successors, (9) [2025-01-09 17:21:15,992 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 113 transitions. [2025-01-09 17:21:15,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-01-09 17:21:15,992 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:21:15,992 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 17:21:16,001 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 17:21:16,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:21:16,197 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:21:16,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:21:16,197 INFO L85 PathProgramCache]: Analyzing trace with hash 2115596439, now seen corresponding path program 1 times [2025-01-09 17:21:16,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:21:16,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709142432] [2025-01-09 17:21:16,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:21:16,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:21:16,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-09 17:21:16,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-09 17:21:16,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:21:16,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:21:16,455 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 17:21:16,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:21:16,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709142432] [2025-01-09 17:21:16,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709142432] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 17:21:16,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1868131837] [2025-01-09 17:21:16,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:21:16,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:21:16,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 17:21:16,461 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:21:16,462 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:21:16,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-09 17:21:16,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-09 17:21:16,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:21:16,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:21:16,592 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-01-09 17:21:16,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 17:21:20,822 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_aws_linked_list_init_#in~list.base_BEFORE_CALL_18| Int) (|v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_18| Int)) (<= (+ |v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_18| 16) (select (select |c_#memory_$Pointer$#1.offset| |v_aws_linked_list_init_#in~list.base_BEFORE_CALL_18|) |v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_18|))) is different from true [2025-01-09 17:21:24,855 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_19| Int) (|v_aws_linked_list_init_#in~list.base_BEFORE_CALL_19| Int)) (<= (+ |v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_19| 16) (select (select |c_#memory_$Pointer$#1.offset| |v_aws_linked_list_init_#in~list.base_BEFORE_CALL_19|) |v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_19|))) is different from true [2025-01-09 17:21:28,893 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_aws_linked_list_init_#in~list.base_BEFORE_CALL_20| Int) (|v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_20| Int)) (<= (+ |v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_20| 16) (select (select |c_#memory_$Pointer$#1.offset| |v_aws_linked_list_init_#in~list.base_BEFORE_CALL_20|) |v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_20|))) is different from true [2025-01-09 17:21:29,166 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2025-01-09 17:21:29,166 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 17:21:29,375 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 17 treesize of output 9 [2025-01-09 17:21:29,517 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2025-01-09 17:21:29,517 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 17 treesize of output 16 [2025-01-09 17:21:29,639 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 17:21:29,639 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 17 treesize of output 20 [2025-01-09 17:21:29,793 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-09 17:21:29,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1868131837] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 17:21:29,793 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 17:21:29,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 19, 15] total 39 [2025-01-09 17:21:29,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078946592] [2025-01-09 17:21:29,794 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 17:21:29,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-01-09 17:21:29,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:21:29,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-01-09 17:21:29,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1155, Unknown=3, NotChecked=210, Total=1482 [2025-01-09 17:21:29,795 INFO L87 Difference]: Start difference. First operand 96 states and 113 transitions. Second operand has 39 states, 32 states have (on average 3.8125) internal successors, (122), 35 states have internal predecessors, (122), 17 states have call successors, (26), 6 states have call predecessors, (26), 12 states have return successors, (25), 13 states have call predecessors, (25), 16 states have call successors, (25) [2025-01-09 17:21:33,863 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 17:21:35,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:21:35,386 INFO L93 Difference]: Finished difference Result 212 states and 281 transitions. [2025-01-09 17:21:35,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-01-09 17:21:35,386 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 32 states have (on average 3.8125) internal successors, (122), 35 states have internal predecessors, (122), 17 states have call successors, (26), 6 states have call predecessors, (26), 12 states have return successors, (25), 13 states have call predecessors, (25), 16 states have call successors, (25) Word has length 78 [2025-01-09 17:21:35,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:21:35,387 INFO L225 Difference]: With dead ends: 212 [2025-01-09 17:21:35,387 INFO L226 Difference]: Without dead ends: 120 [2025-01-09 17:21:35,388 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 141 SyntacticMatches, 3 SemanticMatches, 64 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 693 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=536, Invalid=3379, Unknown=3, NotChecked=372, Total=4290 [2025-01-09 17:21:35,389 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 370 mSDsluCounter, 1075 mSDsCounter, 0 mSdLazyCounter, 1118 mSolverCounterSat, 77 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 1157 SdHoareTripleChecker+Invalid, 2362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 1118 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 1166 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2025-01-09 17:21:35,389 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [370 Valid, 1157 Invalid, 2362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 1118 Invalid, 1 Unknown, 1166 Unchecked, 4.7s Time] [2025-01-09 17:21:35,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-01-09 17:21:35,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 101. [2025-01-09 17:21:35,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 77 states have (on average 1.077922077922078) internal successors, (83), 79 states have internal predecessors, (83), 12 states have call successors, (12), 11 states have call predecessors, (12), 11 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) [2025-01-09 17:21:35,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 107 transitions. [2025-01-09 17:21:35,401 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 107 transitions. Word has length 78 [2025-01-09 17:21:35,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:21:35,401 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 107 transitions. [2025-01-09 17:21:35,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 32 states have (on average 3.8125) internal successors, (122), 35 states have internal predecessors, (122), 17 states have call successors, (26), 6 states have call predecessors, (26), 12 states have return successors, (25), 13 states have call predecessors, (25), 16 states have call successors, (25) [2025-01-09 17:21:35,402 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 107 transitions. [2025-01-09 17:21:35,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-01-09 17:21:35,402 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:21:35,402 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 17:21:35,410 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-09 17:21:35,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:21:35,605 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:21:35,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:21:35,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1238776872, now seen corresponding path program 1 times [2025-01-09 17:21:35,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:21:35,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477981296] [2025-01-09 17:21:35,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:21:35,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:21:35,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-01-09 17:21:35,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-01-09 17:21:35,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:21:35,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:21:37,450 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-09 17:21:37,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:21:37,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477981296] [2025-01-09 17:21:37,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477981296] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 17:21:37,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [925901215] [2025-01-09 17:21:37,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:21:37,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:21:37,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 17:21:37,453 INFO L229 MonitoredProcess]: Starting monitored process 7 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:21:37,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 17:21:37,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-01-09 17:21:37,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-01-09 17:21:37,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:21:37,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:21:37,641 INFO L256 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 105 conjuncts are in the unsatisfiable core [2025-01-09 17:21:37,648 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 17:21:37,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 17:21:37,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 17:21:37,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 17:21:37,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 37 [2025-01-09 17:21:37,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 17:21:37,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 17:21:37,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 17:21:37,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 9 [2025-01-09 17:21:42,490 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 25 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 17:21:42,490 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 17:21:57,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [925901215] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 17:21:57,973 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 17:21:57,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 28] total 50 [2025-01-09 17:21:57,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522707667] [2025-01-09 17:21:57,973 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 17:21:57,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2025-01-09 17:21:57,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:21:57,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2025-01-09 17:21:57,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=3417, Unknown=1, NotChecked=0, Total=3660 [2025-01-09 17:21:57,975 INFO L87 Difference]: Start difference. First operand 101 states and 107 transitions. Second operand has 50 states, 42 states have (on average 2.6666666666666665) internal successors, (112), 43 states have internal predecessors, (112), 17 states have call successors, (19), 5 states have call predecessors, (19), 15 states have return successors, (19), 15 states have call predecessors, (19), 16 states have call successors, (19) [2025-01-09 17:22:02,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:22:02,530 INFO L93 Difference]: Finished difference Result 138 states and 147 transitions. [2025-01-09 17:22:02,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-01-09 17:22:02,530 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 42 states have (on average 2.6666666666666665) internal successors, (112), 43 states have internal predecessors, (112), 17 states have call successors, (19), 5 states have call predecessors, (19), 15 states have return successors, (19), 15 states have call predecessors, (19), 16 states have call successors, (19) Word has length 91 [2025-01-09 17:22:02,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:22:02,531 INFO L225 Difference]: With dead ends: 138 [2025-01-09 17:22:02,531 INFO L226 Difference]: Without dead ends: 102 [2025-01-09 17:22:02,533 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 125 SyntacticMatches, 4 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2037 ImplicationChecksByTransitivity, 20.7s TimeCoverageRelationStatistics Valid=738, Invalid=8381, Unknown=1, NotChecked=0, Total=9120 [2025-01-09 17:22:02,534 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 148 mSDsluCounter, 1074 mSDsCounter, 0 mSdLazyCounter, 1577 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 1121 SdHoareTripleChecker+Invalid, 1627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 17:22:02,534 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 1121 Invalid, 1627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1577 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 17:22:02,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-01-09 17:22:02,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 99. [2025-01-09 17:22:02,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 76 states have (on average 1.0394736842105263) internal successors, (79), 76 states have internal predecessors, (79), 11 states have call successors, (11), 11 states have call predecessors, (11), 11 states have return successors, (11), 11 states have call predecessors, (11), 10 states have call successors, (11) [2025-01-09 17:22:02,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 101 transitions. [2025-01-09 17:22:02,566 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 101 transitions. Word has length 91 [2025-01-09 17:22:02,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:22:02,566 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 101 transitions. [2025-01-09 17:22:02,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 42 states have (on average 2.6666666666666665) internal successors, (112), 43 states have internal predecessors, (112), 17 states have call successors, (19), 5 states have call predecessors, (19), 15 states have return successors, (19), 15 states have call predecessors, (19), 16 states have call successors, (19) [2025-01-09 17:22:02,566 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 101 transitions. [2025-01-09 17:22:02,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-01-09 17:22:02,566 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:22:02,566 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 17:22:02,584 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-09 17:22:02,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-01-09 17:22:02,767 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:22:02,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:22:02,768 INFO L85 PathProgramCache]: Analyzing trace with hash -980611434, now seen corresponding path program 1 times [2025-01-09 17:22:02,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:22:02,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572151251] [2025-01-09 17:22:02,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:22:02,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:22:02,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-01-09 17:22:02,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-01-09 17:22:02,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:22:02,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:22:03,237 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-01-09 17:22:03,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:22:03,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572151251] [2025-01-09 17:22:03,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572151251] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:22:03,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 17:22:03,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-01-09 17:22:03,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860642829] [2025-01-09 17:22:03,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:22:03,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 17:22:03,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:22:03,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 17:22:03,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2025-01-09 17:22:03,239 INFO L87 Difference]: Start difference. First operand 99 states and 101 transitions. Second operand has 15 states, 12 states have (on average 4.583333333333333) internal successors, (55), 14 states have internal predecessors, (55), 8 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 6 states have call predecessors, (10), 7 states have call successors, (10) [2025-01-09 17:22:03,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:22:03,509 INFO L93 Difference]: Finished difference Result 115 states and 117 transitions. [2025-01-09 17:22:03,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 17:22:03,510 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 4.583333333333333) internal successors, (55), 14 states have internal predecessors, (55), 8 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 6 states have call predecessors, (10), 7 states have call successors, (10) Word has length 91 [2025-01-09 17:22:03,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:22:03,511 INFO L225 Difference]: With dead ends: 115 [2025-01-09 17:22:03,511 INFO L226 Difference]: Without dead ends: 97 [2025-01-09 17:22:03,512 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=396, Unknown=0, NotChecked=0, Total=462 [2025-01-09 17:22:03,513 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 26 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 17:22:03,513 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 532 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 17:22:03,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-01-09 17:22:03,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 95. [2025-01-09 17:22:03,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 73 states have (on average 1.0136986301369864) internal successors, (74), 73 states have internal predecessors, (74), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-09 17:22:03,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2025-01-09 17:22:03,531 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 91 [2025-01-09 17:22:03,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:22:03,531 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2025-01-09 17:22:03,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 4.583333333333333) internal successors, (55), 14 states have internal predecessors, (55), 8 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 6 states have call predecessors, (10), 7 states have call successors, (10) [2025-01-09 17:22:03,532 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2025-01-09 17:22:03,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-01-09 17:22:03,533 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:22:03,533 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 17:22:03,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 17:22:03,534 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:22:03,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:22:03,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1925318828, now seen corresponding path program 1 times [2025-01-09 17:22:03,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:22:03,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601342029] [2025-01-09 17:22:03,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:22:03,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:22:03,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-09 17:22:03,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-09 17:22:03,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:22:03,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:22:03,852 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-01-09 17:22:03,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:22:03,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601342029] [2025-01-09 17:22:03,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601342029] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 17:22:03,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1023700550] [2025-01-09 17:22:03,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:22:03,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:22:03,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 17:22:03,854 INFO L229 MonitoredProcess]: Starting monitored process 8 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:03,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-09 17:22:03,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-09 17:22:04,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-09 17:22:04,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:22:04,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:22:04,013 INFO L256 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-01-09 17:22:04,016 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 17:22:04,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 17:22:04,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 17:22:04,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 17:22:04,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 1 [2025-01-09 17:22:08,099 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_aws_linked_list_init_#in~list.base_BEFORE_CALL_36| Int) (|v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_36| Int)) (<= |v_aws_linked_list_init_#in~list.base_BEFORE_CALL_36| (select (select |c_#memory_$Pointer$#1.base| |v_aws_linked_list_init_#in~list.base_BEFORE_CALL_36|) |v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_36|))) is different from true