./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_array_list_push_back_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d 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_array_list_push_back_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 ff502e881eb1ce65711f1131688c06c00f482d17207657a0aaf21c7da411f1b1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 01:29:06,753 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 01:29:06,815 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-08 01:29:06,824 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 01:29:06,826 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 01:29:06,847 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 01:29:06,849 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 01:29:06,849 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 01:29:06,849 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 01:29:06,850 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 01:29:06,850 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 01:29:06,850 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 01:29:06,850 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 01:29:06,851 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 01:29:06,851 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 01:29:06,851 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 01:29:06,851 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 01:29:06,851 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 01:29:06,851 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 01:29:06,851 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 01:29:06,851 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 01:29:06,851 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 01:29:06,851 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 01:29:06,852 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 01:29:06,852 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 01:29:06,852 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 01:29:06,852 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 01:29:06,852 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 01:29:06,852 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 01:29:06,852 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 01:29:06,852 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 01:29:06,852 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 01:29:06,852 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 01:29:06,852 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 01:29:06,853 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 01:29:06,853 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 01:29:06,853 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 01:29:06,853 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 01:29:06,853 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 01:29:06,853 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 01:29:06,853 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 -> ff502e881eb1ce65711f1131688c06c00f482d17207657a0aaf21c7da411f1b1 [2025-02-08 01:29:07,089 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 01:29:07,094 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 01:29:07,095 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 01:29:07,096 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 01:29:07,096 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 01:29:07,097 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_array_list_push_back_harness.i [2025-02-08 01:29:08,256 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9a8d739dc/011332451eca4f31a1e65e53d299d5ed/FLAG1b404d761 [2025-02-08 01:29:08,674 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 01:29:08,674 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_array_list_push_back_harness.i [2025-02-08 01:29:08,696 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9a8d739dc/011332451eca4f31a1e65e53d299d5ed/FLAG1b404d761 [2025-02-08 01:29:08,712 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9a8d739dc/011332451eca4f31a1e65e53d299d5ed [2025-02-08 01:29:08,715 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 01:29:08,716 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 01:29:08,718 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 01:29:08,718 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 01:29:08,721 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 01:29:08,721 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:29:08" (1/1) ... [2025-02-08 01:29:08,723 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f204635 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:29:08, skipping insertion in model container [2025-02-08 01:29:08,723 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:29:08" (1/1) ... [2025-02-08 01:29:08,774 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 01:29:08,944 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_array_list_push_back_harness.i[4498,4511] [2025-02-08 01:29:08,949 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_array_list_push_back_harness.i[4558,4571] [2025-02-08 01:29:09,355 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:29:09,356 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:29:09,356 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:29:09,356 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:29:09,357 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:29:09,364 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:29:09,365 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:29:09,366 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:29:09,366 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:29:09,367 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:29:09,367 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:29:09,368 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:29:09,368 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:29:09,643 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:29:09,648 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:29:09,678 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 01:29:09,696 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 01:29:09,707 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_array_list_push_back_harness.i[4498,4511] [2025-02-08 01:29:09,707 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_array_list_push_back_harness.i[4558,4571] [2025-02-08 01:29:09,763 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:29:09,763 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:29:09,763 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:29:09,763 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:29:09,764 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:29:09,768 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:29:09,772 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:29:09,773 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:29:09,773 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:29:09,773 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:29:09,774 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:29:09,774 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:29:09,774 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:29:09,878 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:29:09,883 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:29:09,888 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" : : "r"(pBuf) : "memory"); [7770-7781] [2025-02-08 01:29:09,903 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 01:29:10,048 INFO L204 MainTranslator]: Completed translation [2025-02-08 01:29:10,049 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:29:10 WrapperNode [2025-02-08 01:29:10,049 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 01:29:10,050 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 01:29:10,050 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 01:29:10,050 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 01:29:10,054 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:29:10" (1/1) ... [2025-02-08 01:29:10,092 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:29:10" (1/1) ... [2025-02-08 01:29:10,140 INFO L138 Inliner]: procedures = 680, calls = 1677, calls flagged for inlining = 52, calls inlined = 13, statements flattened = 898 [2025-02-08 01:29:10,140 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 01:29:10,141 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 01:29:10,141 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 01:29:10,141 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 01:29:10,151 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:29:10" (1/1) ... [2025-02-08 01:29:10,151 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:29:10" (1/1) ... [2025-02-08 01:29:10,162 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:29:10" (1/1) ... [2025-02-08 01:29:10,221 INFO L175 MemorySlicer]: Split 334 memory accesses to 6 slices as follows [238, 2, 74, 6, 6, 8]. 71 percent of accesses are in the largest equivalence class. The 24 initializations are split as follows [6, 2, 10, 0, 1, 5]. The 241 writes are split as follows [232, 0, 6, 2, 1, 0]. [2025-02-08 01:29:10,222 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:29:10" (1/1) ... [2025-02-08 01:29:10,222 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:29:10" (1/1) ... [2025-02-08 01:29:10,254 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:29:10" (1/1) ... [2025-02-08 01:29:10,256 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:29:10" (1/1) ... [2025-02-08 01:29:10,260 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:29:10" (1/1) ... [2025-02-08 01:29:10,263 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:29:10" (1/1) ... [2025-02-08 01:29:10,270 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 01:29:10,271 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 01:29:10,271 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 01:29:10,271 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 01:29:10,272 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:29:10" (1/1) ... [2025-02-08 01:29:10,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 01:29:10,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:29:10,301 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-02-08 01:29:10,308 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-02-08 01:29:10,321 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 01:29:10,321 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_list_is_bounded [2025-02-08 01:29:10,321 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_list_is_bounded [2025-02-08 01:29:10,321 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_list_is_valid [2025-02-08 01:29:10,321 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_list_is_valid [2025-02-08 01:29:10,322 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2025-02-08 01:29:10,322 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2025-02-08 01:29:10,322 INFO L130 BoogieDeclarations]: Found specification of procedure aws_allocator_is_valid [2025-02-08 01:29:10,322 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_allocator_is_valid [2025-02-08 01:29:10,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-02-08 01:29:10,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-02-08 01:29:10,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-02-08 01:29:10,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-02-08 01:29:10,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-02-08 01:29:10,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-02-08 01:29:10,322 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 01:29:10,322 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 01:29:10,322 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 01:29:10,322 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-08 01:29:10,322 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-08 01:29:10,322 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-08 01:29:10,323 INFO L130 BoogieDeclarations]: Found specification of procedure aws_raise_error [2025-02-08 01:29:10,323 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_raise_error [2025-02-08 01:29:10,323 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-08 01:29:10,323 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-08 01:29:10,323 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 01:29:10,323 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 01:29:10,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-08 01:29:10,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-08 01:29:10,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-08 01:29:10,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-02-08 01:29:10,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-02-08 01:29:10,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-02-08 01:29:10,323 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy_impl [2025-02-08 01:29:10,323 INFO L138 BoogieDeclarations]: Found implementation of procedure memcpy_impl [2025-02-08 01:29:10,323 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 01:29:10,324 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 01:29:10,324 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2025-02-08 01:29:10,324 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2025-02-08 01:29:10,324 INFO L130 BoogieDeclarations]: Found specification of procedure assert_byte_from_buffer_matches [2025-02-08 01:29:10,324 INFO L138 BoogieDeclarations]: Found implementation of procedure assert_byte_from_buffer_matches [2025-02-08 01:29:10,324 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_size_t [2025-02-08 01:29:10,324 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_size_t [2025-02-08 01:29:10,324 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mul_size_checked [2025-02-08 01:29:10,324 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mul_size_checked [2025-02-08 01:29:10,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-02-08 01:29:10,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-02-08 01:29:10,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-02-08 01:29:10,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-02-08 01:29:10,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-02-08 01:29:10,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-02-08 01:29:10,324 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_malloc [2025-02-08 01:29:10,325 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_malloc [2025-02-08 01:29:10,325 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mem_release [2025-02-08 01:29:10,325 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mem_release [2025-02-08 01:29:10,325 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_list_length [2025-02-08 01:29:10,325 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_list_length [2025-02-08 01:29:10,325 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-08 01:29:10,325 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-08 01:29:10,325 INFO L130 BoogieDeclarations]: Found specification of procedure my_memcpy [2025-02-08 01:29:10,325 INFO L138 BoogieDeclarations]: Found implementation of procedure my_memcpy [2025-02-08 01:29:10,325 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mem_acquire [2025-02-08 01:29:10,325 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mem_acquire [2025-02-08 01:29:10,325 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 01:29:10,325 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_plus [2025-02-08 01:29:10,325 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_plus [2025-02-08 01:29:10,325 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 01:29:10,325 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-08 01:29:10,325 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-08 01:29:10,325 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-02-08 01:29:10,325 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-02-08 01:29:10,325 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-02-08 01:29:10,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-08 01:29:10,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-08 01:29:10,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-08 01:29:10,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-02-08 01:29:10,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-02-08 01:29:10,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-02-08 01:29:10,325 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2025-02-08 01:29:10,326 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2025-02-08 01:29:10,326 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_mult [2025-02-08 01:29:10,326 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_mult [2025-02-08 01:29:10,326 INFO L130 BoogieDeclarations]: Found specification of procedure aws_add_size_checked [2025-02-08 01:29:10,326 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_add_size_checked [2025-02-08 01:29:10,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 01:29:10,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 01:29:10,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 01:29:10,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-08 01:29:10,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-08 01:29:10,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-08 01:29:10,326 INFO L130 BoogieDeclarations]: Found specification of procedure ensure_array_list_has_allocated_data_member [2025-02-08 01:29:10,326 INFO L138 BoogieDeclarations]: Found implementation of procedure ensure_array_list_has_allocated_data_member [2025-02-08 01:29:10,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 01:29:10,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 01:29:10,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 01:29:10,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-08 01:29:10,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-08 01:29:10,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-08 01:29:10,579 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 01:29:10,581 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 01:29:10,624 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2782: havoc #t~malloc77.base, #t~malloc77.offset; [2025-02-08 01:29:10,660 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L263: havoc #t~nondet6; [2025-02-08 01:29:10,671 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2588: havoc #t~ret57#1; [2025-02-08 01:29:10,686 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2796: havoc #t~ret81;havoc #t~ite83.base, #t~ite83.offset;havoc #t~ret82.base, #t~ret82.offset; [2025-02-08 01:29:10,734 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3268: call ULTIMATE.dealloc(~#required_size~0.base, ~#required_size~0.offset);havoc ~#required_size~0.base, ~#required_size~0.offset; [2025-02-08 01:29:10,737 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L261: havoc #t~nondet4; [2025-02-08 01:29:10,746 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2821: havoc #t~ret89.base, #t~ret89.offset; [2025-02-08 01:29:10,774 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L7391: havoc #t~ret681.base, #t~ret681.offset; [2025-02-08 01:29:10,796 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2615: havoc #t~ret59#1; [2025-02-08 01:29:16,009 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L7535: havoc aws_array_list_ensure_capacity_#t~ret764#1; [2025-02-08 01:29:16,010 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L7412: call ULTIMATE.dealloc(aws_array_list_calc_necessary_size_~#index_inc~0#1.base, aws_array_list_calc_necessary_size_~#index_inc~0#1.offset);havoc aws_array_list_calc_necessary_size_~#index_inc~0#1.base, aws_array_list_calc_necessary_size_~#index_inc~0#1.offset; [2025-02-08 01:29:16,010 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L7513: call ULTIMATE.dealloc(aws_array_list_ensure_capacity_~#necessary_size~0#1.base, aws_array_list_ensure_capacity_~#necessary_size~0#1.offset);havoc aws_array_list_ensure_capacity_~#necessary_size~0#1.base, aws_array_list_ensure_capacity_~#necessary_size~0#1.offset; [2025-02-08 01:29:16,010 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L7522: havoc aws_array_list_ensure_capacity_#t~ret757#1; [2025-02-08 01:29:16,010 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3319-3: aws_array_list_push_back_#t~ret161#1 := aws_last_error_#res#1;assume { :end_inline_aws_last_error } true;assume -2147483648 <= aws_array_list_push_back_#t~ret161#1 && aws_array_list_push_back_#t~ret161#1 <= 2147483647;aws_array_list_push_back_#t~short162#1 := 9 == aws_array_list_push_back_#t~ret161#1; [2025-02-08 01:29:16,010 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3321: havoc aws_array_list_push_back_#t~ret166#1; [2025-02-08 01:29:16,123 INFO L? ?]: Removed 183 outVars from TransFormulas that were not future-live. [2025-02-08 01:29:16,123 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 01:29:16,132 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 01:29:16,132 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 01:29:16,133 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:29:16 BoogieIcfgContainer [2025-02-08 01:29:16,133 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 01:29:16,134 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 01:29:16,134 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 01:29:16,137 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 01:29:16,138 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 01:29:08" (1/3) ... [2025-02-08 01:29:16,138 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@360fd08a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:29:16, skipping insertion in model container [2025-02-08 01:29:16,138 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:29:10" (2/3) ... [2025-02-08 01:29:16,138 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@360fd08a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:29:16, skipping insertion in model container [2025-02-08 01:29:16,138 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:29:16" (3/3) ... [2025-02-08 01:29:16,139 INFO L128 eAbstractionObserver]: Analyzing ICFG aws_array_list_push_back_harness.i [2025-02-08 01:29:16,148 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 01:29:16,149 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG aws_array_list_push_back_harness.i that has 23 procedures, 303 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-02-08 01:29:16,184 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 01:29:16,190 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;@49491a4d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 01:29:16,190 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-08 01:29:16,197 INFO L276 IsEmpty]: Start isEmpty. Operand has 303 states, 170 states have (on average 1.2294117647058824) internal successors, (209), 177 states have internal predecessors, (209), 103 states have call successors, (103), 22 states have call predecessors, (103), 22 states have return successors, (103), 103 states have call predecessors, (103), 103 states have call successors, (103) [2025-02-08 01:29:16,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-08 01:29:16,204 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:29:16,205 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 01:29:16,205 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:29:16,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:29:16,208 INFO L85 PathProgramCache]: Analyzing trace with hash -640476487, now seen corresponding path program 1 times [2025-02-08 01:29:16,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:29:16,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091251213] [2025-02-08 01:29:16,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:29:16,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:29:20,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-08 01:29:20,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-08 01:29:20,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:29:20,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:29:21,301 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2025-02-08 01:29:21,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:29:21,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091251213] [2025-02-08 01:29:21,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091251213] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:29:21,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1436642989] [2025-02-08 01:29:21,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:29:21,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:29:21,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:29:21,306 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-02-08 01:29:21,308 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-02-08 01:29:25,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-08 01:29:25,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-08 01:29:25,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:29:25,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:29:25,946 INFO L256 TraceCheckSpWp]: Trace formula consists of 4280 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-08 01:29:25,955 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:29:25,970 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2025-02-08 01:29:25,971 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 01:29:25,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1436642989] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:29:25,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 01:29:25,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-08 01:29:25,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454787670] [2025-02-08 01:29:25,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:29:25,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 01:29:25,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:29:25,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 01:29:26,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 01:29:26,003 INFO L87 Difference]: Start difference. First operand has 303 states, 170 states have (on average 1.2294117647058824) internal successors, (209), 177 states have internal predecessors, (209), 103 states have call successors, (103), 22 states have call predecessors, (103), 22 states have return successors, (103), 103 states have call predecessors, (103), 103 states have call successors, (103) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-02-08 01:29:26,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:29:26,064 INFO L93 Difference]: Finished difference Result 600 states and 883 transitions. [2025-02-08 01:29:26,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 01:29:26,066 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 134 [2025-02-08 01:29:26,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:29:26,076 INFO L225 Difference]: With dead ends: 600 [2025-02-08 01:29:26,076 INFO L226 Difference]: Without dead ends: 285 [2025-02-08 01:29:26,085 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 135 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-02-08 01:29:26,090 INFO L435 NwaCegarLoop]: 413 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, 413 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-02-08 01:29:26,091 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 01:29:26,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2025-02-08 01:29:26,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 285. [2025-02-08 01:29:26,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 162 states have (on average 1.2037037037037037) internal successors, (195), 166 states have internal predecessors, (195), 100 states have call successors, (100), 22 states have call predecessors, (100), 22 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2025-02-08 01:29:26,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 391 transitions. [2025-02-08 01:29:26,154 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 391 transitions. Word has length 134 [2025-02-08 01:29:26,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:29:26,156 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 391 transitions. [2025-02-08 01:29:26,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-02-08 01:29:26,156 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 391 transitions. [2025-02-08 01:29:26,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-08 01:29:26,160 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:29:26,160 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 01:29:26,178 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 01:29:26,361 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,SelfDestructingSolverStorable0 [2025-02-08 01:29:26,362 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:29:26,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:29:26,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1553446396, now seen corresponding path program 1 times [2025-02-08 01:29:26,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:29:26,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694185635] [2025-02-08 01:29:26,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:29:26,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:29:30,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-08 01:29:30,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-08 01:29:30,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:29:30,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:29:31,248 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2025-02-08 01:29:31,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:29:31,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694185635] [2025-02-08 01:29:31,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694185635] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:29:31,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [613438455] [2025-02-08 01:29:31,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:29:31,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:29:31,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:29:31,252 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-02-08 01:29:31,253 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-02-08 01:29:35,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-08 01:29:36,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-08 01:29:36,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:29:36,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:29:36,076 INFO L256 TraceCheckSpWp]: Trace formula consists of 4280 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 01:29:36,085 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:29:36,592 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2025-02-08 01:29:36,592 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 01:29:36,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [613438455] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:29:36,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 01:29:36,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-02-08 01:29:36,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849729704] [2025-02-08 01:29:36,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:29:36,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 01:29:36,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:29:36,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 01:29:36,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-08 01:29:36,595 INFO L87 Difference]: Start difference. First operand 285 states and 391 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 3 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2025-02-08 01:29:38,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:29:38,293 INFO L93 Difference]: Finished difference Result 547 states and 770 transitions. [2025-02-08 01:29:38,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 01:29:38,294 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 3 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) Word has length 134 [2025-02-08 01:29:38,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:29:38,301 INFO L225 Difference]: With dead ends: 547 [2025-02-08 01:29:38,302 INFO L226 Difference]: Without dead ends: 287 [2025-02-08 01:29:38,303 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-08 01:29:38,304 INFO L435 NwaCegarLoop]: 358 mSDtfsCounter, 104 mSDsluCounter, 882 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 1240 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-02-08 01:29:38,305 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 1240 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-02-08 01:29:38,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2025-02-08 01:29:38,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 287. [2025-02-08 01:29:38,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 163 states have (on average 1.2024539877300613) internal successors, (196), 168 states have internal predecessors, (196), 100 states have call successors, (100), 22 states have call predecessors, (100), 23 states have return successors, (115), 96 states have call predecessors, (115), 96 states have call successors, (115) [2025-02-08 01:29:38,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 411 transitions. [2025-02-08 01:29:38,340 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 411 transitions. Word has length 134 [2025-02-08 01:29:38,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:29:38,340 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 411 transitions. [2025-02-08 01:29:38,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 3 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2025-02-08 01:29:38,341 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 411 transitions. [2025-02-08 01:29:38,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-02-08 01:29:38,346 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:29:38,347 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 01:29:38,362 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-02-08 01:29:38,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:29:38,551 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:29:38,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:29:38,552 INFO L85 PathProgramCache]: Analyzing trace with hash 970813084, now seen corresponding path program 1 times [2025-02-08 01:29:38,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:29:38,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344593432] [2025-02-08 01:29:38,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:29:38,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:29:42,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-02-08 01:29:42,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-02-08 01:29:42,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:29:42,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:29:43,665 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 262 trivial. 0 not checked. [2025-02-08 01:29:43,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:29:43,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344593432] [2025-02-08 01:29:43,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344593432] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:29:43,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1692441115] [2025-02-08 01:29:43,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:29:43,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:29:43,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:29:43,667 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-02-08 01:29:43,669 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-02-08 01:29:47,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-02-08 01:29:48,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-02-08 01:29:48,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:29:48,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:29:48,239 INFO L256 TraceCheckSpWp]: Trace formula consists of 4534 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-08 01:29:48,245 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:29:49,328 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2025-02-08 01:29:49,330 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 01:29:49,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1692441115] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:29:49,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 01:29:49,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2025-02-08 01:29:49,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056571550] [2025-02-08 01:29:49,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:29:49,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 01:29:49,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:29:49,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 01:29:49,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-02-08 01:29:49,332 INFO L87 Difference]: Start difference. First operand 287 states and 411 transitions. Second operand has 6 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 4 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) [2025-02-08 01:29:51,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:29:51,303 INFO L93 Difference]: Finished difference Result 523 states and 748 transitions. [2025-02-08 01:29:51,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 01:29:51,303 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 4 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) Word has length 162 [2025-02-08 01:29:51,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:29:51,310 INFO L225 Difference]: With dead ends: 523 [2025-02-08 01:29:51,310 INFO L226 Difference]: Without dead ends: 287 [2025-02-08 01:29:51,311 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-02-08 01:29:51,311 INFO L435 NwaCegarLoop]: 358 mSDtfsCounter, 161 mSDsluCounter, 1145 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 1503 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-02-08 01:29:51,311 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 1503 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-02-08 01:29:51,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2025-02-08 01:29:51,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 287. [2025-02-08 01:29:51,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 163 states have (on average 1.2024539877300613) internal successors, (196), 168 states have internal predecessors, (196), 100 states have call successors, (100), 22 states have call predecessors, (100), 23 states have return successors, (112), 96 states have call predecessors, (112), 96 states have call successors, (112) [2025-02-08 01:29:51,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 408 transitions. [2025-02-08 01:29:51,357 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 408 transitions. Word has length 162 [2025-02-08 01:29:51,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:29:51,357 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 408 transitions. [2025-02-08 01:29:51,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 4 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) [2025-02-08 01:29:51,357 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 408 transitions. [2025-02-08 01:29:51,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-02-08 01:29:51,359 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:29:51,359 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 01:29:51,375 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-02-08 01:29:51,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:29:51,560 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:29:51,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:29:51,560 INFO L85 PathProgramCache]: Analyzing trace with hash -364216825, now seen corresponding path program 2 times [2025-02-08 01:29:51,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:29:51,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946456190] [2025-02-08 01:29:51,561 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 01:29:51,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:29:55,224 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 176 statements into 2 equivalence classes. [2025-02-08 01:29:55,645 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 176 of 176 statements. [2025-02-08 01:29:55,646 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 01:29:55,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:29:57,234 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2025-02-08 01:29:57,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:29:57,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946456190] [2025-02-08 01:29:57,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946456190] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:29:57,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:29:57,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 01:29:57,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961306710] [2025-02-08 01:29:57,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:29:57,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 01:29:57,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:29:57,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 01:29:57,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-08 01:29:57,236 INFO L87 Difference]: Start difference. First operand 287 states and 408 transitions. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 7 states have internal predecessors, (60), 5 states have call successors, (26), 3 states have call predecessors, (26), 2 states have return successors, (24), 5 states have call predecessors, (24), 4 states have call successors, (24) [2025-02-08 01:30:00,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:30:00,165 INFO L93 Difference]: Finished difference Result 529 states and 753 transitions. [2025-02-08 01:30:00,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 01:30:00,166 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 7 states have internal predecessors, (60), 5 states have call successors, (26), 3 states have call predecessors, (26), 2 states have return successors, (24), 5 states have call predecessors, (24), 4 states have call successors, (24) Word has length 176 [2025-02-08 01:30:00,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:30:00,168 INFO L225 Difference]: With dead ends: 529 [2025-02-08 01:30:00,169 INFO L226 Difference]: Without dead ends: 299 [2025-02-08 01:30:00,175 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-02-08 01:30:00,178 INFO L435 NwaCegarLoop]: 356 mSDtfsCounter, 168 mSDsluCounter, 1847 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 2203 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-02-08 01:30:00,178 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 2203 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-02-08 01:30:00,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2025-02-08 01:30:00,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2025-02-08 01:30:00,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 169 states have (on average 1.2011834319526626) internal successors, (203), 174 states have internal predecessors, (203), 105 states have call successors, (105), 23 states have call predecessors, (105), 24 states have return successors, (117), 101 states have call predecessors, (117), 101 states have call successors, (117) [2025-02-08 01:30:00,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 425 transitions. [2025-02-08 01:30:00,204 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 425 transitions. Word has length 176 [2025-02-08 01:30:00,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:30:00,204 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 425 transitions. [2025-02-08 01:30:00,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 7 states have internal predecessors, (60), 5 states have call successors, (26), 3 states have call predecessors, (26), 2 states have return successors, (24), 5 states have call predecessors, (24), 4 states have call successors, (24) [2025-02-08 01:30:00,205 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 425 transitions. [2025-02-08 01:30:00,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-02-08 01:30:00,207 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:30:00,207 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 01:30:00,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 01:30:00,208 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:30:00,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:30:00,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1262774119, now seen corresponding path program 1 times [2025-02-08 01:30:00,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:30:00,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727722062] [2025-02-08 01:30:00,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:30:00,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:30:03,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-02-08 01:30:04,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-02-08 01:30:04,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:30:04,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:30:05,924 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2025-02-08 01:30:05,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:30:05,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727722062] [2025-02-08 01:30:05,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727722062] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:30:05,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:30:05,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 01:30:05,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656417260] [2025-02-08 01:30:05,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:30:05,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 01:30:05,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:30:05,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 01:30:05,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 01:30:05,926 INFO L87 Difference]: Start difference. First operand 299 states and 425 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 6 states have internal predecessors, (56), 3 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (24), 4 states have call predecessors, (24), 3 states have call successors, (24) [2025-02-08 01:30:09,992 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 01:30:14,451 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.46s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 01:30:18,848 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.39s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 01:30:19,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:30:19,977 INFO L93 Difference]: Finished difference Result 568 states and 809 transitions. [2025-02-08 01:30:19,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 01:30:19,978 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 6 states have internal predecessors, (56), 3 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (24), 4 states have call predecessors, (24), 3 states have call successors, (24) Word has length 204 [2025-02-08 01:30:19,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:30:19,982 INFO L225 Difference]: With dead ends: 568 [2025-02-08 01:30:19,982 INFO L226 Difference]: Without dead ends: 317 [2025-02-08 01:30:19,983 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-08 01:30:19,985 INFO L435 NwaCegarLoop]: 386 mSDtfsCounter, 6 mSDsluCounter, 1924 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 2310 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.9s IncrementalHoareTripleChecker+Time [2025-02-08 01:30:19,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 2310 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 3 Unknown, 0 Unchecked, 13.9s Time] [2025-02-08 01:30:19,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2025-02-08 01:30:20,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 313. [2025-02-08 01:30:20,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 178 states have (on average 1.196629213483146) internal successors, (213), 183 states have internal predecessors, (213), 109 states have call successors, (109), 23 states have call predecessors, (109), 25 states have return successors, (123), 106 states have call predecessors, (123), 105 states have call successors, (123) [2025-02-08 01:30:20,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 445 transitions. [2025-02-08 01:30:20,008 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 445 transitions. Word has length 204 [2025-02-08 01:30:20,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:30:20,009 INFO L471 AbstractCegarLoop]: Abstraction has 313 states and 445 transitions. [2025-02-08 01:30:20,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 6 states have internal predecessors, (56), 3 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (24), 4 states have call predecessors, (24), 3 states have call successors, (24) [2025-02-08 01:30:20,009 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 445 transitions. [2025-02-08 01:30:20,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-02-08 01:30:20,011 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:30:20,011 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 01:30:20,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 01:30:20,011 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:30:20,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:30:20,012 INFO L85 PathProgramCache]: Analyzing trace with hash 734408518, now seen corresponding path program 1 times [2025-02-08 01:30:20,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:30:20,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328860710] [2025-02-08 01:30:20,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:30:20,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:30:23,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-02-08 01:30:23,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-02-08 01:30:23,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:30:23,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:30:26,406 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2025-02-08 01:30:26,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:30:26,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328860710] [2025-02-08 01:30:26,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328860710] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:30:26,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:30:26,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 01:30:26,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982990984] [2025-02-08 01:30:26,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:30:26,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 01:30:26,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:30:26,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 01:30:26,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-08 01:30:26,408 INFO L87 Difference]: Start difference. First operand 313 states and 445 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 7 states have internal predecessors, (56), 4 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (24), 5 states have call predecessors, (24), 4 states have call successors, (24) [2025-02-08 01:30:30,469 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 01:30:34,851 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.38s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 01:30:36,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:30:36,390 INFO L93 Difference]: Finished difference Result 573 states and 814 transitions. [2025-02-08 01:30:36,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 01:30:36,390 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 7 states have internal predecessors, (56), 4 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (24), 5 states have call predecessors, (24), 4 states have call successors, (24) Word has length 204 [2025-02-08 01:30:36,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:30:36,393 INFO L225 Difference]: With dead ends: 573 [2025-02-08 01:30:36,393 INFO L226 Difference]: Without dead ends: 325 [2025-02-08 01:30:36,394 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-08 01:30:36,394 INFO L435 NwaCegarLoop]: 386 mSDtfsCounter, 7 mSDsluCounter, 2305 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 3 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 2691 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.8s IncrementalHoareTripleChecker+Time [2025-02-08 01:30:36,394 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 2691 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 55 Invalid, 2 Unknown, 0 Unchecked, 9.8s Time] [2025-02-08 01:30:36,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2025-02-08 01:30:36,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 319. [2025-02-08 01:30:36,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 181 states have (on average 1.1933701657458564) internal successors, (216), 186 states have internal predecessors, (216), 112 states have call successors, (112), 23 states have call predecessors, (112), 25 states have return successors, (126), 109 states have call predecessors, (126), 108 states have call successors, (126) [2025-02-08 01:30:36,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 454 transitions. [2025-02-08 01:30:36,409 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 454 transitions. Word has length 204 [2025-02-08 01:30:36,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:30:36,410 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 454 transitions. [2025-02-08 01:30:36,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 7 states have internal predecessors, (56), 4 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (24), 5 states have call predecessors, (24), 4 states have call successors, (24) [2025-02-08 01:30:36,410 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 454 transitions. [2025-02-08 01:30:36,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-02-08 01:30:36,412 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:30:36,412 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 01:30:36,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 01:30:36,413 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:30:36,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:30:36,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1440271579, now seen corresponding path program 1 times [2025-02-08 01:30:36,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:30:36,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738753012] [2025-02-08 01:30:36,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:30:36,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:30:39,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-02-08 01:30:41,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-02-08 01:30:41,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:30:41,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat