./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_linked_list_back_harness_negated.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/aws-c-common/aws_linked_list_back_harness_negated.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 a846a77e79e267e728f6b3926ab21995aa009422ba7c404ee2d371931ead2c4d --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 17:20:06,678 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 17:20:06,754 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-01-09 17:20:06,760 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 17:20:06,761 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 17:20:06,789 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 17:20:06,791 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 17:20:06,791 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 17:20:06,791 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 17:20:06,792 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 17:20:06,792 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 17:20:06,793 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 17:20:06,793 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 17:20:06,793 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 17:20:06,793 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 17:20:06,793 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 17:20:06,794 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 17:20:06,794 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 17:20:06,794 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 17:20:06,794 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 17:20:06,794 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 17:20:06,794 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 17:20:06,794 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 17:20:06,794 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 17:20:06,795 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 17:20:06,795 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 17:20:06,795 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 17:20:06,795 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 17:20:06,795 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 17:20:06,795 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 17:20:06,795 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 17:20:06,795 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 17:20:06,795 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 17:20:06,795 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 17:20:06,795 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 17:20:06,795 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 17:20:06,795 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 17:20:06,795 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 17:20:06,796 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 17:20:06,796 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 17:20:06,796 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 17:20:06,796 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 17:20:06,796 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 17:20:06,796 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 17:20:06,796 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 17:20:06,796 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 -> a846a77e79e267e728f6b3926ab21995aa009422ba7c404ee2d371931ead2c4d [2025-01-09 17:20:07,087 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 17:20:07,097 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 17:20:07,100 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 17:20:07,101 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 17:20:07,102 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 17:20:07,103 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_linked_list_back_harness_negated.i [2025-01-09 17:20:08,393 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/944ea4c80/1bd59174798b47928acc38cd6a5a896f/FLAGad52f7403 [2025-01-09 17:20:08,903 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 17:20:08,903 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_back_harness_negated.i [2025-01-09 17:20:08,934 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/944ea4c80/1bd59174798b47928acc38cd6a5a896f/FLAGad52f7403 [2025-01-09 17:20:08,950 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/944ea4c80/1bd59174798b47928acc38cd6a5a896f [2025-01-09 17:20:08,952 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 17:20:08,953 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 17:20:08,954 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 17:20:08,954 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 17:20:08,958 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 17:20:08,960 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:20:08" (1/1) ... [2025-01-09 17:20:08,960 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1714d5dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:20:08, skipping insertion in model container [2025-01-09 17:20:08,961 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:20:08" (1/1) ... [2025-01-09 17:20:09,043 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 17:20:09,315 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_back_harness_negated.i[4494,4507] [2025-01-09 17:20:09,324 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_back_harness_negated.i[4554,4567] [2025-01-09 17:20:10,299 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:10,300 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:10,301 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:10,301 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:10,302 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:10,319 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:10,320 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:10,322 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:10,322 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:10,324 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:10,327 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:10,327 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:10,328 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:10,810 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_back_harness_negated.i[150870,150883] [2025-01-09 17:20:10,812 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 17:20:10,837 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 17:20:10,852 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_back_harness_negated.i[4494,4507] [2025-01-09 17:20:10,852 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_back_harness_negated.i[4554,4567] [2025-01-09 17:20:10,895 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:10,896 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:10,896 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:10,897 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:10,897 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:10,904 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:10,905 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:10,906 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:10,906 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:10,907 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:10,908 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:10,908 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:10,908 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:20:11,003 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_back_harness_negated.i[150870,150883] [2025-01-09 17:20:11,003 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 17:20:11,180 INFO L204 MainTranslator]: Completed translation [2025-01-09 17:20:11,180 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:20:11 WrapperNode [2025-01-09 17:20:11,181 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 17:20:11,182 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 17:20:11,183 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 17:20:11,183 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 17:20:11,188 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:20:11" (1/1) ... [2025-01-09 17:20:11,250 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:20:11" (1/1) ... [2025-01-09 17:20:11,290 INFO L138 Inliner]: procedures = 668, calls = 1043, calls flagged for inlining = 51, calls inlined = 5, statements flattened = 129 [2025-01-09 17:20:11,293 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 17:20:11,294 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 17:20:11,294 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 17:20:11,294 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 17:20:11,300 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:20:11" (1/1) ... [2025-01-09 17:20:11,300 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:20:11" (1/1) ... [2025-01-09 17:20:11,304 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:20:11" (1/1) ... [2025-01-09 17:20:11,330 INFO L175 MemorySlicer]: Split 27 memory accesses to 3 slices as follows [2, 5, 20]. 74 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5, 0]. The 6 writes are split as follows [0, 0, 6]. [2025-01-09 17:20:11,330 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:20:11" (1/1) ... [2025-01-09 17:20:11,331 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:20:11" (1/1) ... [2025-01-09 17:20:11,352 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:20:11" (1/1) ... [2025-01-09 17:20:11,355 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:20:11" (1/1) ... [2025-01-09 17:20:11,358 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:20:11" (1/1) ... [2025-01-09 17:20:11,361 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:20:11" (1/1) ... [2025-01-09 17:20:11,363 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:20:11" (1/1) ... [2025-01-09 17:20:11,368 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 17:20:11,371 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 17:20:11,371 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 17:20:11,371 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 17:20:11,372 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:20:11" (1/1) ... [2025-01-09 17:20:11,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 17:20:11,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 17:20:11,409 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 17:20:11,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 17:20:11,436 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_back [2025-01-09 17:20:11,436 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_back [2025-01-09 17:20:11,436 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 17:20:11,436 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-01-09 17:20:11,437 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-01-09 17:20:11,437 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2025-01-09 17:20:11,438 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2025-01-09 17:20:11,438 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 17:20:11,438 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2025-01-09 17:20:11,438 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2025-01-09 17:20:11,438 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 17:20:11,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 17:20:11,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 17:20:11,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-09 17:20:11,439 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 17:20:11,439 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 17:20:11,439 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_empty [2025-01-09 17:20:11,439 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_empty [2025-01-09 17:20:11,439 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 17:20:11,440 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 17:20:11,440 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 17:20:11,440 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 17:20:11,440 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 17:20:11,440 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-09 17:20:11,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-01-09 17:20:11,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-01-09 17:20:11,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-01-09 17:20:11,440 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2025-01-09 17:20:11,440 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2025-01-09 17:20:11,440 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_prev_is_valid [2025-01-09 17:20:11,440 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_prev_is_valid [2025-01-09 17:20:11,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 17:20:11,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 17:20:11,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 17:20:11,667 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 17:20:11,669 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 17:20:11,994 INFO L? ?]: Removed 60 outVars from TransFormulas that were not future-live. [2025-01-09 17:20:11,994 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 17:20:12,005 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 17:20:12,005 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 17:20:12,006 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:20:12 BoogieIcfgContainer [2025-01-09 17:20:12,006 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 17:20:12,007 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 17:20:12,007 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 17:20:12,011 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 17:20:12,011 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 05:20:08" (1/3) ... [2025-01-09 17:20:12,012 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3074ad5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:20:12, skipping insertion in model container [2025-01-09 17:20:12,012 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:20:11" (2/3) ... [2025-01-09 17:20:12,012 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3074ad5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:20:12, skipping insertion in model container [2025-01-09 17:20:12,012 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:20:12" (3/3) ... [2025-01-09 17:20:12,014 INFO L128 eAbstractionObserver]: Analyzing ICFG aws_linked_list_back_harness_negated.i [2025-01-09 17:20:12,027 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 17:20:12,032 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG aws_linked_list_back_harness_negated.i that has 9 procedures, 96 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-01-09 17:20:12,090 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 17:20:12,103 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;@198a906a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 17:20:12,103 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 17:20:12,108 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 62 states have (on average 1.2741935483870968) internal successors, (79), 63 states have internal predecessors, (79), 24 states have call successors, (24), 8 states have call predecessors, (24), 8 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-01-09 17:20:12,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-01-09 17:20:12,116 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:20:12,116 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 17:20:12,117 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:20:12,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:20:12,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1106047712, now seen corresponding path program 1 times [2025-01-09 17:20:12,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:20:12,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646187670] [2025-01-09 17:20:12,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:20:12,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:20:12,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-01-09 17:20:12,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-01-09 17:20:12,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:20:12,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:20:12,479 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-01-09 17:20:12,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:20:12,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646187670] [2025-01-09 17:20:12,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646187670] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 17:20:12,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2095529840] [2025-01-09 17:20:12,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:20:12,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:20:12,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 17:20:12,490 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 17:20:12,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 17:20:12,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-01-09 17:20:12,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-01-09 17:20:12,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:20:12,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:20:12,719 INFO L256 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 17:20:12,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 17:20:12,745 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-01-09 17:20:12,746 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 17:20:12,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2095529840] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:20:12,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 17:20:12,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 17:20:12,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667996674] [2025-01-09 17:20:12,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:20:12,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 17:20:12,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:20:12,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 17:20:12,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 17:20:12,775 INFO L87 Difference]: Start difference. First operand has 96 states, 62 states have (on average 1.2741935483870968) internal successors, (79), 63 states have internal predecessors, (79), 24 states have call successors, (24), 8 states have call predecessors, (24), 8 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 17:20:12,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:20:12,806 INFO L93 Difference]: Finished difference Result 184 states and 260 transitions. [2025-01-09 17:20:12,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 17:20:12,810 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 83 [2025-01-09 17:20:12,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:20:12,815 INFO L225 Difference]: With dead ends: 184 [2025-01-09 17:20:12,815 INFO L226 Difference]: Without dead ends: 91 [2025-01-09 17:20:12,819 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 17:20:12,822 INFO L435 NwaCegarLoop]: 125 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, 125 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 17:20:12,822 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 17:20:12,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-01-09 17:20:12,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2025-01-09 17:20:12,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 58 states have (on average 1.2586206896551724) internal successors, (73), 59 states have internal predecessors, (73), 24 states have call successors, (24), 8 states have call predecessors, (24), 8 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-01-09 17:20:12,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 120 transitions. [2025-01-09 17:20:12,875 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 120 transitions. Word has length 83 [2025-01-09 17:20:12,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:20:12,876 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 120 transitions. [2025-01-09 17:20:12,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 17:20:12,876 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 120 transitions. [2025-01-09 17:20:12,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-01-09 17:20:12,881 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:20:12,881 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 17:20:12,891 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 17:20:13,082 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-01-09 17:20:13,082 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:20:13,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:20:13,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1954031340, now seen corresponding path program 1 times [2025-01-09 17:20:13,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:20:13,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223739943] [2025-01-09 17:20:13,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:20:13,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:20:13,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-01-09 17:20:13,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-01-09 17:20:13,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:20:13,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:20:13,948 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2025-01-09 17:20:13,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:20:13,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223739943] [2025-01-09 17:20:13,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223739943] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:20:13,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 17:20:13,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 17:20:13,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997046988] [2025-01-09 17:20:13,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:20:13,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 17:20:13,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:20:13,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 17:20:13,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 17:20:13,953 INFO L87 Difference]: Start difference. First operand 91 states and 120 transitions. Second operand has 6 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2025-01-09 17:20:14,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:20:14,032 INFO L93 Difference]: Finished difference Result 101 states and 132 transitions. [2025-01-09 17:20:14,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 17:20:14,033 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) Word has length 83 [2025-01-09 17:20:14,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:20:14,037 INFO L225 Difference]: With dead ends: 101 [2025-01-09 17:20:14,037 INFO L226 Difference]: Without dead ends: 99 [2025-01-09 17:20:14,037 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 17:20:14,038 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 3 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 17:20:14,039 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 576 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 17:20:14,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-01-09 17:20:14,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2025-01-09 17:20:14,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 62 states have (on average 1.2419354838709677) internal successors, (77), 64 states have internal predecessors, (77), 25 states have call successors, (25), 9 states have call predecessors, (25), 10 states have return successors, (27), 24 states have call predecessors, (27), 24 states have call successors, (27) [2025-01-09 17:20:14,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 129 transitions. [2025-01-09 17:20:14,061 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 129 transitions. Word has length 83 [2025-01-09 17:20:14,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:20:14,061 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 129 transitions. [2025-01-09 17:20:14,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2025-01-09 17:20:14,062 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 129 transitions. [2025-01-09 17:20:14,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-01-09 17:20:14,063 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:20:14,063 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 17:20:14,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 17:20:14,064 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:20:14,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:20:14,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1653847536, now seen corresponding path program 1 times [2025-01-09 17:20:14,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:20:14,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682376825] [2025-01-09 17:20:14,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:20:14,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:20:14,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-01-09 17:20:14,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-01-09 17:20:14,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:20:14,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:20:14,596 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-01-09 17:20:14,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:20:14,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682376825] [2025-01-09 17:20:14,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682376825] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 17:20:14,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1863916580] [2025-01-09 17:20:14,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:20:14,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:20:14,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 17:20:14,601 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 17:20:14,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 17:20:14,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-01-09 17:20:14,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-01-09 17:20:14,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:20:14,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:20:14,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-09 17:20:14,830 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 17:20:15,046 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-01-09 17:20:15,047 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 17:20:15,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1863916580] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:20:15,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 17:20:15,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 18 [2025-01-09 17:20:15,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330636023] [2025-01-09 17:20:15,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:20:15,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 17:20:15,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:20:15,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 17:20:15,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2025-01-09 17:20:15,053 INFO L87 Difference]: Start difference. First operand 98 states and 129 transitions. Second operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 8 states have internal predecessors, (43), 4 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2025-01-09 17:20:15,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:20:15,429 INFO L93 Difference]: Finished difference Result 184 states and 242 transitions. [2025-01-09 17:20:15,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 17:20:15,429 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 8 states have internal predecessors, (43), 4 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) Word has length 85 [2025-01-09 17:20:15,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:20:15,431 INFO L225 Difference]: With dead ends: 184 [2025-01-09 17:20:15,431 INFO L226 Difference]: Without dead ends: 100 [2025-01-09 17:20:15,432 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=487, Unknown=0, NotChecked=0, Total=552 [2025-01-09 17:20:15,433 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 129 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 17:20:15,433 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 554 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 17:20:15,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-01-09 17:20:15,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 98. [2025-01-09 17:20:15,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 62 states have (on average 1.2258064516129032) internal successors, (76), 64 states have internal predecessors, (76), 25 states have call successors, (25), 9 states have call predecessors, (25), 10 states have return successors, (27), 24 states have call predecessors, (27), 24 states have call successors, (27) [2025-01-09 17:20:15,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 128 transitions. [2025-01-09 17:20:15,450 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 128 transitions. Word has length 85 [2025-01-09 17:20:15,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:20:15,451 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 128 transitions. [2025-01-09 17:20:15,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 8 states have internal predecessors, (43), 4 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2025-01-09 17:20:15,451 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 128 transitions. [2025-01-09 17:20:15,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-01-09 17:20:15,454 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:20:15,454 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 17:20:15,464 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 17:20:15,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:20:15,654 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:20:15,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:20:15,655 INFO L85 PathProgramCache]: Analyzing trace with hash -2010516052, now seen corresponding path program 1 times [2025-01-09 17:20:15,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:20:15,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921923030] [2025-01-09 17:20:15,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:20:15,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:20:15,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-01-09 17:20:15,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-01-09 17:20:15,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:20:15,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:20:16,136 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-01-09 17:20:16,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:20:16,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921923030] [2025-01-09 17:20:16,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921923030] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 17:20:16,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [184852824] [2025-01-09 17:20:16,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:20:16,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:20:16,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 17:20:16,139 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 17:20:16,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 17:20:16,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-01-09 17:20:16,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-01-09 17:20:16,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:20:16,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:20:16,309 INFO L256 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 17:20:16,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 17:20:16,498 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-01-09 17:20:16,498 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 17:20:16,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [184852824] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:20:16,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 17:20:16,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [12] total 20 [2025-01-09 17:20:16,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153085366] [2025-01-09 17:20:16,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:20:16,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 17:20:16,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:20:16,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 17:20:16,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=337, Unknown=0, NotChecked=0, Total=380 [2025-01-09 17:20:16,500 INFO L87 Difference]: Start difference. First operand 98 states and 128 transitions. Second operand has 10 states, 10 states have (on average 4.5) internal successors, (45), 9 states have internal predecessors, (45), 4 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2025-01-09 17:20:16,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:20:16,905 INFO L93 Difference]: Finished difference Result 190 states and 250 transitions. [2025-01-09 17:20:16,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 17:20:16,906 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.5) internal successors, (45), 9 states have internal predecessors, (45), 4 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) Word has length 87 [2025-01-09 17:20:16,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:20:16,908 INFO L225 Difference]: With dead ends: 190 [2025-01-09 17:20:16,908 INFO L226 Difference]: Without dead ends: 105 [2025-01-09 17:20:16,909 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=83, Invalid=673, Unknown=0, NotChecked=0, Total=756 [2025-01-09 17:20:16,910 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 143 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 17:20:16,910 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 616 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 17:20:16,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-01-09 17:20:16,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 99. [2025-01-09 17:20:16,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 63 states have (on average 1.2222222222222223) internal successors, (77), 65 states have internal predecessors, (77), 25 states have call successors, (25), 9 states have call predecessors, (25), 10 states have return successors, (27), 24 states have call predecessors, (27), 24 states have call successors, (27) [2025-01-09 17:20:16,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 129 transitions. [2025-01-09 17:20:16,922 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 129 transitions. Word has length 87 [2025-01-09 17:20:16,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:20:16,922 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 129 transitions. [2025-01-09 17:20:16,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.5) internal successors, (45), 9 states have internal predecessors, (45), 4 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2025-01-09 17:20:16,922 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 129 transitions. [2025-01-09 17:20:16,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-01-09 17:20:16,923 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:20:16,924 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 17:20:16,933 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 17:20:17,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:20:17,125 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:20:17,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:20:17,135 INFO L85 PathProgramCache]: Analyzing trace with hash -792085360, now seen corresponding path program 1 times [2025-01-09 17:20:17,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:20:17,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177980863] [2025-01-09 17:20:17,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:20:17,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:20:17,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-01-09 17:20:17,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-01-09 17:20:17,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:20:17,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:20:17,470 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-01-09 17:20:17,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:20:17,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177980863] [2025-01-09 17:20:17,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177980863] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:20:17,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 17:20:17,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 17:20:17,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663786366] [2025-01-09 17:20:17,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:20:17,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 17:20:17,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:20:17,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 17:20:17,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 17:20:17,472 INFO L87 Difference]: Start difference. First operand 99 states and 129 transitions. Second operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 8 states have internal predecessors, (46), 4 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2025-01-09 17:20:17,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:20:17,639 INFO L93 Difference]: Finished difference Result 191 states and 250 transitions. [2025-01-09 17:20:17,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 17:20:17,640 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 8 states have internal predecessors, (46), 4 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) Word has length 88 [2025-01-09 17:20:17,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:20:17,641 INFO L225 Difference]: With dead ends: 191 [2025-01-09 17:20:17,642 INFO L226 Difference]: Without dead ends: 105 [2025-01-09 17:20:17,642 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-01-09 17:20:17,643 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 35 mSDsluCounter, 649 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 754 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 17:20:17,643 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 754 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 17:20:17,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-01-09 17:20:17,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 100. [2025-01-09 17:20:17,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 64 states have (on average 1.21875) internal successors, (78), 66 states have internal predecessors, (78), 25 states have call successors, (25), 9 states have call predecessors, (25), 10 states have return successors, (27), 24 states have call predecessors, (27), 24 states have call successors, (27) [2025-01-09 17:20:17,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 130 transitions. [2025-01-09 17:20:17,664 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 130 transitions. Word has length 88 [2025-01-09 17:20:17,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:20:17,664 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 130 transitions. [2025-01-09 17:20:17,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 8 states have internal predecessors, (46), 4 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2025-01-09 17:20:17,664 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 130 transitions. [2025-01-09 17:20:17,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-01-09 17:20:17,666 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:20:17,666 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 17:20:17,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 17:20:17,666 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:20:17,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:20:17,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1663600590, now seen corresponding path program 1 times [2025-01-09 17:20:17,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:20:17,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542912774] [2025-01-09 17:20:17,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:20:17,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:20:17,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-01-09 17:20:17,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-01-09 17:20:17,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:20:17,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:20:18,075 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2025-01-09 17:20:18,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:20:18,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542912774] [2025-01-09 17:20:18,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542912774] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 17:20:18,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1901609981] [2025-01-09 17:20:18,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:20:18,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:20:18,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 17:20:18,079 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 17:20:18,081 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 17:20:18,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-01-09 17:20:18,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-01-09 17:20:18,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:20:18,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:20:18,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-01-09 17:20:18,262 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 17:20:18,539 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-01-09 17:20:18,539 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 17:20:18,816 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2025-01-09 17:20:18,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1901609981] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 17:20:18,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 17:20:18,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6, 14] total 21 [2025-01-09 17:20:18,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668352307] [2025-01-09 17:20:18,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:20:18,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 17:20:18,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:20:18,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 17:20:18,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=375, Unknown=0, NotChecked=0, Total=420 [2025-01-09 17:20:18,819 INFO L87 Difference]: Start difference. First operand 100 states and 130 transitions. Second operand has 7 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 17:20:18,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:20:18,886 INFO L93 Difference]: Finished difference Result 111 states and 143 transitions. [2025-01-09 17:20:18,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 17:20:18,887 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 96 [2025-01-09 17:20:18,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:20:18,888 INFO L225 Difference]: With dead ends: 111 [2025-01-09 17:20:18,888 INFO L226 Difference]: Without dead ends: 109 [2025-01-09 17:20:18,889 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=413, Unknown=0, NotChecked=0, Total=462 [2025-01-09 17:20:18,891 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 3 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 679 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 17:20:18,891 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 679 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 17:20:18,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-01-09 17:20:18,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 101. [2025-01-09 17:20:18,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 65 states have (on average 1.2153846153846153) internal successors, (79), 67 states have internal predecessors, (79), 25 states have call successors, (25), 9 states have call predecessors, (25), 10 states have return successors, (27), 24 states have call predecessors, (27), 24 states have call successors, (27) [2025-01-09 17:20:18,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 131 transitions. [2025-01-09 17:20:18,907 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 131 transitions. Word has length 96 [2025-01-09 17:20:18,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:20:18,907 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 131 transitions. [2025-01-09 17:20:18,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 17:20:18,907 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 131 transitions. [2025-01-09 17:20:18,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-01-09 17:20:18,908 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:20:18,909 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 17:20:18,918 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 17:20:19,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-01-09 17:20:19,110 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:20:19,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:20:19,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1501700942, now seen corresponding path program 1 times [2025-01-09 17:20:19,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:20:19,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584417973] [2025-01-09 17:20:19,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:20:19,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:20:19,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 17:20:19,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 17:20:19,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:20:19,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:20:19,903 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2025-01-09 17:20:19,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:20:19,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584417973] [2025-01-09 17:20:19,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584417973] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 17:20:19,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1826607319] [2025-01-09 17:20:19,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:20:19,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:20:19,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 17:20:19,907 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 17:20:19,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 17:20:20,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 17:20:20,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 17:20:20,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:20:20,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:20:20,085 INFO L256 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-01-09 17:20:20,088 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 17:20:20,248 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2025-01-09 17:20:20,248 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 17:20:20,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1826607319] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:20:20,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 17:20:20,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [12] total 20 [2025-01-09 17:20:20,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359124760] [2025-01-09 17:20:20,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:20:20,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 17:20:20,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:20:20,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 17:20:20,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=338, Unknown=0, NotChecked=0, Total=380 [2025-01-09 17:20:20,250 INFO L87 Difference]: Start difference. First operand 101 states and 131 transitions. Second operand has 10 states, 9 states have (on average 5.111111111111111) internal successors, (46), 7 states have internal predecessors, (46), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 17:20:20,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:20:20,357 INFO L93 Difference]: Finished difference Result 113 states and 145 transitions. [2025-01-09 17:20:20,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 17:20:20,357 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.111111111111111) internal successors, (46), 7 states have internal predecessors, (46), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) Word has length 98 [2025-01-09 17:20:20,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:20:20,358 INFO L225 Difference]: With dead ends: 113 [2025-01-09 17:20:20,358 INFO L226 Difference]: Without dead ends: 111 [2025-01-09 17:20:20,359 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=412, Unknown=0, NotChecked=0, Total=462 [2025-01-09 17:20:20,359 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 4 mSDsluCounter, 874 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 986 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 17:20:20,360 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 986 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 17:20:20,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-01-09 17:20:20,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 102. [2025-01-09 17:20:20,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 66 states have (on average 1.2121212121212122) internal successors, (80), 68 states have internal predecessors, (80), 25 states have call successors, (25), 9 states have call predecessors, (25), 10 states have return successors, (27), 24 states have call predecessors, (27), 24 states have call successors, (27) [2025-01-09 17:20:20,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 132 transitions. [2025-01-09 17:20:20,376 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 132 transitions. Word has length 98 [2025-01-09 17:20:20,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:20:20,376 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 132 transitions. [2025-01-09 17:20:20,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.111111111111111) internal successors, (46), 7 states have internal predecessors, (46), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 17:20:20,377 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 132 transitions. [2025-01-09 17:20:20,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-09 17:20:20,378 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:20:20,378 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 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] [2025-01-09 17:20:20,387 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 17:20:20,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:20:20,579 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:20:20,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:20:20,580 INFO L85 PathProgramCache]: Analyzing trace with hash 712459054, now seen corresponding path program 1 times [2025-01-09 17:20:20,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:20:20,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561705593] [2025-01-09 17:20:20,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:20:20,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:20:20,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 17:20:20,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 17:20:20,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:20:20,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:20:21,899 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 16 proven. 15 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2025-01-09 17:20:21,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:20:21,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561705593] [2025-01-09 17:20:21,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561705593] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 17:20:21,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [364922319] [2025-01-09 17:20:21,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:20:21,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:20:21,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 17:20:21,902 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 17:20:21,905 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 17:20:22,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 17:20:22,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 17:20:22,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:20:22,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:20:22,111 INFO L256 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 73 conjuncts are in the unsatisfiable core [2025-01-09 17:20:22,118 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 17:20:22,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2025-01-09 17:20:22,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 9 [2025-01-09 17:20:24,202 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 43 proven. 16 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-01-09 17:20:24,203 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 17:20:37,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 182 treesize of output 174 [2025-01-09 17:20:37,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 17:20:37,347 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 17:20:37,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 35 [2025-01-09 17:20:37,359 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-01-09 17:20:37,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2025-01-09 17:20:37,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-01-09 17:20:37,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-01-09 17:20:37,515 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2025-01-09 17:20:37,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [364922319] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 17:20:37,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 17:20:37,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [16, 17] total 45 [2025-01-09 17:20:37,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866672501] [2025-01-09 17:20:37,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:20:37,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-09 17:20:37,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:20:37,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-09 17:20:37,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1842, Unknown=3, NotChecked=0, Total=1980 [2025-01-09 17:20:37,519 INFO L87 Difference]: Start difference. First operand 102 states and 132 transitions. Second operand has 18 states, 15 states have (on average 3.6) internal successors, (54), 13 states have internal predecessors, (54), 8 states have call successors, (14), 3 states have call predecessors, (14), 4 states have return successors, (12), 8 states have call predecessors, (12), 7 states have call successors, (12) [2025-01-09 17:20:37,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:20:37,972 INFO L93 Difference]: Finished difference Result 186 states and 246 transitions. [2025-01-09 17:20:37,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 17:20:37,972 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 3.6) internal successors, (54), 13 states have internal predecessors, (54), 8 states have call successors, (14), 3 states have call predecessors, (14), 4 states have return successors, (12), 8 states have call predecessors, (12), 7 states have call successors, (12) Word has length 99 [2025-01-09 17:20:37,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:20:37,974 INFO L225 Difference]: With dead ends: 186 [2025-01-09 17:20:37,974 INFO L226 Difference]: Without dead ends: 103 [2025-01-09 17:20:37,975 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 161 SyntacticMatches, 8 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 405 ImplicationChecksByTransitivity, 14.4s TimeCoverageRelationStatistics Valid=145, Invalid=2014, Unknown=3, NotChecked=0, Total=2162 [2025-01-09 17:20:37,980 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 4 mSDsluCounter, 1133 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1239 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 17:20:37,981 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1239 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 17:20:37,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-01-09 17:20:37,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2025-01-09 17:20:37,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 67 states have (on average 1.208955223880597) internal successors, (81), 69 states have internal predecessors, (81), 25 states have call successors, (25), 9 states have call predecessors, (25), 10 states have return successors, (27), 24 states have call predecessors, (27), 24 states have call successors, (27) [2025-01-09 17:20:37,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 133 transitions. [2025-01-09 17:20:37,995 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 133 transitions. Word has length 99 [2025-01-09 17:20:37,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:20:37,998 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 133 transitions. [2025-01-09 17:20:37,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 3.6) internal successors, (54), 13 states have internal predecessors, (54), 8 states have call successors, (14), 3 states have call predecessors, (14), 4 states have return successors, (12), 8 states have call predecessors, (12), 7 states have call successors, (12) [2025-01-09 17:20:37,998 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 133 transitions. [2025-01-09 17:20:37,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-09 17:20:37,999 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:20:37,999 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 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] [2025-01-09 17:20:38,008 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-09 17:20:38,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-01-09 17:20:38,200 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:20:38,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:20:38,200 INFO L85 PathProgramCache]: Analyzing trace with hash 409975785, now seen corresponding path program 1 times [2025-01-09 17:20:38,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:20:38,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42744466] [2025-01-09 17:20:38,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:20:38,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:20:38,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 17:20:38,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 17:20:38,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:20:38,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:20:38,502 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2025-01-09 17:20:38,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:20:38,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42744466] [2025-01-09 17:20:38,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42744466] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 17:20:38,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [222477424] [2025-01-09 17:20:38,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:20:38,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:20:38,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 17:20:38,505 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 17:20:38,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-09 17:20:38,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 17:20:38,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 17:20:38,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:20:38,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:20:38,718 INFO L256 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 94 conjuncts are in the unsatisfiable core [2025-01-09 17:20:38,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 17:20:38,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 17:20:38,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2025-01-09 17:20:38,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 17:20:38,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 21 [2025-01-09 17:20:38,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2025-01-09 17:20:38,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 17:20:38,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2025-01-09 17:20:42,919 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_27| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_27|) (<= (+ 2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_27|) 24)) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_27|))) is different from true [2025-01-09 17:20:46,986 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_28| Int)) (and (<= (+ 2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_28|) 24)) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_28|) (<= 2 |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_28|))) is different from true [2025-01-09 17:20:51,072 WARN L873 $PredicateComparison]: unable to prove that (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_21 Int)) (and (<= 2 v_aws_linked_list_back_~list.base_BEFORE_CALL_21) (<= (+ (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_21) 24) 2) v_aws_linked_list_back_~list.base_BEFORE_CALL_21))) is different from true [2025-01-09 17:20:55,157 WARN L873 $PredicateComparison]: unable to prove that (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_22 Int)) (and (<= (+ (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_22) 24) 2) v_aws_linked_list_back_~list.base_BEFORE_CALL_22) (<= 2 v_aws_linked_list_back_~list.base_BEFORE_CALL_22))) is different from true [2025-01-09 17:20:59,205 WARN L873 $PredicateComparison]: unable to prove that (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_23 Int)) (and (<= (+ 2 (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_23) 24)) v_aws_linked_list_back_~list.base_BEFORE_CALL_23) (<= 2 v_aws_linked_list_back_~list.base_BEFORE_CALL_23))) is different from true [2025-01-09 17:21:07,384 WARN L873 $PredicateComparison]: unable to prove that (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_24 Int)) (and (<= 2 v_aws_linked_list_back_~list.base_BEFORE_CALL_24) (<= (+ (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_24) 24) 2) v_aws_linked_list_back_~list.base_BEFORE_CALL_24))) is different from true [2025-01-09 17:21:11,442 WARN L873 $PredicateComparison]: unable to prove that (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_25 Int)) (and (<= (+ (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_25) 24) 2) v_aws_linked_list_back_~list.base_BEFORE_CALL_25) (<= 2 v_aws_linked_list_back_~list.base_BEFORE_CALL_25))) is different from true [2025-01-09 17:21:40,198 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 73 not checked. [2025-01-09 17:21:40,198 INFO L312 TraceCheckSpWp]: Computing backward predicates...