./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-pthread/cs_fib_longer-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc 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/seq-pthread/cs_fib_longer-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-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 32bit --witnessprinter.graph.data.programhash f6c9b52ffa673147438276e1d7b786b060eda002f60ced6e1594740d0a0004b3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 16:51:52,642 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 16:51:52,707 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 16:51:52,715 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 16:51:52,716 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 16:51:52,738 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 16:51:52,740 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 16:51:52,741 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 16:51:52,741 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 16:51:52,741 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 16:51:52,742 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 16:51:52,742 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 16:51:52,743 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 16:51:52,743 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 16:51:52,743 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 16:51:52,743 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 16:51:52,743 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 16:51:52,743 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 16:51:52,743 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 16:51:52,744 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 16:51:52,744 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 16:51:52,744 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 16:51:52,744 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 16:51:52,744 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 16:51:52,744 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 16:51:52,744 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 16:51:52,744 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 16:51:52,745 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 16:51:52,745 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 16:51:52,745 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 16:51:52,745 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 16:51:52,745 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 16:51:52,745 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:51:52,745 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 16:51:52,745 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 16:51:52,746 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 16:51:52,746 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 16:51:52,746 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 16:51:52,746 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 16:51:52,746 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 16:51:52,746 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 16:51:52,746 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 16:51:52,746 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 16:51:52,746 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f6c9b52ffa673147438276e1d7b786b060eda002f60ced6e1594740d0a0004b3 [2025-02-05 16:51:53,016 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 16:51:53,024 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 16:51:53,026 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 16:51:53,026 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 16:51:53,026 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 16:51:53,027 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-pthread/cs_fib_longer-1.i [2025-02-05 16:51:54,321 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/90c6166eb/1151e43dd1644b50901b7dcea0267926/FLAGb89bbbc21 [2025-02-05 16:51:54,631 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 16:51:54,631 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_fib_longer-1.i [2025-02-05 16:51:54,649 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/90c6166eb/1151e43dd1644b50901b7dcea0267926/FLAGb89bbbc21 [2025-02-05 16:51:54,661 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/90c6166eb/1151e43dd1644b50901b7dcea0267926 [2025-02-05 16:51:54,664 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 16:51:54,665 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 16:51:54,668 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 16:51:54,668 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 16:51:54,671 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 16:51:54,672 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:51:54" (1/1) ... [2025-02-05 16:51:54,674 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52544afc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:51:54, skipping insertion in model container [2025-02-05 16:51:54,675 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:51:54" (1/1) ... [2025-02-05 16:51:54,707 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 16:51:54,995 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/seq-pthread/cs_fib_longer-1.i[23609,23622] [2025-02-05 16:51:55,134 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:51:55,153 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 16:51:55,181 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/seq-pthread/cs_fib_longer-1.i[23609,23622] [2025-02-05 16:51:55,268 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:51:55,298 INFO L204 MainTranslator]: Completed translation [2025-02-05 16:51:55,299 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:51:55 WrapperNode [2025-02-05 16:51:55,299 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 16:51:55,300 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 16:51:55,300 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 16:51:55,300 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 16:51:55,304 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:51:55" (1/1) ... [2025-02-05 16:51:55,323 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:51:55" (1/1) ... [2025-02-05 16:51:55,380 INFO L138 Inliner]: procedures = 145, calls = 446, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 777 [2025-02-05 16:51:55,381 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 16:51:55,382 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 16:51:55,383 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 16:51:55,383 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 16:51:55,390 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:51:55" (1/1) ... [2025-02-05 16:51:55,391 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:51:55" (1/1) ... [2025-02-05 16:51:55,402 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:51:55" (1/1) ... [2025-02-05 16:51:55,451 INFO L175 MemorySlicer]: Split 310 memory accesses to 15 slices as follows [2, 8, 8, 8, 62, 57, 25, 13, 25, 11, 37, 37, 0, 4, 13]. 20 percent of accesses are in the largest equivalence class. The 76 initializations are split as follows [2, 3, 3, 3, 21, 21, 7, 0, 7, 7, 0, 0, 0, 2, 0]. The 71 writes are split as follows [0, 2, 2, 2, 23, 18, 8, 1, 8, 2, 1, 1, 0, 2, 1]. [2025-02-05 16:51:55,452 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:51:55" (1/1) ... [2025-02-05 16:51:55,452 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:51:55" (1/1) ... [2025-02-05 16:51:55,494 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:51:55" (1/1) ... [2025-02-05 16:51:55,502 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:51:55" (1/1) ... [2025-02-05 16:51:55,511 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:51:55" (1/1) ... [2025-02-05 16:51:55,515 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:51:55" (1/1) ... [2025-02-05 16:51:55,532 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 16:51:55,533 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 16:51:55,533 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 16:51:55,533 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 16:51:55,535 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:51:55" (1/1) ... [2025-02-05 16:51:55,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:51:55,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:51:55,561 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 16:51:55,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 16:51:55,586 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-05 16:51:55,586 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-05 16:51:55,586 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-05 16:51:55,586 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-05 16:51:55,587 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-05 16:51:55,587 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-05 16:51:55,587 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-02-05 16:51:55,587 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-02-05 16:51:55,587 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-02-05 16:51:55,587 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-02-05 16:51:55,588 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-02-05 16:51:55,588 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-02-05 16:51:55,588 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-02-05 16:51:55,588 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-02-05 16:51:55,588 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-02-05 16:51:55,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-05 16:51:55,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-05 16:51:55,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-05 16:51:55,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-05 16:51:55,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-05 16:51:55,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-05 16:51:55,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-02-05 16:51:55,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-02-05 16:51:55,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-02-05 16:51:55,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-02-05 16:51:55,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-02-05 16:51:55,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-02-05 16:51:55,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-02-05 16:51:55,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-02-05 16:51:55,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-02-05 16:51:55,591 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 16:51:55,591 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 16:51:55,592 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 16:51:55,592 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-05 16:51:55,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-05 16:51:55,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-05 16:51:55,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-05 16:51:55,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-02-05 16:51:55,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-02-05 16:51:55,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-02-05 16:51:55,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-02-05 16:51:55,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-02-05 16:51:55,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-02-05 16:51:55,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-02-05 16:51:55,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-02-05 16:51:55,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-02-05 16:51:55,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-02-05 16:51:55,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-02-05 16:51:55,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-02-05 16:51:55,593 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2025-02-05 16:51:55,593 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2025-02-05 16:51:55,593 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-05 16:51:55,593 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-05 16:51:55,593 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-05 16:51:55,593 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-02-05 16:51:55,593 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-02-05 16:51:55,593 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-02-05 16:51:55,593 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-02-05 16:51:55,593 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-02-05 16:51:55,593 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-02-05 16:51:55,593 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-02-05 16:51:55,593 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-02-05 16:51:55,594 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-02-05 16:51:55,594 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-02-05 16:51:55,594 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-02-05 16:51:55,594 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-02-05 16:51:55,594 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-02-05 16:51:55,594 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-02-05 16:51:55,594 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-05 16:51:55,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-05 16:51:55,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-05 16:51:55,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-05 16:51:55,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-02-05 16:51:55,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-02-05 16:51:55,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-02-05 16:51:55,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-02-05 16:51:55,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-02-05 16:51:55,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-02-05 16:51:55,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-02-05 16:51:55,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-02-05 16:51:55,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-02-05 16:51:55,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-02-05 16:51:55,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-02-05 16:51:55,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-02-05 16:51:55,597 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2025-02-05 16:51:55,597 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2025-02-05 16:51:55,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 16:51:55,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-05 16:51:55,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-05 16:51:55,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-05 16:51:55,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-05 16:51:55,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-05 16:51:55,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-02-05 16:51:55,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-02-05 16:51:55,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-02-05 16:51:55,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-02-05 16:51:55,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-02-05 16:51:55,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-02-05 16:51:55,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-02-05 16:51:55,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-02-05 16:51:55,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-02-05 16:51:55,599 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 16:51:55,599 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 16:51:55,854 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 16:51:55,856 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 16:51:56,189 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L734-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset);havoc main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset);havoc main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset; [2025-02-05 16:51:56,189 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L734-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-02-05 16:51:56,189 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L734-2: SUMMARY for call __CS_cs(); srcloc: null [2025-02-05 16:51:56,189 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L730-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset);havoc main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset);havoc main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset; [2025-02-05 16:51:56,189 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L730-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-02-05 16:51:56,189 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L730-2: SUMMARY for call __CS_cs(); srcloc: null [2025-02-05 16:51:56,189 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L732-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset);havoc main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset);havoc main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset; [2025-02-05 16:51:56,189 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L732-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-02-05 16:51:56,189 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L732-2: SUMMARY for call __CS_cs(); srcloc: null [2025-02-05 16:52:00,713 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2025-02-05 16:52:00,714 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 16:52:00,727 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 16:52:00,727 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 16:52:00,728 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:52:00 BoogieIcfgContainer [2025-02-05 16:52:00,728 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 16:52:00,730 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 16:52:00,730 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 16:52:00,734 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 16:52:00,735 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 04:51:54" (1/3) ... [2025-02-05 16:52:00,735 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fa286fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:52:00, skipping insertion in model container [2025-02-05 16:52:00,735 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:51:55" (2/3) ... [2025-02-05 16:52:00,735 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fa286fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:52:00, skipping insertion in model container [2025-02-05 16:52:00,736 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:52:00" (3/3) ... [2025-02-05 16:52:00,737 INFO L128 eAbstractionObserver]: Analyzing ICFG cs_fib_longer-1.i [2025-02-05 16:52:00,750 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 16:52:00,753 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG cs_fib_longer-1.i that has 5 procedures, 183 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2025-02-05 16:52:00,815 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 16:52:00,827 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;@7c372a3b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 16:52:00,829 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 16:52:00,833 INFO L276 IsEmpty]: Start isEmpty. Operand has 183 states, 110 states have (on average 1.3) internal successors, (143), 111 states have internal predecessors, (143), 67 states have call successors, (67), 4 states have call predecessors, (67), 4 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) [2025-02-05 16:52:00,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2025-02-05 16:52:00,857 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:52:00,858 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:52:00,859 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:52:00,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:52:00,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1357281778, now seen corresponding path program 1 times [2025-02-05 16:52:00,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:52:00,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720569051] [2025-02-05 16:52:00,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:52:00,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:52:01,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 299 statements into 1 equivalence classes. [2025-02-05 16:52:01,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 299 of 299 statements. [2025-02-05 16:52:01,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:52:01,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:52:02,238 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-02-05 16:52:02,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:52:02,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720569051] [2025-02-05 16:52:02,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720569051] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:52:02,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:52:02,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:52:02,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846697723] [2025-02-05 16:52:02,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:52:02,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:52:02,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:52:02,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:52:02,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:52:02,273 INFO L87 Difference]: Start difference. First operand has 183 states, 110 states have (on average 1.3) internal successors, (143), 111 states have internal predecessors, (143), 67 states have call successors, (67), 4 states have call predecessors, (67), 4 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-02-05 16:52:06,324 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 16:52:06,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:52:06,408 INFO L93 Difference]: Finished difference Result 364 states and 617 transitions. [2025-02-05 16:52:06,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:52:06,410 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 299 [2025-02-05 16:52:06,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:52:06,421 INFO L225 Difference]: With dead ends: 364 [2025-02-05 16:52:06,421 INFO L226 Difference]: Without dead ends: 181 [2025-02-05 16:52:06,427 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:52:06,429 INFO L435 NwaCegarLoop]: 272 mSDtfsCounter, 2 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:52:06,430 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 541 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-02-05 16:52:06,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2025-02-05 16:52:06,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 180. [2025-02-05 16:52:06,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 108 states have (on average 1.2777777777777777) internal successors, (138), 108 states have internal predecessors, (138), 67 states have call successors, (67), 4 states have call predecessors, (67), 4 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) [2025-02-05 16:52:06,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 272 transitions. [2025-02-05 16:52:06,506 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 272 transitions. Word has length 299 [2025-02-05 16:52:06,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:52:06,507 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 272 transitions. [2025-02-05 16:52:06,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-02-05 16:52:06,508 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 272 transitions. [2025-02-05 16:52:06,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2025-02-05 16:52:06,518 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:52:06,518 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:52:06,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 16:52:06,519 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:52:06,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:52:06,520 INFO L85 PathProgramCache]: Analyzing trace with hash 869342340, now seen corresponding path program 1 times [2025-02-05 16:52:06,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:52:06,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407402855] [2025-02-05 16:52:06,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:52:06,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:52:06,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 301 statements into 1 equivalence classes. [2025-02-05 16:52:06,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 301 of 301 statements. [2025-02-05 16:52:06,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:52:06,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:52:07,237 INFO L134 CoverageAnalysis]: Checked inductivity of 4513 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-02-05 16:52:07,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:52:07,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407402855] [2025-02-05 16:52:07,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407402855] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:52:07,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:52:07,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:52:07,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230459391] [2025-02-05 16:52:07,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:52:07,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:52:07,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:52:07,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:52:07,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:52:07,244 INFO L87 Difference]: Start difference. First operand 180 states and 272 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-02-05 16:52:07,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:52:07,299 INFO L93 Difference]: Finished difference Result 358 states and 543 transitions. [2025-02-05 16:52:07,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:52:07,300 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 301 [2025-02-05 16:52:07,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:52:07,303 INFO L225 Difference]: With dead ends: 358 [2025-02-05 16:52:07,303 INFO L226 Difference]: Without dead ends: 181 [2025-02-05 16:52:07,304 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:52:07,304 INFO L435 NwaCegarLoop]: 270 mSDtfsCounter, 0 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:52:07,305 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 537 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:52:07,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2025-02-05 16:52:07,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2025-02-05 16:52:07,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 109 states have (on average 1.275229357798165) internal successors, (139), 109 states have internal predecessors, (139), 67 states have call successors, (67), 4 states have call predecessors, (67), 4 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) [2025-02-05 16:52:07,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 273 transitions. [2025-02-05 16:52:07,333 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 273 transitions. Word has length 301 [2025-02-05 16:52:07,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:52:07,334 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 273 transitions. [2025-02-05 16:52:07,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-02-05 16:52:07,335 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 273 transitions. [2025-02-05 16:52:07,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2025-02-05 16:52:07,341 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:52:07,341 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:52:07,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 16:52:07,341 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:52:07,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:52:07,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1488025653, now seen corresponding path program 1 times [2025-02-05 16:52:07,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:52:07,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108615041] [2025-02-05 16:52:07,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:52:07,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:52:07,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 302 statements into 1 equivalence classes. [2025-02-05 16:52:07,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 302 of 302 statements. [2025-02-05 16:52:07,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:52:07,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:52:07,987 INFO L134 CoverageAnalysis]: Checked inductivity of 4514 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-02-05 16:52:07,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:52:07,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108615041] [2025-02-05 16:52:07,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108615041] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:52:07,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1336597341] [2025-02-05 16:52:07,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:52:07,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:52:07,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:52:07,993 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:52:07,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 16:52:08,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 302 statements into 1 equivalence classes. [2025-02-05 16:52:08,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 302 of 302 statements. [2025-02-05 16:52:08,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:52:08,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:52:08,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 1623 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 16:52:08,823 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:52:08,892 INFO L134 CoverageAnalysis]: Checked inductivity of 4514 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-02-05 16:52:08,896 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:52:09,277 INFO L134 CoverageAnalysis]: Checked inductivity of 4514 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-02-05 16:52:09,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1336597341] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:52:09,277 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:52:09,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-02-05 16:52:09,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190726440] [2025-02-05 16:52:09,278 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:52:09,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:52:09,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:52:09,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:52:09,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:52:09,280 INFO L87 Difference]: Start difference. First operand 181 states and 273 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 1 states have call successors, (96), 2 states have call predecessors, (96), 2 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) [2025-02-05 16:52:09,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:52:09,331 INFO L93 Difference]: Finished difference Result 361 states and 547 transitions. [2025-02-05 16:52:09,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:52:09,332 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 1 states have call successors, (96), 2 states have call predecessors, (96), 2 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) Word has length 302 [2025-02-05 16:52:09,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:52:09,334 INFO L225 Difference]: With dead ends: 361 [2025-02-05 16:52:09,334 INFO L226 Difference]: Without dead ends: 183 [2025-02-05 16:52:09,335 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 606 GetRequests, 601 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:52:09,335 INFO L435 NwaCegarLoop]: 270 mSDtfsCounter, 0 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 804 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:52:09,336 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 804 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:52:09,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2025-02-05 16:52:09,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2025-02-05 16:52:09,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 111 states have (on average 1.2702702702702702) internal successors, (141), 111 states have internal predecessors, (141), 67 states have call successors, (67), 4 states have call predecessors, (67), 4 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) [2025-02-05 16:52:09,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 275 transitions. [2025-02-05 16:52:09,361 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 275 transitions. Word has length 302 [2025-02-05 16:52:09,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:52:09,362 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 275 transitions. [2025-02-05 16:52:09,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 1 states have call successors, (96), 2 states have call predecessors, (96), 2 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) [2025-02-05 16:52:09,362 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 275 transitions. [2025-02-05 16:52:09,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2025-02-05 16:52:09,369 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:52:09,370 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:52:09,384 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 16:52:09,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:52:09,571 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:52:09,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:52:09,572 INFO L85 PathProgramCache]: Analyzing trace with hash 760101611, now seen corresponding path program 2 times [2025-02-05 16:52:09,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:52:09,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124779440] [2025-02-05 16:52:09,573 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 16:52:09,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:52:09,860 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 304 statements into 2 equivalence classes. [2025-02-05 16:52:09,891 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 304 statements. [2025-02-05 16:52:09,891 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-05 16:52:09,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:52:10,244 INFO L134 CoverageAnalysis]: Checked inductivity of 4519 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4519 trivial. 0 not checked. [2025-02-05 16:52:10,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:52:10,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124779440] [2025-02-05 16:52:10,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124779440] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:52:10,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:52:10,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:52:10,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646228897] [2025-02-05 16:52:10,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:52:10,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:52:10,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:52:10,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:52:10,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:52:10,247 INFO L87 Difference]: Start difference. First operand 183 states and 275 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-02-05 16:52:10,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:52:10,324 INFO L93 Difference]: Finished difference Result 356 states and 539 transitions. [2025-02-05 16:52:10,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:52:10,325 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 304 [2025-02-05 16:52:10,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:52:10,331 INFO L225 Difference]: With dead ends: 356 [2025-02-05 16:52:10,331 INFO L226 Difference]: Without dead ends: 254 [2025-02-05 16:52:10,332 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:52:10,333 INFO L435 NwaCegarLoop]: 270 mSDtfsCounter, 161 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 799 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:52:10,333 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 799 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:52:10,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2025-02-05 16:52:10,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 253. [2025-02-05 16:52:10,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 159 states have (on average 1.3459119496855345) internal successors, (214), 159 states have internal predecessors, (214), 85 states have call successors, (85), 8 states have call predecessors, (85), 8 states have return successors, (87), 85 states have call predecessors, (87), 85 states have call successors, (87) [2025-02-05 16:52:10,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 386 transitions. [2025-02-05 16:52:10,383 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 386 transitions. Word has length 304 [2025-02-05 16:52:10,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:52:10,384 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 386 transitions. [2025-02-05 16:52:10,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-02-05 16:52:10,384 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 386 transitions. [2025-02-05 16:52:10,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2025-02-05 16:52:10,393 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:52:10,394 INFO L218 NwaCegarLoop]: trace histogram [52, 52, 52, 4, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:52:10,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 16:52:10,394 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:52:10,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:52:10,395 INFO L85 PathProgramCache]: Analyzing trace with hash -380446461, now seen corresponding path program 1 times [2025-02-05 16:52:10,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:52:10,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234505337] [2025-02-05 16:52:10,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:52:10,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:52:10,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 372 statements into 1 equivalence classes. [2025-02-05 16:52:10,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 372 of 372 statements. [2025-02-05 16:52:10,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:52:10,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:52:11,056 INFO L134 CoverageAnalysis]: Checked inductivity of 5345 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5344 trivial. 0 not checked. [2025-02-05 16:52:11,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:52:11,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234505337] [2025-02-05 16:52:11,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234505337] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:52:11,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [482353260] [2025-02-05 16:52:11,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:52:11,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:52:11,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:52:11,059 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:52:11,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 16:52:11,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 372 statements into 1 equivalence classes. [2025-02-05 16:52:11,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 372 of 372 statements. [2025-02-05 16:52:11,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:52:11,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:52:11,976 INFO L256 TraceCheckSpWp]: Trace formula consists of 2141 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 16:52:11,985 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:52:12,046 INFO L134 CoverageAnalysis]: Checked inductivity of 5345 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5344 trivial. 0 not checked. [2025-02-05 16:52:12,050 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:52:12,496 INFO L134 CoverageAnalysis]: Checked inductivity of 5345 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5344 trivial. 0 not checked. [2025-02-05 16:52:12,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [482353260] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:52:12,496 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:52:12,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-05 16:52:12,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000516867] [2025-02-05 16:52:12,497 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:52:12,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 16:52:12,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:52:12,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 16:52:12,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:52:12,501 INFO L87 Difference]: Start difference. First operand 253 states and 386 transitions. Second operand has 7 states, 7 states have (on average 17.0) internal successors, (119), 7 states have internal predecessors, (119), 2 states have call successors, (112), 2 states have call predecessors, (112), 2 states have return successors, (112), 2 states have call predecessors, (112), 2 states have call successors, (112) [2025-02-05 16:52:16,566 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 16:52:20,583 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 16:52:24,592 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 16:52:28,625 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 16:52:32,661 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 16:52:32,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:52:32,701 INFO L93 Difference]: Finished difference Result 513 states and 783 transitions. [2025-02-05 16:52:32,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:52:32,702 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.0) internal successors, (119), 7 states have internal predecessors, (119), 2 states have call successors, (112), 2 states have call predecessors, (112), 2 states have return successors, (112), 2 states have call predecessors, (112), 2 states have call successors, (112) Word has length 372 [2025-02-05 16:52:32,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:52:32,705 INFO L225 Difference]: With dead ends: 513 [2025-02-05 16:52:32,705 INFO L226 Difference]: Without dead ends: 268 [2025-02-05 16:52:32,710 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 746 GetRequests, 741 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:52:32,711 INFO L435 NwaCegarLoop]: 268 mSDtfsCounter, 4 mSDsluCounter, 798 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1066 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:52:32,712 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1066 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 5 Unknown, 0 Unchecked, 20.2s Time] [2025-02-05 16:52:32,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2025-02-05 16:52:32,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2025-02-05 16:52:32,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 174 states have (on average 1.3333333333333333) internal successors, (232), 174 states have internal predecessors, (232), 85 states have call successors, (85), 8 states have call predecessors, (85), 8 states have return successors, (87), 85 states have call predecessors, (87), 85 states have call successors, (87) [2025-02-05 16:52:32,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 404 transitions. [2025-02-05 16:52:32,739 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 404 transitions. Word has length 372 [2025-02-05 16:52:32,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:52:32,739 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 404 transitions. [2025-02-05 16:52:32,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.0) internal successors, (119), 7 states have internal predecessors, (119), 2 states have call successors, (112), 2 states have call predecessors, (112), 2 states have return successors, (112), 2 states have call predecessors, (112), 2 states have call successors, (112) [2025-02-05 16:52:32,740 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 404 transitions. [2025-02-05 16:52:32,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2025-02-05 16:52:32,747 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:52:32,748 INFO L218 NwaCegarLoop]: trace histogram [52, 52, 52, 12, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:52:32,762 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 16:52:32,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:52:32,949 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:52:32,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:52:32,949 INFO L85 PathProgramCache]: Analyzing trace with hash 2113397658, now seen corresponding path program 2 times [2025-02-05 16:52:32,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:52:32,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055844459] [2025-02-05 16:52:32,949 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 16:52:32,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:52:33,244 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 387 statements into 2 equivalence classes. [2025-02-05 16:52:33,273 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 21 of 387 statements. [2025-02-05 16:52:33,275 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-05 16:52:33,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:52:33,651 INFO L134 CoverageAnalysis]: Checked inductivity of 5468 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5468 trivial. 0 not checked. [2025-02-05 16:52:33,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:52:33,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055844459] [2025-02-05 16:52:33,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055844459] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:52:33,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:52:33,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:52:33,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024846781] [2025-02-05 16:52:33,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:52:33,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:52:33,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:52:33,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:52:33,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:52:33,655 INFO L87 Difference]: Start difference. First operand 268 states and 404 transitions. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 2 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 2 states have call predecessors, (56), 2 states have call successors, (56) [2025-02-05 16:52:37,703 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 16:52:41,722 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 16:52:41,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:52:41,921 INFO L93 Difference]: Finished difference Result 732 states and 1120 transitions. [2025-02-05 16:52:41,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:52:41,922 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 2 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 2 states have call predecessors, (56), 2 states have call successors, (56) Word has length 387 [2025-02-05 16:52:41,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:52:41,928 INFO L225 Difference]: With dead ends: 732 [2025-02-05 16:52:41,930 INFO L226 Difference]: Without dead ends: 503 [2025-02-05 16:52:41,932 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:52:41,933 INFO L435 NwaCegarLoop]: 437 mSDtfsCounter, 255 mSDsluCounter, 691 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 1128 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:52:41,934 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 1128 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 2 Unknown, 0 Unchecked, 8.2s Time] [2025-02-05 16:52:41,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2025-02-05 16:52:41,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 499. [2025-02-05 16:52:41,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 315 states have (on average 1.3365079365079364) internal successors, (421), 315 states have internal predecessors, (421), 167 states have call successors, (167), 16 states have call predecessors, (167), 16 states have return successors, (178), 167 states have call predecessors, (178), 167 states have call successors, (178) [2025-02-05 16:52:41,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 766 transitions. [2025-02-05 16:52:41,988 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 766 transitions. Word has length 387 [2025-02-05 16:52:41,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:52:41,989 INFO L471 AbstractCegarLoop]: Abstraction has 499 states and 766 transitions. [2025-02-05 16:52:41,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 2 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 2 states have call predecessors, (56), 2 states have call successors, (56) [2025-02-05 16:52:41,989 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 766 transitions. [2025-02-05 16:52:41,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2025-02-05 16:52:41,995 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:52:41,996 INFO L218 NwaCegarLoop]: trace histogram [52, 52, 52, 12, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:52:41,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 16:52:41,996 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:52:41,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:52:41,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1324957946, now seen corresponding path program 1 times [2025-02-05 16:52:41,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:52:41,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086539834] [2025-02-05 16:52:41,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:52:41,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:52:42,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 387 statements into 1 equivalence classes. [2025-02-05 16:52:42,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 387 of 387 statements. [2025-02-05 16:52:42,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:52:42,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:52:43,549 INFO L134 CoverageAnalysis]: Checked inductivity of 5468 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5468 trivial. 0 not checked. [2025-02-05 16:52:43,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:52:43,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086539834] [2025-02-05 16:52:43,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086539834] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:52:43,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:52:43,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:52:43,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540056873] [2025-02-05 16:52:43,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:52:43,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:52:43,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:52:43,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:52:43,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:52:43,552 INFO L87 Difference]: Start difference. First operand 499 states and 766 transitions. Second operand has 5 states, 4 states have (on average 21.75) internal successors, (87), 5 states have internal predecessors, (87), 4 states have call successors, (56), 1 states have call predecessors, (56), 2 states have return successors, (56), 3 states have call predecessors, (56), 4 states have call successors, (56) [2025-02-05 16:52:47,574 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 16:52:51,587 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 16:52:55,610 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 16:52:55,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:52:55,903 INFO L93 Difference]: Finished difference Result 852 states and 1288 transitions. [2025-02-05 16:52:55,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:52:55,904 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.75) internal successors, (87), 5 states have internal predecessors, (87), 4 states have call successors, (56), 1 states have call predecessors, (56), 2 states have return successors, (56), 3 states have call predecessors, (56), 4 states have call successors, (56) Word has length 387 [2025-02-05 16:52:55,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:52:55,909 INFO L225 Difference]: With dead ends: 852 [2025-02-05 16:52:55,909 INFO L226 Difference]: Without dead ends: 456 [2025-02-05 16:52:55,911 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:52:55,912 INFO L435 NwaCegarLoop]: 435 mSDtfsCounter, 259 mSDsluCounter, 1080 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 10 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 1515 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:52:55,912 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 1515 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 51 Invalid, 3 Unknown, 0 Unchecked, 12.3s Time] [2025-02-05 16:52:55,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2025-02-05 16:52:55,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 452. [2025-02-05 16:52:55,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 284 states have (on average 1.2640845070422535) internal successors, (359), 286 states have internal predecessors, (359), 150 states have call successors, (150), 15 states have call predecessors, (150), 17 states have return successors, (158), 150 states have call predecessors, (158), 150 states have call successors, (158) [2025-02-05 16:52:55,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 667 transitions. [2025-02-05 16:52:55,963 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 667 transitions. Word has length 387 [2025-02-05 16:52:55,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:52:55,963 INFO L471 AbstractCegarLoop]: Abstraction has 452 states and 667 transitions. [2025-02-05 16:52:55,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.75) internal successors, (87), 5 states have internal predecessors, (87), 4 states have call successors, (56), 1 states have call predecessors, (56), 2 states have return successors, (56), 3 states have call predecessors, (56), 4 states have call successors, (56) [2025-02-05 16:52:55,964 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 667 transitions. [2025-02-05 16:52:55,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2025-02-05 16:52:55,969 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:52:55,970 INFO L218 NwaCegarLoop]: trace histogram [52, 52, 52, 12, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:52:55,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 16:52:55,970 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:52:55,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:52:55,971 INFO L85 PathProgramCache]: Analyzing trace with hash 2109681465, now seen corresponding path program 1 times [2025-02-05 16:52:55,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:52:55,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168365384] [2025-02-05 16:52:55,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:52:55,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:52:56,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 387 statements into 1 equivalence classes. [2025-02-05 16:52:56,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 387 of 387 statements. [2025-02-05 16:52:56,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:52:56,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:52:56,891 INFO L134 CoverageAnalysis]: Checked inductivity of 5468 backedges. 0 proven. 106 refuted. 0 times theorem prover too weak. 5362 trivial. 0 not checked. [2025-02-05 16:52:56,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:52:56,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168365384] [2025-02-05 16:52:56,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168365384] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:52:56,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1030948844] [2025-02-05 16:52:56,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:52:56,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:52:56,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:52:56,899 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:52:56,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 16:52:57,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 387 statements into 1 equivalence classes. [2025-02-05 16:52:57,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 387 of 387 statements. [2025-02-05 16:52:57,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:52:57,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:52:57,912 INFO L256 TraceCheckSpWp]: Trace formula consists of 2475 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 16:52:57,919 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:52:57,996 INFO L134 CoverageAnalysis]: Checked inductivity of 5468 backedges. 0 proven. 106 refuted. 0 times theorem prover too weak. 5362 trivial. 0 not checked. [2025-02-05 16:52:57,996 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:52:58,595 INFO L134 CoverageAnalysis]: Checked inductivity of 5468 backedges. 0 proven. 106 refuted. 0 times theorem prover too weak. 5362 trivial. 0 not checked. [2025-02-05 16:52:58,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1030948844] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:52:58,596 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:52:58,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2025-02-05 16:52:58,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787227836] [2025-02-05 16:52:58,596 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:52:58,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 16:52:58,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:52:58,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 16:52:58,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2025-02-05 16:52:58,600 INFO L87 Difference]: Start difference. First operand 452 states and 667 transitions. Second operand has 10 states, 10 states have (on average 13.1) internal successors, (131), 10 states have internal predecessors, (131), 2 states have call successors, (112), 2 states have call predecessors, (112), 2 states have return successors, (112), 2 states have call predecessors, (112), 2 states have call successors, (112) [2025-02-05 16:53:02,699 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 16:53:06,746 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 16:53:10,771 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 16:53:14,828 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 16:53:18,858 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 16:53:22,880 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 16:53:26,890 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []