./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-pthread/cs_fib_longer-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-pthread/cs_fib_longer-2.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 583ab92a7056287b3071cc8588dd414024160b1da2815b90013f83f6f32564a1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 05:00:49,518 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 05:00:49,577 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 05:00:49,584 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 05:00:49,585 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 05:00:49,609 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 05:00:49,610 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 05:00:49,610 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 05:00:49,610 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 05:00:49,611 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 05:00:49,611 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 05:00:49,611 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 05:00:49,611 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 05:00:49,612 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 05:00:49,612 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 05:00:49,612 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 05:00:49,612 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 05:00:49,612 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 05:00:49,612 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 05:00:49,612 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 05:00:49,612 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 05:00:49,612 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 05:00:49,612 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 05:00:49,612 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 05:00:49,612 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 05:00:49,613 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 05:00:49,613 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 05:00:49,613 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 05:00:49,613 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 05:00:49,613 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:00:49,613 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:00:49,613 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:00:49,613 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:00:49,613 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 05:00:49,613 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:00:49,613 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:00:49,614 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:00:49,614 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:00:49,614 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 05:00:49,614 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 05:00:49,614 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 05:00:49,614 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 05:00:49,614 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 05:00:49,614 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 05:00:49,614 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 05:00:49,614 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 05:00:49,614 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 05:00:49,614 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 05:00:49,614 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 -> 583ab92a7056287b3071cc8588dd414024160b1da2815b90013f83f6f32564a1 [2025-01-09 05:00:49,817 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 05:00:49,823 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 05:00:49,825 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 05:00:49,826 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 05:00:49,826 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 05:00:49,827 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-2.i [2025-01-09 05:00:51,087 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f201edf3e/198768d36bf3417ab0fa5aab99a3e213/FLAG955f51741 [2025-01-09 05:00:51,535 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 05:00:51,535 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_fib_longer-2.i [2025-01-09 05:00:51,547 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f201edf3e/198768d36bf3417ab0fa5aab99a3e213/FLAG955f51741 [2025-01-09 05:00:51,682 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f201edf3e/198768d36bf3417ab0fa5aab99a3e213 [2025-01-09 05:00:51,685 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 05:00:51,686 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 05:00:51,688 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 05:00:51,688 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 05:00:51,691 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 05:00:51,693 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:00:51" (1/1) ... [2025-01-09 05:00:51,694 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@709691d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:00:51, skipping insertion in model container [2025-01-09 05:00:51,694 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:00:51" (1/1) ... [2025-01-09 05:00:51,733 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 05:00:51,994 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-2.i[23464,23477] [2025-01-09 05:00:52,077 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:00:52,093 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 05:00:52,130 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-2.i[23464,23477] [2025-01-09 05:00:52,212 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:00:52,247 INFO L204 MainTranslator]: Completed translation [2025-01-09 05:00:52,249 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:00:52 WrapperNode [2025-01-09 05:00:52,249 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 05:00:52,250 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 05:00:52,250 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 05:00:52,250 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 05:00:52,256 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:00:52" (1/1) ... [2025-01-09 05:00:52,279 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:00:52" (1/1) ... [2025-01-09 05:00:52,329 INFO L138 Inliner]: procedures = 145, calls = 444, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 768 [2025-01-09 05:00:52,334 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 05:00:52,334 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 05:00:52,334 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 05:00:52,334 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 05:00:52,344 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:00:52" (1/1) ... [2025-01-09 05:00:52,344 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:00:52" (1/1) ... [2025-01-09 05:00:52,358 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:00:52" (1/1) ... [2025-01-09 05:00:52,399 INFO L175 MemorySlicer]: Split 308 memory accesses to 15 slices as follows [2, 8, 37, 8, 8, 13, 62, 57, 25, 25, 37, 11, 2, 13, 0]. 20 percent of accesses are in the largest equivalence class. The 74 initializations are split as follows [2, 3, 0, 3, 3, 0, 21, 21, 7, 7, 0, 7, 0, 0, 0]. The 71 writes are split as follows [0, 2, 1, 2, 2, 1, 23, 18, 8, 8, 1, 2, 2, 1, 0]. [2025-01-09 05:00:52,399 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:00:52" (1/1) ... [2025-01-09 05:00:52,399 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:00:52" (1/1) ... [2025-01-09 05:00:52,437 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:00:52" (1/1) ... [2025-01-09 05:00:52,439 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:00:52" (1/1) ... [2025-01-09 05:00:52,442 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:00:52" (1/1) ... [2025-01-09 05:00:52,446 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:00:52" (1/1) ... [2025-01-09 05:00:52,448 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:00:52" (1/1) ... [2025-01-09 05:00:52,457 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 05:00:52,461 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 05:00:52,461 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 05:00:52,461 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 05:00:52,462 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:00:52" (1/1) ... [2025-01-09 05:00:52,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:00:52,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:00:52,492 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 05:00:52,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 05:00:52,516 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 05:00:52,517 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 05:00:52,517 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 05:00:52,517 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-09 05:00:52,517 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-09 05:00:52,517 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-01-09 05:00:52,517 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-01-09 05:00:52,517 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-01-09 05:00:52,518 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-01-09 05:00:52,518 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-01-09 05:00:52,518 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-01-09 05:00:52,518 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-01-09 05:00:52,518 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-01-09 05:00:52,518 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-01-09 05:00:52,518 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-01-09 05:00:52,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 05:00:52,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 05:00:52,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 05:00:52,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-09 05:00:52,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-09 05:00:52,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-01-09 05:00:52,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-01-09 05:00:52,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-01-09 05:00:52,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-01-09 05:00:52,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-01-09 05:00:52,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-01-09 05:00:52,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-01-09 05:00:52,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-01-09 05:00:52,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-01-09 05:00:52,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-01-09 05:00:52,521 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 05:00:52,521 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 05:00:52,521 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 05:00:52,521 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 05:00:52,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 05:00:52,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 05:00:52,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-09 05:00:52,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-01-09 05:00:52,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-01-09 05:00:52,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-01-09 05:00:52,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-01-09 05:00:52,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-01-09 05:00:52,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-01-09 05:00:52,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-01-09 05:00:52,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-01-09 05:00:52,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-01-09 05:00:52,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-01-09 05:00:52,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-01-09 05:00:52,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-01-09 05:00:52,521 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2025-01-09 05:00:52,521 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2025-01-09 05:00:52,521 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 05:00:52,521 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 05:00:52,521 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-09 05:00:52,521 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-01-09 05:00:52,521 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-01-09 05:00:52,521 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-01-09 05:00:52,521 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-01-09 05:00:52,521 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-01-09 05:00:52,521 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-01-09 05:00:52,522 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-01-09 05:00:52,522 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-01-09 05:00:52,522 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-01-09 05:00:52,522 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-01-09 05:00:52,522 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-01-09 05:00:52,522 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-01-09 05:00:52,522 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-01-09 05:00:52,522 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-01-09 05:00:52,522 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 05:00:52,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-01-09 05:00:52,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-01-09 05:00:52,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-01-09 05:00:52,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-01-09 05:00:52,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-01-09 05:00:52,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-01-09 05:00:52,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-01-09 05:00:52,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-01-09 05:00:52,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-01-09 05:00:52,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-01-09 05:00:52,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-01-09 05:00:52,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-01-09 05:00:52,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-01-09 05:00:52,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-01-09 05:00:52,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-01-09 05:00:52,522 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2025-01-09 05:00:52,522 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2025-01-09 05:00:52,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 05:00:52,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 05:00:52,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 05:00:52,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 05:00:52,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-09 05:00:52,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-09 05:00:52,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-01-09 05:00:52,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-01-09 05:00:52,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-01-09 05:00:52,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-01-09 05:00:52,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-01-09 05:00:52,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-01-09 05:00:52,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-01-09 05:00:52,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-01-09 05:00:52,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-01-09 05:00:52,523 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 05:00:52,525 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 05:00:52,735 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 05:00:52,737 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 05:00:53,061 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: 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-01-09 05:00:53,061 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-01-09 05:00:53,065 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: 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-01-09 05:00:53,066 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-01-09 05:00:53,066 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint L733: SUMMARY for call __CS_cs(); srcloc: null [2025-01-09 05:00:53,066 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint L733-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-01-09 05:00:53,066 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint L733-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-01-09 05:00:57,603 INFO L? ?]: Removed 72 outVars from TransFormulas that were not future-live. [2025-01-09 05:00:57,603 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 05:00:57,619 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 05:00:57,622 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 05:00:57,623 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:00:57 BoogieIcfgContainer [2025-01-09 05:00:57,623 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 05:00:57,625 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 05:00:57,625 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 05:00:57,629 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 05:00:57,629 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 05:00:51" (1/3) ... [2025-01-09 05:00:57,629 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67b9af5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:00:57, skipping insertion in model container [2025-01-09 05:00:57,630 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:00:52" (2/3) ... [2025-01-09 05:00:57,630 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67b9af5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:00:57, skipping insertion in model container [2025-01-09 05:00:57,630 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:00:57" (3/3) ... [2025-01-09 05:00:57,631 INFO L128 eAbstractionObserver]: Analyzing ICFG cs_fib_longer-2.i [2025-01-09 05:00:57,653 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 05:00:57,658 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG cs_fib_longer-2.i that has 5 procedures, 183 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2025-01-09 05:00:57,748 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 05:00:57,765 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;@e841824, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 05:00:57,765 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 05:00:57,773 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-01-09 05:00:57,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2025-01-09 05:00:57,796 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:00:57,797 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-01-09 05:00:57,797 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:00:57,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:00:57,802 INFO L85 PathProgramCache]: Analyzing trace with hash -315936079, now seen corresponding path program 1 times [2025-01-09 05:00:57,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:00:57,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607515804] [2025-01-09 05:00:57,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:00:57,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:00:58,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 299 statements into 1 equivalence classes. [2025-01-09 05:00:58,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 299 of 299 statements. [2025-01-09 05:00:58,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:00:58,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:00:58,889 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-01-09 05:00:58,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:00:58,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607515804] [2025-01-09 05:00:58,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607515804] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:00:58,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:00:58,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:00:58,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987491669] [2025-01-09 05:00:58,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:00:58,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:00:58,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:00:58,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:00:58,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:00:58,937 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-01-09 05:01:03,026 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-01-09 05:01:03,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:01:03,105 INFO L93 Difference]: Finished difference Result 364 states and 617 transitions. [2025-01-09 05:01:03,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:01:03,111 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-01-09 05:01:03,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:01:03,118 INFO L225 Difference]: With dead ends: 364 [2025-01-09 05:01:03,121 INFO L226 Difference]: Without dead ends: 181 [2025-01-09 05:01:03,126 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-01-09 05:01:03,128 INFO L435 NwaCegarLoop]: 272 mSDtfsCounter, 2 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s 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-01-09 05:01:03,129 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-01-09 05:01:03,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2025-01-09 05:01:03,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 180. [2025-01-09 05:01:03,171 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-01-09 05:01:03,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 272 transitions. [2025-01-09 05:01:03,180 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 272 transitions. Word has length 299 [2025-01-09 05:01:03,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:01:03,181 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 272 transitions. [2025-01-09 05:01:03,181 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-01-09 05:01:03,182 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 272 transitions. [2025-01-09 05:01:03,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2025-01-09 05:01:03,187 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:01:03,188 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-01-09 05:01:03,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 05:01:03,188 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:01:03,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:01:03,189 INFO L85 PathProgramCache]: Analyzing trace with hash -462946485, now seen corresponding path program 1 times [2025-01-09 05:01:03,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:01:03,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861450277] [2025-01-09 05:01:03,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:01:03,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:01:03,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 301 statements into 1 equivalence classes. [2025-01-09 05:01:03,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 301 of 301 statements. [2025-01-09 05:01:03,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:01:03,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:01:03,785 INFO L134 CoverageAnalysis]: Checked inductivity of 4513 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-01-09 05:01:03,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:01:03,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861450277] [2025-01-09 05:01:03,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861450277] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:01:03,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:01:03,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:01:03,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737429361] [2025-01-09 05:01:03,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:01:03,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:01:03,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:01:03,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:01:03,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:01:03,792 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-01-09 05:01:03,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:01:03,836 INFO L93 Difference]: Finished difference Result 358 states and 543 transitions. [2025-01-09 05:01:03,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:01:03,837 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-01-09 05:01:03,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:01:03,841 INFO L225 Difference]: With dead ends: 358 [2025-01-09 05:01:03,841 INFO L226 Difference]: Without dead ends: 181 [2025-01-09 05:01:03,842 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-01-09 05:01:03,842 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-01-09 05:01:03,842 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-01-09 05:01:03,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2025-01-09 05:01:03,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2025-01-09 05:01:03,863 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-01-09 05:01:03,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 273 transitions. [2025-01-09 05:01:03,866 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 273 transitions. Word has length 301 [2025-01-09 05:01:03,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:01:03,866 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 273 transitions. [2025-01-09 05:01:03,866 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-01-09 05:01:03,866 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 273 transitions. [2025-01-09 05:01:03,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2025-01-09 05:01:03,871 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:01:03,871 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-01-09 05:01:03,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 05:01:03,871 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:01:03,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:01:03,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1479737217, now seen corresponding path program 1 times [2025-01-09 05:01:03,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:01:03,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592670028] [2025-01-09 05:01:03,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:01:03,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:01:04,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 302 statements into 1 equivalence classes. [2025-01-09 05:01:04,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 302 of 302 statements. [2025-01-09 05:01:04,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:01:04,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:01:04,392 INFO L134 CoverageAnalysis]: Checked inductivity of 4514 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-01-09 05:01:04,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:01:04,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592670028] [2025-01-09 05:01:04,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592670028] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:01:04,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1000839685] [2025-01-09 05:01:04,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:01:04,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:01:04,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:01:04,398 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 05:01:04,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 05:01:04,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 302 statements into 1 equivalence classes. [2025-01-09 05:01:05,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 302 of 302 statements. [2025-01-09 05:01:05,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:01:05,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:01:05,145 INFO L256 TraceCheckSpWp]: Trace formula consists of 1623 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 05:01:05,160 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:01:05,261 INFO L134 CoverageAnalysis]: Checked inductivity of 4514 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-01-09 05:01:05,262 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:01:05,699 INFO L134 CoverageAnalysis]: Checked inductivity of 4514 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-01-09 05:01:05,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1000839685] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:01:05,700 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:01:05,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-01-09 05:01:05,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168903540] [2025-01-09 05:01:05,700 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:01:05,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:01:05,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:01:05,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:01:05,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:01:05,702 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-01-09 05:01:05,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:01:05,747 INFO L93 Difference]: Finished difference Result 361 states and 547 transitions. [2025-01-09 05:01:05,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 05:01:05,751 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-01-09 05:01:05,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:01:05,752 INFO L225 Difference]: With dead ends: 361 [2025-01-09 05:01:05,752 INFO L226 Difference]: Without dead ends: 183 [2025-01-09 05:01:05,753 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-01-09 05:01:05,754 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-01-09 05:01:05,754 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-01-09 05:01:05,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2025-01-09 05:01:05,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2025-01-09 05:01:05,772 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-01-09 05:01:05,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 275 transitions. [2025-01-09 05:01:05,777 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 275 transitions. Word has length 302 [2025-01-09 05:01:05,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:01:05,777 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 275 transitions. [2025-01-09 05:01:05,778 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-01-09 05:01:05,778 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 275 transitions. [2025-01-09 05:01:05,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2025-01-09 05:01:05,782 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:01:05,783 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-01-09 05:01:05,795 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 05:01:05,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:01:05,988 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:01:05,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:01:05,988 INFO L85 PathProgramCache]: Analyzing trace with hash 181653697, now seen corresponding path program 2 times [2025-01-09 05:01:05,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:01:05,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368204942] [2025-01-09 05:01:05,989 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 05:01:05,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:01:06,244 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 304 statements into 2 equivalence classes. [2025-01-09 05:01:06,273 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 304 statements. [2025-01-09 05:01:06,273 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 05:01:06,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:01:06,550 INFO L134 CoverageAnalysis]: Checked inductivity of 4519 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4519 trivial. 0 not checked. [2025-01-09 05:01:06,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:01:06,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368204942] [2025-01-09 05:01:06,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368204942] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:01:06,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:01:06,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 05:01:06,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070049656] [2025-01-09 05:01:06,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:01:06,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 05:01:06,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:01:06,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 05:01:06,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 05:01:06,552 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-01-09 05:01:06,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:01:06,601 INFO L93 Difference]: Finished difference Result 356 states and 539 transitions. [2025-01-09 05:01:06,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 05:01:06,601 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-01-09 05:01:06,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:01:06,605 INFO L225 Difference]: With dead ends: 356 [2025-01-09 05:01:06,605 INFO L226 Difference]: Without dead ends: 254 [2025-01-09 05:01:06,606 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-01-09 05:01:06,606 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-01-09 05:01:06,607 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-01-09 05:01:06,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2025-01-09 05:01:06,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 253. [2025-01-09 05:01:06,623 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-01-09 05:01:06,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 386 transitions. [2025-01-09 05:01:06,625 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 386 transitions. Word has length 304 [2025-01-09 05:01:06,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:01:06,626 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 386 transitions. [2025-01-09 05:01:06,626 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-01-09 05:01:06,626 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 386 transitions. [2025-01-09 05:01:06,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2025-01-09 05:01:06,629 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:01:06,629 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-01-09 05:01:06,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 05:01:06,629 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:01:06,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:01:06,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1762194513, now seen corresponding path program 1 times [2025-01-09 05:01:06,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:01:06,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793474663] [2025-01-09 05:01:06,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:01:06,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:01:06,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 372 statements into 1 equivalence classes. [2025-01-09 05:01:06,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 372 of 372 statements. [2025-01-09 05:01:06,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:01:06,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:01:07,152 INFO L134 CoverageAnalysis]: Checked inductivity of 5345 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5344 trivial. 0 not checked. [2025-01-09 05:01:07,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:01:07,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793474663] [2025-01-09 05:01:07,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793474663] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:01:07,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [595157253] [2025-01-09 05:01:07,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:01:07,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:01:07,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:01:07,159 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 05:01:07,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 05:01:07,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 372 statements into 1 equivalence classes. [2025-01-09 05:01:07,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 372 of 372 statements. [2025-01-09 05:01:07,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:01:07,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:01:07,894 INFO L256 TraceCheckSpWp]: Trace formula consists of 2136 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 05:01:07,904 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:01:07,964 INFO L134 CoverageAnalysis]: Checked inductivity of 5345 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5344 trivial. 0 not checked. [2025-01-09 05:01:07,966 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:01:08,350 INFO L134 CoverageAnalysis]: Checked inductivity of 5345 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5344 trivial. 0 not checked. [2025-01-09 05:01:08,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [595157253] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:01:08,351 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:01:08,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-01-09 05:01:08,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173438037] [2025-01-09 05:01:08,351 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:01:08,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 05:01:08,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:01:08,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 05:01:08,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-09 05:01:08,355 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-01-09 05:01:12,424 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-01-09 05:01:16,440 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-01-09 05:01:20,465 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-01-09 05:01:24,496 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-01-09 05:01:28,533 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-01-09 05:01:28,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:01:28,562 INFO L93 Difference]: Finished difference Result 513 states and 783 transitions. [2025-01-09 05:01:28,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 05:01:28,604 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-01-09 05:01:28,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:01:28,606 INFO L225 Difference]: With dead ends: 513 [2025-01-09 05:01:28,606 INFO L226 Difference]: Without dead ends: 268 [2025-01-09 05:01:28,607 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-01-09 05:01:28,609 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-01-09 05:01:28,609 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-01-09 05:01:28,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2025-01-09 05:01:28,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2025-01-09 05:01:28,626 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-01-09 05:01:28,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 404 transitions. [2025-01-09 05:01:28,628 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 404 transitions. Word has length 372 [2025-01-09 05:01:28,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:01:28,628 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 404 transitions. [2025-01-09 05:01:28,629 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-01-09 05:01:28,629 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 404 transitions. [2025-01-09 05:01:28,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2025-01-09 05:01:28,633 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:01:28,633 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-01-09 05:01:28,643 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 05:01:28,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:01:28,837 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:01:28,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:01:28,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1132442081, now seen corresponding path program 2 times [2025-01-09 05:01:28,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:01:28,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206815702] [2025-01-09 05:01:28,838 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 05:01:28,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:01:29,149 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 387 statements into 2 equivalence classes. [2025-01-09 05:01:29,170 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 21 of 387 statements. [2025-01-09 05:01:29,171 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 05:01:29,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:01:29,368 INFO L134 CoverageAnalysis]: Checked inductivity of 5468 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5468 trivial. 0 not checked. [2025-01-09 05:01:29,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:01:29,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206815702] [2025-01-09 05:01:29,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206815702] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:01:29,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:01:29,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 05:01:29,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190698941] [2025-01-09 05:01:29,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:01:29,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 05:01:29,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:01:29,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 05:01:29,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 05:01:29,370 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-01-09 05:01:33,394 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-01-09 05:01:37,406 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-01-09 05:01:37,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:01:37,519 INFO L93 Difference]: Finished difference Result 732 states and 1120 transitions. [2025-01-09 05:01:37,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 05:01:37,520 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-01-09 05:01:37,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:01:37,523 INFO L225 Difference]: With dead ends: 732 [2025-01-09 05:01:37,523 INFO L226 Difference]: Without dead ends: 503 [2025-01-09 05:01:37,524 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-01-09 05:01:37,525 INFO L435 NwaCegarLoop]: 437 mSDtfsCounter, 255 mSDsluCounter, 691 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s 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.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:01:37,525 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.1s Time] [2025-01-09 05:01:37,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2025-01-09 05:01:37,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 499. [2025-01-09 05:01:37,551 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-01-09 05:01:37,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 766 transitions. [2025-01-09 05:01:37,555 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 766 transitions. Word has length 387 [2025-01-09 05:01:37,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:01:37,555 INFO L471 AbstractCegarLoop]: Abstraction has 499 states and 766 transitions. [2025-01-09 05:01:37,556 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-01-09 05:01:37,556 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 766 transitions. [2025-01-09 05:01:37,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2025-01-09 05:01:37,559 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:01:37,559 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-01-09 05:01:37,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 05:01:37,559 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:01:37,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:01:37,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1838060929, now seen corresponding path program 1 times [2025-01-09 05:01:37,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:01:37,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297179493] [2025-01-09 05:01:37,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:01:37,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:01:37,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 387 statements into 1 equivalence classes. [2025-01-09 05:01:37,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 387 of 387 statements. [2025-01-09 05:01:37,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:01:37,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:01:38,656 INFO L134 CoverageAnalysis]: Checked inductivity of 5468 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5468 trivial. 0 not checked. [2025-01-09 05:01:38,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:01:38,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297179493] [2025-01-09 05:01:38,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297179493] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:01:38,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:01:38,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:01:38,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953892540] [2025-01-09 05:01:38,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:01:38,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:01:38,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:01:38,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:01:38,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:01:38,658 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-01-09 05:01:42,672 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-01-09 05:01:46,681 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-01-09 05:01:50,700 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-01-09 05:01:50,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:01:50,988 INFO L93 Difference]: Finished difference Result 852 states and 1288 transitions. [2025-01-09 05:01:50,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 05:01:50,989 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-01-09 05:01:50,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:01:50,994 INFO L225 Difference]: With dead ends: 852 [2025-01-09 05:01:50,994 INFO L226 Difference]: Without dead ends: 456 [2025-01-09 05:01:50,996 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-01-09 05:01:50,996 INFO L435 NwaCegarLoop]: 435 mSDtfsCounter, 259 mSDsluCounter, 1080 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 10 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.1s 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.2s IncrementalHoareTripleChecker+Time [2025-01-09 05:01:50,997 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.2s Time] [2025-01-09 05:01:50,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2025-01-09 05:01:51,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 452. [2025-01-09 05:01:51,028 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-01-09 05:01:51,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 667 transitions. [2025-01-09 05:01:51,031 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 667 transitions. Word has length 387 [2025-01-09 05:01:51,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:01:51,031 INFO L471 AbstractCegarLoop]: Abstraction has 452 states and 667 transitions. [2025-01-09 05:01:51,032 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-01-09 05:01:51,032 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 667 transitions. [2025-01-09 05:01:51,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2025-01-09 05:01:51,035 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:01:51,035 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-01-09 05:01:51,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 05:01:51,035 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:01:51,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:01:51,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1012726049, now seen corresponding path program 1 times [2025-01-09 05:01:51,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:01:51,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486821175] [2025-01-09 05:01:51,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:01:51,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:01:51,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 387 statements into 1 equivalence classes. [2025-01-09 05:01:51,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 387 of 387 statements. [2025-01-09 05:01:51,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:01:51,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:01:51,726 INFO L134 CoverageAnalysis]: Checked inductivity of 5468 backedges. 0 proven. 106 refuted. 0 times theorem prover too weak. 5362 trivial. 0 not checked. [2025-01-09 05:01:51,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:01:51,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486821175] [2025-01-09 05:01:51,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486821175] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:01:51,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1800235024] [2025-01-09 05:01:51,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:01:51,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:01:51,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:01:51,735 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 05:01:51,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 05:01:52,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 387 statements into 1 equivalence classes. [2025-01-09 05:01:52,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 387 of 387 statements. [2025-01-09 05:01:52,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:01:52,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:01:52,591 INFO L256 TraceCheckSpWp]: Trace formula consists of 2481 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 05:01:52,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:01:52,708 INFO L134 CoverageAnalysis]: Checked inductivity of 5468 backedges. 0 proven. 106 refuted. 0 times theorem prover too weak. 5362 trivial. 0 not checked. [2025-01-09 05:01:52,708 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:01:53,454 INFO L134 CoverageAnalysis]: Checked inductivity of 5468 backedges. 0 proven. 106 refuted. 0 times theorem prover too weak. 5362 trivial. 0 not checked. [2025-01-09 05:01:53,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1800235024] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:01:53,455 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:01:53,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2025-01-09 05:01:53,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785964793] [2025-01-09 05:01:53,455 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:01:53,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 05:01:53,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:01:53,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 05:01:53,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2025-01-09 05:01:53,458 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-01-09 05:01:57,606 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-01-09 05:02:01,646 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-01-09 05:02:05,673 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-01-09 05:02:09,694 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-01-09 05:02:13,725 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-01-09 05:02:17,760 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-01-09 05:02:21,781 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-01-09 05:02:25,797 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-01-09 05:02:25,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:02:25,816 INFO L93 Difference]: Finished difference Result 896 states and 1327 transitions. [2025-01-09 05:02:25,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:02:25,864 INFO L78 Accepts]: Start accepts. Automaton has 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) Word has length 387 [2025-01-09 05:02:25,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:02:25,868 INFO L225 Difference]: With dead ends: 896 [2025-01-09 05:02:25,868 INFO L226 Difference]: Without dead ends: 467 [2025-01-09 05:02:25,870 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 779 GetRequests, 768 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2025-01-09 05:02:25,870 INFO L435 NwaCegarLoop]: 267 mSDtfsCounter, 2 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 797 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 32.3s IncrementalHoareTripleChecker+Time [2025-01-09 05:02:25,871 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 797 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 8 Unknown, 0 Unchecked, 32.3s Time] [2025-01-09 05:02:25,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2025-01-09 05:02:25,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 467. [2025-01-09 05:02:25,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 299 states have (on average 1.2608695652173914) internal successors, (377), 301 states have internal predecessors, (377), 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-01-09 05:02:25,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 685 transitions. [2025-01-09 05:02:25,893 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 685 transitions. Word has length 387 [2025-01-09 05:02:25,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:02:25,893 INFO L471 AbstractCegarLoop]: Abstraction has 467 states and 685 transitions. [2025-01-09 05:02:25,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has 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-01-09 05:02:25,894 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 685 transitions. [2025-01-09 05:02:25,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2025-01-09 05:02:25,896 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:02:25,897 INFO L218 NwaCegarLoop]: trace histogram [52, 52, 52, 21, 7, 7, 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-01-09 05:02:25,909 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 05:02:26,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:02:26,097 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:02:26,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:02:26,098 INFO L85 PathProgramCache]: Analyzing trace with hash -100570735, now seen corresponding path program 2 times [2025-01-09 05:02:26,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:02:26,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110500845] [2025-01-09 05:02:26,098 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 05:02:26,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:02:26,339 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 402 statements into 2 equivalence classes. [2025-01-09 05:02:26,568 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 402 of 402 statements. [2025-01-09 05:02:26,569 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 05:02:26,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:02:27,259 INFO L134 CoverageAnalysis]: Checked inductivity of 5744 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5740 trivial. 0 not checked. [2025-01-09 05:02:27,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:02:27,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110500845] [2025-01-09 05:02:27,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110500845] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:02:27,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1113172193] [2025-01-09 05:02:27,260 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 05:02:27,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:02:27,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:02:27,267 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 05:02:27,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 05:02:27,892 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 402 statements into 2 equivalence classes.