./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-pthread/cs_fib-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-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 2f188ac4b0bdfe335e0fcb7c5645493965a99a7b8a1d7a552e9d512c30775fb8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 05:00:37,511 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 05:00:37,576 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:37,582 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 05:00:37,583 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 05:00:37,608 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 05:00:37,609 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 05:00:37,609 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 05:00:37,609 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 05:00:37,609 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 05:00:37,609 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 05:00:37,609 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 05:00:37,610 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 05:00:37,610 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 05:00:37,610 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 05:00:37,610 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 05:00:37,610 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 05:00:37,610 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 05:00:37,610 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 05:00:37,610 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 05:00:37,610 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 05:00:37,611 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 05:00:37,611 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 05:00:37,611 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 05:00:37,611 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 05:00:37,611 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 05:00:37,611 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 05:00:37,611 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 05:00:37,611 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 05:00:37,611 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:00:37,611 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:00:37,611 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:00:37,611 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:00:37,612 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 05:00:37,612 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:00:37,612 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:00:37,612 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:00:37,612 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:00:37,612 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 05:00:37,612 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 05:00:37,612 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 05:00:37,612 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 05:00:37,612 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 05:00:37,612 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 05:00:37,613 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 05:00:37,613 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 05:00:37,613 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 05:00:37,613 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 05:00:37,613 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 -> 2f188ac4b0bdfe335e0fcb7c5645493965a99a7b8a1d7a552e9d512c30775fb8 [2025-01-09 05:00:37,883 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 05:00:37,892 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 05:00:37,894 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 05:00:37,896 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 05:00:37,896 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 05:00:37,897 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-pthread/cs_fib-2.i [2025-01-09 05:00:39,201 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/759bfece2/25635ad18b6842c3b6ba2f8f5d80f57d/FLAGfc2e10a68 [2025-01-09 05:00:39,553 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 05:00:39,554 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_fib-2.i [2025-01-09 05:00:39,566 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/759bfece2/25635ad18b6842c3b6ba2f8f5d80f57d/FLAGfc2e10a68 [2025-01-09 05:00:39,744 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/759bfece2/25635ad18b6842c3b6ba2f8f5d80f57d [2025-01-09 05:00:39,746 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 05:00:39,747 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 05:00:39,749 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 05:00:39,749 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 05:00:39,755 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 05:00:39,756 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:00:39" (1/1) ... [2025-01-09 05:00:39,756 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4448f301 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:00:39, skipping insertion in model container [2025-01-09 05:00:39,757 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:00:39" (1/1) ... [2025-01-09 05:00:39,789 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 05:00:40,002 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-2.i[23457,23470] [2025-01-09 05:00:40,095 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:00:40,112 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 05:00:40,151 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-2.i[23457,23470] [2025-01-09 05:00:40,233 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:00:40,266 INFO L204 MainTranslator]: Completed translation [2025-01-09 05:00:40,269 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:00:40 WrapperNode [2025-01-09 05:00:40,269 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 05:00:40,270 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 05:00:40,270 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 05:00:40,270 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 05:00:40,276 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:40" (1/1) ... [2025-01-09 05:00:40,296 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:40" (1/1) ... [2025-01-09 05:00:40,331 INFO L138 Inliner]: procedures = 145, calls = 401, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 706 [2025-01-09 05:00:40,332 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 05:00:40,333 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 05:00:40,333 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 05:00:40,333 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 05:00:40,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:40" (1/1) ... [2025-01-09 05:00:40,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:40" (1/1) ... [2025-01-09 05:00:40,351 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:40" (1/1) ... [2025-01-09 05:00:40,376 INFO L175 MemorySlicer]: Split 267 memory accesses to 15 slices as follows [2, 2, 8, 8, 8, 53, 48, 31, 22, 22, 10, 11, 0, 31, 11]. 20 percent of accesses are in the largest equivalence class. The 65 initializations are split as follows [2, 0, 3, 3, 3, 18, 18, 0, 6, 6, 6, 0, 0, 0, 0]. The 63 writes are split as follows [0, 2, 2, 2, 2, 20, 15, 1, 7, 7, 2, 1, 0, 1, 1]. [2025-01-09 05:00:40,376 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:40" (1/1) ... [2025-01-09 05:00:40,377 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:40" (1/1) ... [2025-01-09 05:00:40,397 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:40" (1/1) ... [2025-01-09 05:00:40,404 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:40" (1/1) ... [2025-01-09 05:00:40,413 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:40" (1/1) ... [2025-01-09 05:00:40,426 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:40" (1/1) ... [2025-01-09 05:00:40,433 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:40" (1/1) ... [2025-01-09 05:00:40,451 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 05:00:40,452 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 05:00:40,452 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 05:00:40,452 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 05:00:40,453 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:00:40" (1/1) ... [2025-01-09 05:00:40,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:00:40,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:00:40,483 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:40,489 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:40,510 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 05:00:40,510 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 05:00:40,510 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 05:00:40,510 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-09 05:00:40,510 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-09 05:00:40,510 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-01-09 05:00:40,510 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-01-09 05:00:40,510 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-01-09 05:00:40,510 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-01-09 05:00:40,510 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-01-09 05:00:40,510 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-01-09 05:00:40,510 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-01-09 05:00:40,510 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-01-09 05:00:40,510 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-01-09 05:00:40,510 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-01-09 05:00:40,510 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-01-09 05:00:40,511 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-01-09 05:00:40,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 05:00:40,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 05:00:40,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 05:00:40,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-09 05:00:40,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-09 05:00:40,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-01-09 05:00:40,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-01-09 05:00:40,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-01-09 05:00:40,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-01-09 05:00:40,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-01-09 05:00:40,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-01-09 05:00:40,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-01-09 05:00:40,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-01-09 05:00:40,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-01-09 05:00:40,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-01-09 05:00:40,511 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 05:00:40,511 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 05:00:40,511 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 05:00:40,511 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 05:00:40,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 05:00:40,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 05:00:40,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-09 05:00:40,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-01-09 05:00:40,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-01-09 05:00:40,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-01-09 05:00:40,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-01-09 05:00:40,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-01-09 05:00:40,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-01-09 05:00:40,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-01-09 05:00:40,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-01-09 05:00:40,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-01-09 05:00:40,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-01-09 05:00:40,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-01-09 05:00:40,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-01-09 05:00:40,515 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2025-01-09 05:00:40,515 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2025-01-09 05:00:40,515 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 05:00:40,515 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 05:00:40,515 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-09 05:00:40,515 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-01-09 05:00:40,515 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-01-09 05:00:40,515 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-01-09 05:00:40,515 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-01-09 05:00:40,515 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-01-09 05:00:40,515 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-01-09 05:00:40,515 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-01-09 05:00:40,515 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-01-09 05:00:40,515 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-01-09 05:00:40,515 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-01-09 05:00:40,515 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-01-09 05:00:40,515 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-01-09 05:00:40,516 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-01-09 05:00:40,516 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-01-09 05:00:40,516 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 05:00:40,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-01-09 05:00:40,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-01-09 05:00:40,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-01-09 05:00:40,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-01-09 05:00:40,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-01-09 05:00:40,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-01-09 05:00:40,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-01-09 05:00:40,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-01-09 05:00:40,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-01-09 05:00:40,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-01-09 05:00:40,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-01-09 05:00:40,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-01-09 05:00:40,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-01-09 05:00:40,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-01-09 05:00:40,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-01-09 05:00:40,516 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2025-01-09 05:00:40,516 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2025-01-09 05:00:40,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 05:00:40,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 05:00:40,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 05:00:40,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 05:00:40,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-09 05:00:40,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-09 05:00:40,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-01-09 05:00:40,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-01-09 05:00:40,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-01-09 05:00:40,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-01-09 05:00:40,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-01-09 05:00:40,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-01-09 05:00:40,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-01-09 05:00:40,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-01-09 05:00:40,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-01-09 05:00:40,517 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 05:00:40,517 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 05:00:40,725 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 05:00:40,727 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 05:00:41,001 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:41,001 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:41,001 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:41,002 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:41,002 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint L749: SUMMARY for call __CS_cs(); srcloc: null [2025-01-09 05:00:41,002 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint L749-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:41,002 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint L749-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:45,536 INFO L? ?]: Removed 71 outVars from TransFormulas that were not future-live. [2025-01-09 05:00:45,536 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 05:00:45,549 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 05:00:45,551 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 05:00:45,552 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:00:45 BoogieIcfgContainer [2025-01-09 05:00:45,552 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 05:00:45,553 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 05:00:45,554 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 05:00:45,558 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 05:00:45,558 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 05:00:39" (1/3) ... [2025-01-09 05:00:45,559 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b3b231 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:00:45, skipping insertion in model container [2025-01-09 05:00:45,559 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:00:40" (2/3) ... [2025-01-09 05:00:45,559 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b3b231 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:00:45, skipping insertion in model container [2025-01-09 05:00:45,560 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:00:45" (3/3) ... [2025-01-09 05:00:45,561 INFO L128 eAbstractionObserver]: Analyzing ICFG cs_fib-2.i [2025-01-09 05:00:45,576 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 05:00:45,579 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG cs_fib-2.i that has 6 procedures, 177 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2025-01-09 05:00:45,637 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 05:00:45,649 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;@62c9fb3f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 05:00:45,650 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 05:00:45,653 INFO L276 IsEmpty]: Start isEmpty. Operand has 177 states, 104 states have (on average 1.3173076923076923) internal successors, (137), 105 states have internal predecessors, (137), 66 states have call successors, (66), 5 states have call predecessors, (66), 5 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-01-09 05:00:45,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2025-01-09 05:00:45,670 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:00:45,671 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45,671 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:00:45,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:00:45,675 INFO L85 PathProgramCache]: Analyzing trace with hash 911248670, now seen corresponding path program 1 times [2025-01-09 05:00:45,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:00:45,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701017252] [2025-01-09 05:00:45,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:00:45,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:00:45,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 253 statements into 1 equivalence classes. [2025-01-09 05:00:46,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 253 of 253 statements. [2025-01-09 05:00:46,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:00:46,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:00:46,684 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-01-09 05:00:46,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:00:46,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701017252] [2025-01-09 05:00:46,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701017252] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:00:46,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:00:46,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:00:46,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476798335] [2025-01-09 05:00:46,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:00:46,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:00:46,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:00:46,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:00:46,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:00:46,723 INFO L87 Difference]: Start difference. First operand has 177 states, 104 states have (on average 1.3173076923076923) internal successors, (137), 105 states have internal predecessors, (137), 66 states have call successors, (66), 5 states have call predecessors, (66), 5 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (41), 2 states have call predecessors, (41), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-01-09 05:00:50,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:00:50,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:00:50,885 INFO L93 Difference]: Finished difference Result 352 states and 600 transitions. [2025-01-09 05:00:50,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:00:50,887 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (41), 2 states have call predecessors, (41), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 253 [2025-01-09 05:00:50,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:00:50,893 INFO L225 Difference]: With dead ends: 352 [2025-01-09 05:00:50,893 INFO L226 Difference]: Without dead ends: 175 [2025-01-09 05:00:50,896 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:00:50,898 INFO L435 NwaCegarLoop]: 264 mSDtfsCounter, 2 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 525 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:00:50,898 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 525 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-01-09 05:00:50,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2025-01-09 05:00:50,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 174. [2025-01-09 05:00:50,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 102 states have (on average 1.303921568627451) internal successors, (133), 103 states have internal predecessors, (133), 66 states have call successors, (66), 5 states have call predecessors, (66), 5 states have return successors, (65), 65 states have call predecessors, (65), 65 states have call successors, (65) [2025-01-09 05:00:50,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 264 transitions. [2025-01-09 05:00:50,938 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 264 transitions. Word has length 253 [2025-01-09 05:00:50,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:00:50,938 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 264 transitions. [2025-01-09 05:00:50,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (41), 2 states have call predecessors, (41), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-01-09 05:00:50,939 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 264 transitions. [2025-01-09 05:00:50,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2025-01-09 05:00:50,944 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:00:50,944 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 05:00:50,945 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:00:50,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:00:50,945 INFO L85 PathProgramCache]: Analyzing trace with hash 2055963192, now seen corresponding path program 1 times [2025-01-09 05:00:50,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:00:50,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605532120] [2025-01-09 05:00:50,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:00:50,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:00:51,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 255 statements into 1 equivalence classes. [2025-01-09 05:00:51,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 255 of 255 statements. [2025-01-09 05:00:51,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:00:51,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:00:51,507 INFO L134 CoverageAnalysis]: Checked inductivity of 3121 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-01-09 05:00:51,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:00:51,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605532120] [2025-01-09 05:00:51,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605532120] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:00:51,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:00:51,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:00:51,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801178389] [2025-01-09 05:00:51,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:00:51,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:00:51,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:00:51,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:00:51,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:00:51,509 INFO L87 Difference]: Start difference. First operand 174 states and 264 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (41), 2 states have call predecessors, (41), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-01-09 05:00:51,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:00:51,539 INFO L93 Difference]: Finished difference Result 346 states and 527 transitions. [2025-01-09 05:00:51,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:00:51,539 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (41), 2 states have call predecessors, (41), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 255 [2025-01-09 05:00:51,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:00:51,541 INFO L225 Difference]: With dead ends: 346 [2025-01-09 05:00:51,541 INFO L226 Difference]: Without dead ends: 175 [2025-01-09 05:00:51,542 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:00:51,542 INFO L435 NwaCegarLoop]: 262 mSDtfsCounter, 0 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 521 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:00:51,543 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 521 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:00:51,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2025-01-09 05:00:51,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2025-01-09 05:00:51,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 103 states have (on average 1.3009708737864079) internal successors, (134), 104 states have internal predecessors, (134), 66 states have call successors, (66), 5 states have call predecessors, (66), 5 states have return successors, (65), 65 states have call predecessors, (65), 65 states have call successors, (65) [2025-01-09 05:00:51,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 265 transitions. [2025-01-09 05:00:51,555 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 265 transitions. Word has length 255 [2025-01-09 05:00:51,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:00:51,555 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 265 transitions. [2025-01-09 05:00:51,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (41), 2 states have call predecessors, (41), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-01-09 05:00:51,555 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 265 transitions. [2025-01-09 05:00:51,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2025-01-09 05:00:51,558 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:00:51,558 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 05:00:51,558 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:00:51,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:00:51,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1663402883, now seen corresponding path program 1 times [2025-01-09 05:00:51,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:00:51,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989274750] [2025-01-09 05:00:51,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:00:51,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:00:51,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 256 statements into 1 equivalence classes. [2025-01-09 05:00:51,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 256 of 256 statements. [2025-01-09 05:00:51,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:00:51,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:00:51,953 INFO L134 CoverageAnalysis]: Checked inductivity of 3122 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-01-09 05:00:51,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:00:51,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989274750] [2025-01-09 05:00:51,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989274750] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:00:51,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [453497926] [2025-01-09 05:00:51,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:00:51,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:00:51,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:00:51,956 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:00:51,958 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:00:52,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 256 statements into 1 equivalence classes. [2025-01-09 05:00:52,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 256 of 256 statements. [2025-01-09 05:00:52,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:00:52,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:00:52,590 INFO L256 TraceCheckSpWp]: Trace formula consists of 1432 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 05:00:52,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:00:52,648 INFO L134 CoverageAnalysis]: Checked inductivity of 3122 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-01-09 05:00:52,648 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:00:52,990 INFO L134 CoverageAnalysis]: Checked inductivity of 3122 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2025-01-09 05:00:52,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [453497926] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:00:52,991 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:00:52,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-01-09 05:00:52,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916996517] [2025-01-09 05:00:52,992 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:00:52,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:00:52,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:00:52,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:00:52,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:00:52,996 INFO L87 Difference]: Start difference. First operand 175 states and 265 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (81), 2 states have call predecessors, (81), 2 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-01-09 05:00:53,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:00:53,051 INFO L93 Difference]: Finished difference Result 349 states and 531 transitions. [2025-01-09 05:00:53,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 05:00:53,052 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (81), 2 states have call predecessors, (81), 2 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) Word has length 256 [2025-01-09 05:00:53,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:00:53,054 INFO L225 Difference]: With dead ends: 349 [2025-01-09 05:00:53,057 INFO L226 Difference]: Without dead ends: 177 [2025-01-09 05:00:53,059 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 514 GetRequests, 509 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:00:53,059 INFO L435 NwaCegarLoop]: 262 mSDtfsCounter, 0 mSDsluCounter, 777 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1039 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:00:53,059 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1039 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:00:53,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2025-01-09 05:00:53,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2025-01-09 05:00:53,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 105 states have (on average 1.2952380952380953) internal successors, (136), 106 states have internal predecessors, (136), 66 states have call successors, (66), 5 states have call predecessors, (66), 5 states have return successors, (65), 65 states have call predecessors, (65), 65 states have call successors, (65) [2025-01-09 05:00:53,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 267 transitions. [2025-01-09 05:00:53,081 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 267 transitions. Word has length 256 [2025-01-09 05:00:53,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:00:53,081 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 267 transitions. [2025-01-09 05:00:53,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (81), 2 states have call predecessors, (81), 2 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-01-09 05:00:53,081 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 267 transitions. [2025-01-09 05:00:53,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2025-01-09 05:00:53,084 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:00:53,084 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 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] [2025-01-09 05:00:53,094 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 05:00:53,284 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:00:53,284 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:00:53,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:00:53,285 INFO L85 PathProgramCache]: Analyzing trace with hash -1209367005, now seen corresponding path program 2 times [2025-01-09 05:00:53,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:00:53,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000073706] [2025-01-09 05:00:53,285 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 05:00:53,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:00:53,607 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 258 statements into 2 equivalence classes. [2025-01-09 05:00:53,701 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 258 statements. [2025-01-09 05:00:53,702 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 05:00:53,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:00:54,033 INFO L134 CoverageAnalysis]: Checked inductivity of 3127 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3127 trivial. 0 not checked. [2025-01-09 05:00:54,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:00:54,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000073706] [2025-01-09 05:00:54,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000073706] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:00:54,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:00:54,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:00:54,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572479574] [2025-01-09 05:00:54,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:00:54,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:00:54,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:00:54,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:00:54,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:00:54,035 INFO L87 Difference]: Start difference. First operand 177 states and 267 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (41), 2 states have call predecessors, (41), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-01-09 05:00:54,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:00:54,189 INFO L93 Difference]: Finished difference Result 350 states and 528 transitions. [2025-01-09 05:00:54,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 05:00:54,189 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (41), 2 states have call predecessors, (41), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 258 [2025-01-09 05:00:54,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:00:54,196 INFO L225 Difference]: With dead ends: 350 [2025-01-09 05:00:54,196 INFO L226 Difference]: Without dead ends: 348 [2025-01-09 05:00:54,197 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 05:00:54,198 INFO L435 NwaCegarLoop]: 255 mSDtfsCounter, 175 mSDsluCounter, 741 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 996 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:00:54,199 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 996 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:00:54,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2025-01-09 05:00:54,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 345. [2025-01-09 05:00:54,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 202 states have (on average 1.2920792079207921) internal successors, (261), 203 states have internal predecessors, (261), 131 states have call successors, (131), 11 states have call predecessors, (131), 11 states have return successors, (132), 130 states have call predecessors, (132), 129 states have call successors, (132) [2025-01-09 05:00:54,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 524 transitions. [2025-01-09 05:00:54,261 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 524 transitions. Word has length 258 [2025-01-09 05:00:54,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:00:54,262 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 524 transitions. [2025-01-09 05:00:54,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (41), 2 states have call predecessors, (41), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-01-09 05:00:54,263 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 524 transitions. [2025-01-09 05:00:54,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2025-01-09 05:00:54,269 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:00:54,270 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 05:00:54,270 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:00:54,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:00:54,271 INFO L85 PathProgramCache]: Analyzing trace with hash -1168815362, now seen corresponding path program 1 times [2025-01-09 05:00:54,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:00:54,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810129701] [2025-01-09 05:00:54,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:00:54,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:00:54,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 263 statements into 1 equivalence classes. [2025-01-09 05:00:54,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 263 of 263 statements. [2025-01-09 05:00:54,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:00:54,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:00:54,712 INFO L134 CoverageAnalysis]: Checked inductivity of 3129 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3126 trivial. 0 not checked. [2025-01-09 05:00:54,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:00:54,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810129701] [2025-01-09 05:00:54,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810129701] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:00:54,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1026161445] [2025-01-09 05:00:54,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:00:54,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:00:54,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:00:54,716 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:00:54,718 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:00:55,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 263 statements into 1 equivalence classes. [2025-01-09 05:00:55,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 263 of 263 statements. [2025-01-09 05:00:55,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:00:55,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:00:55,280 INFO L256 TraceCheckSpWp]: Trace formula consists of 1495 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 05:00:55,285 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:00:55,313 INFO L134 CoverageAnalysis]: Checked inductivity of 3129 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3128 trivial. 0 not checked. [2025-01-09 05:00:55,313 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:00:55,506 INFO L134 CoverageAnalysis]: Checked inductivity of 3129 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3126 trivial. 0 not checked. [2025-01-09 05:00:55,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1026161445] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:00:55,507 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:00:55,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-01-09 05:00:55,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10429345] [2025-01-09 05:00:55,507 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:00:55,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 05:00:55,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:00:55,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 05:00:55,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-09 05:00:55,509 INFO L87 Difference]: Start difference. First operand 345 states and 524 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 1 states have call successors, (83), 2 states have call predecessors, (83), 2 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-01-09 05:00:59,554 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:03,580 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:07,622 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:11,645 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:15,668 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:15,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:01:15,708 INFO L93 Difference]: Finished difference Result 697 states and 1059 transitions. [2025-01-09 05:01:15,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 05:01:15,709 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 1 states have call successors, (83), 2 states have call predecessors, (83), 2 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) Word has length 263 [2025-01-09 05:01:15,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:01:15,714 INFO L225 Difference]: With dead ends: 697 [2025-01-09 05:01:15,715 INFO L226 Difference]: Without dead ends: 360 [2025-01-09 05:01:15,716 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 528 GetRequests, 523 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:15,717 INFO L435 NwaCegarLoop]: 260 mSDtfsCounter, 4 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 776 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:15,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 776 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:15,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2025-01-09 05:01:15,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 360. [2025-01-09 05:01:15,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 217 states have (on average 1.2857142857142858) internal successors, (279), 218 states have internal predecessors, (279), 131 states have call successors, (131), 11 states have call predecessors, (131), 11 states have return successors, (132), 130 states have call predecessors, (132), 129 states have call successors, (132) [2025-01-09 05:01:15,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 542 transitions. [2025-01-09 05:01:15,755 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 542 transitions. Word has length 263 [2025-01-09 05:01:15,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:01:15,755 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 542 transitions. [2025-01-09 05:01:15,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 1 states have call successors, (83), 2 states have call predecessors, (83), 2 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-01-09 05:01:15,756 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 542 transitions. [2025-01-09 05:01:15,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2025-01-09 05:01:15,760 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:01:15,760 INFO L218 NwaCegarLoop]: trace histogram [40, 40, 40, 12, 4, 4, 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] [2025-01-09 05:01:15,769 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 05:01:15,965 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:15,965 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:01:15,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:01:15,966 INFO L85 PathProgramCache]: Analyzing trace with hash 768737955, now seen corresponding path program 2 times [2025-01-09 05:01:15,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:01:15,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388907590] [2025-01-09 05:01:15,967 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 05:01:15,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:01:16,119 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 278 statements into 2 equivalence classes. [2025-01-09 05:01:16,176 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 278 statements. [2025-01-09 05:01:16,177 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 05:01:16,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:01:16,359 INFO L134 CoverageAnalysis]: Checked inductivity of 3252 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3250 trivial. 0 not checked. [2025-01-09 05:01:16,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:01:16,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388907590] [2025-01-09 05:01:16,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388907590] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:01:16,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:01:16,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:01:16,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626910216] [2025-01-09 05:01:16,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:01:16,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:01:16,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:01:16,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:01:16,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:01:16,361 INFO L87 Difference]: Start difference. First operand 360 states and 542 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (42), 2 states have call predecessors, (42), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41) [2025-01-09 05:01:16,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:01:16,382 INFO L93 Difference]: Finished difference Result 688 states and 1040 transitions. [2025-01-09 05:01:16,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:01:16,382 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (42), 2 states have call predecessors, (42), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41) Word has length 278 [2025-01-09 05:01:16,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:01:16,386 INFO L225 Difference]: With dead ends: 688 [2025-01-09 05:01:16,386 INFO L226 Difference]: Without dead ends: 360 [2025-01-09 05:01:16,387 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:16,388 INFO L435 NwaCegarLoop]: 261 mSDtfsCounter, 0 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:01:16,388 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 520 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:01:16,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2025-01-09 05:01:16,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 360. [2025-01-09 05:01:16,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 217 states have (on average 1.2811059907834101) internal successors, (278), 218 states have internal predecessors, (278), 131 states have call successors, (131), 11 states have call predecessors, (131), 11 states have return successors, (132), 130 states have call predecessors, (132), 129 states have call successors, (132) [2025-01-09 05:01:16,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 541 transitions. [2025-01-09 05:01:16,418 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 541 transitions. Word has length 278 [2025-01-09 05:01:16,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:01:16,418 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 541 transitions. [2025-01-09 05:01:16,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (42), 2 states have call predecessors, (42), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41) [2025-01-09 05:01:16,418 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 541 transitions. [2025-01-09 05:01:16,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2025-01-09 05:01:16,422 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:01:16,422 INFO L218 NwaCegarLoop]: trace histogram [41, 41, 41, 12, 4, 4, 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] [2025-01-09 05:01:16,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 05:01:16,422 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:01:16,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:01:16,423 INFO L85 PathProgramCache]: Analyzing trace with hash 654975269, now seen corresponding path program 1 times [2025-01-09 05:01:16,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:01:16,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766469789] [2025-01-09 05:01:16,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:01:16,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:01:16,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 299 statements into 1 equivalence classes. [2025-01-09 05:01:16,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 299 of 299 statements. [2025-01-09 05:01:16,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:01:16,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:01:17,100 INFO L134 CoverageAnalysis]: Checked inductivity of 3412 backedges. 2 proven. 106 refuted. 0 times theorem prover too weak. 3304 trivial. 0 not checked. [2025-01-09 05:01:17,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:01:17,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766469789] [2025-01-09 05:01:17,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766469789] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:01:17,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1303249923] [2025-01-09 05:01:17,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:01:17,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:01:17,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:01:17,104 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:17,105 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:17,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 299 statements into 1 equivalence classes. [2025-01-09 05:01:17,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 299 of 299 statements. [2025-01-09 05:01:17,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:01:17,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:01:17,718 INFO L256 TraceCheckSpWp]: Trace formula consists of 1994 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 05:01:17,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:01:17,771 INFO L134 CoverageAnalysis]: Checked inductivity of 3412 backedges. 0 proven. 106 refuted. 0 times theorem prover too weak. 3306 trivial. 0 not checked. [2025-01-09 05:01:17,771 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:01:18,017 INFO L134 CoverageAnalysis]: Checked inductivity of 3412 backedges. 2 proven. 106 refuted. 0 times theorem prover too weak. 3304 trivial. 0 not checked. [2025-01-09 05:01:18,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1303249923] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:01:18,017 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:01:18,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 9 [2025-01-09 05:01:18,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251286121] [2025-01-09 05:01:18,017 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:01:18,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 05:01:18,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:01:18,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 05:01:18,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-01-09 05:01:18,020 INFO L87 Difference]: Start difference. First operand 360 states and 541 transitions. Second operand has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 2 states have call successors, (89), 2 states have call predecessors, (89), 2 states have return successors, (88), 2 states have call predecessors, (88), 2 states have call successors, (88) [2025-01-09 05:01:22,076 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:26,096 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:30,118 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:34,139 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:38,163 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:42,178 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,187 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,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:01:46,257 INFO L93 Difference]: Finished difference Result 707 states and 1068 transitions. [2025-01-09 05:01:46,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 05:01:46,258 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 2 states have call successors, (89), 2 states have call predecessors, (89), 2 states have return successors, (88), 2 states have call predecessors, (88), 2 states have call successors, (88) Word has length 299 [2025-01-09 05:01:46,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:01:46,260 INFO L225 Difference]: With dead ends: 707 [2025-01-09 05:01:46,261 INFO L226 Difference]: Without dead ends: 370 [2025-01-09 05:01:46,263 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 603 GetRequests, 592 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-01-09 05:01:46,264 INFO L435 NwaCegarLoop]: 259 mSDtfsCounter, 2 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 773 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.2s IncrementalHoareTripleChecker+Time [2025-01-09 05:01:46,264 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 773 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 7 Unknown, 0 Unchecked, 28.2s Time] [2025-01-09 05:01:46,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2025-01-09 05:01:46,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 370. [2025-01-09 05:01:46,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 227 states have (on average 1.277533039647577) internal successors, (290), 228 states have internal predecessors, (290), 131 states have call successors, (131), 11 states have call predecessors, (131), 11 states have return successors, (132), 130 states have call predecessors, (132), 129 states have call successors, (132) [2025-01-09 05:01:46,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 553 transitions. [2025-01-09 05:01:46,296 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 553 transitions. Word has length 299 [2025-01-09 05:01:46,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:01:46,298 INFO L471 AbstractCegarLoop]: Abstraction has 370 states and 553 transitions. [2025-01-09 05:01:46,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 2 states have call successors, (89), 2 states have call predecessors, (89), 2 states have return successors, (88), 2 states have call predecessors, (88), 2 states have call successors, (88) [2025-01-09 05:01:46,298 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 553 transitions. [2025-01-09 05:01:46,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2025-01-09 05:01:46,302 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:01:46,302 INFO L218 NwaCegarLoop]: trace histogram [41, 41, 41, 18, 6, 6, 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] [2025-01-09 05:01:46,316 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 05:01:46,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:01:46,507 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:01:46,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:01:46,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1801223099, now seen corresponding path program 2 times [2025-01-09 05:01:46,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:01:46,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496241417] [2025-01-09 05:01:46,509 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 05:01:46,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:01:46,748 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 309 statements into 2 equivalence classes. [2025-01-09 05:01:46,798 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 309 statements. [2025-01-09 05:01:46,798 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 05:01:46,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:01:47,284 INFO L134 CoverageAnalysis]: Checked inductivity of 3579 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3577 trivial. 0 not checked. [2025-01-09 05:01:47,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:01:47,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496241417] [2025-01-09 05:01:47,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496241417] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:01:47,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:01:47,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:01:47,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579262798] [2025-01-09 05:01:47,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:01:47,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:01:47,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:01:47,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:01:47,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:01:47,285 INFO L87 Difference]: Start difference. First operand 370 states and 553 transitions. Second operand has 6 states, 5 states have (on average 14.6) internal successors, (73), 6 states have internal predecessors, (73), 4 states have call successors, (45), 2 states have call predecessors, (45), 2 states have return successors, (44), 3 states have call predecessors, (44), 4 states have call successors, (44) [2025-01-09 05:01:51,320 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:55,330 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:59,361 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:00,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:02:00,163 INFO L93 Difference]: Finished difference Result 1047 states and 1592 transitions. [2025-01-09 05:02:00,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 05:02:00,164 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.6) internal successors, (73), 6 states have internal predecessors, (73), 4 states have call successors, (45), 2 states have call predecessors, (45), 2 states have return successors, (44), 3 states have call predecessors, (44), 4 states have call successors, (44) Word has length 309 [2025-01-09 05:02:00,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:02:00,170 INFO L225 Difference]: With dead ends: 1047 [2025-01-09 05:02:00,170 INFO L226 Difference]: Without dead ends: 717 [2025-01-09 05:02:00,173 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-01-09 05:02:00,174 INFO L435 NwaCegarLoop]: 265 mSDtfsCounter, 537 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 281 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 539 SdHoareTripleChecker+Valid, 862 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 281 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.7s IncrementalHoareTripleChecker+Time [2025-01-09 05:02:00,174 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [539 Valid, 862 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [281 Valid, 217 Invalid, 3 Unknown, 0 Unchecked, 12.7s Time] [2025-01-09 05:02:00,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2025-01-09 05:02:00,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 376. [2025-01-09 05:02:00,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 231 states have (on average 1.2727272727272727) internal successors, (294), 234 states have internal predecessors, (294), 131 states have call successors, (131), 11 states have call predecessors, (131), 13 states have return successors, (136), 130 states have call predecessors, (136), 129 states have call successors, (136) [2025-01-09 05:02:00,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 561 transitions. [2025-01-09 05:02:00,230 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 561 transitions. Word has length 309 [2025-01-09 05:02:00,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:02:00,230 INFO L471 AbstractCegarLoop]: Abstraction has 376 states and 561 transitions. [2025-01-09 05:02:00,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.6) internal successors, (73), 6 states have internal predecessors, (73), 4 states have call successors, (45), 2 states have call predecessors, (45), 2 states have return successors, (44), 3 states have call predecessors, (44), 4 states have call successors, (44) [2025-01-09 05:02:00,230 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 561 transitions. [2025-01-09 05:02:00,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2025-01-09 05:02:00,233 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:02:00,233 INFO L218 NwaCegarLoop]: trace histogram [41, 41, 41, 18, 6, 6, 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] [2025-01-09 05:02:00,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 05:02:00,234 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:02:00,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:02:00,234 INFO L85 PathProgramCache]: Analyzing trace with hash -646303334, now seen corresponding path program 1 times [2025-01-09 05:02:00,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:02:00,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115274015] [2025-01-09 05:02:00,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:02:00,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:02:00,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 308 statements into 1 equivalence classes. [2025-01-09 05:02:00,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 308 of 308 statements. [2025-01-09 05:02:00,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:02:00,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:02:01,359 INFO L134 CoverageAnalysis]: Checked inductivity of 3579 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3577 trivial. 0 not checked. [2025-01-09 05:02:01,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:02:01,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115274015] [2025-01-09 05:02:01,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115274015] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:02:01,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:02:01,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:02:01,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114734436] [2025-01-09 05:02:01,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:02:01,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:02:01,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:02:01,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:02:01,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:02:01,361 INFO L87 Difference]: Start difference. First operand 376 states and 561 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (45), 3 states have call predecessors, (45), 2 states have return successors, (44), 3 states have call predecessors, (44), 3 states have call successors, (44) [2025-01-09 05:02:01,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:02:01,932 INFO L93 Difference]: Finished difference Result 389 states and 573 transitions. [2025-01-09 05:02:01,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 05:02:01,933 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (45), 3 states have call predecessors, (45), 2 states have return successors, (44), 3 states have call predecessors, (44), 3 states have call successors, (44) Word has length 308 [2025-01-09 05:02:01,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:02:01,936 INFO L225 Difference]: With dead ends: 389 [2025-01-09 05:02:01,937 INFO L226 Difference]: Without dead ends: 387 [2025-01-09 05:02:01,937 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-01-09 05:02:01,938 INFO L435 NwaCegarLoop]: 257 mSDtfsCounter, 229 mSDsluCounter, 712 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 969 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 05:02:01,938 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 969 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 05:02:01,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2025-01-09 05:02:01,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 381. [2025-01-09 05:02:01,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 235 states have (on average 1.2680851063829788) internal successors, (298), 238 states have internal predecessors, (298), 131 states have call successors, (131), 12 states have call predecessors, (131), 14 states have return successors, (136), 130 states have call predecessors, (136), 129 states have call successors, (136) [2025-01-09 05:02:01,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 565 transitions. [2025-01-09 05:02:01,973 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 565 transitions. Word has length 308 [2025-01-09 05:02:01,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:02:01,973 INFO L471 AbstractCegarLoop]: Abstraction has 381 states and 565 transitions. [2025-01-09 05:02:01,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (45), 3 states have call predecessors, (45), 2 states have return successors, (44), 3 states have call predecessors, (44), 3 states have call successors, (44) [2025-01-09 05:02:01,974 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 565 transitions. [2025-01-09 05:02:01,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2025-01-09 05:02:01,978 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:02:01,978 INFO L218 NwaCegarLoop]: trace histogram [41, 41, 41, 18, 6, 6, 3, 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] [2025-01-09 05:02:01,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 05:02:01,979 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:02:01,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:02:01,979 INFO L85 PathProgramCache]: Analyzing trace with hash -771339865, now seen corresponding path program 1 times [2025-01-09 05:02:01,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:02:01,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595645852] [2025-01-09 05:02:01,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:02:01,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:02:02,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 313 statements into 1 equivalence classes. [2025-01-09 05:02:02,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 313 of 313 statements. [2025-01-09 05:02:02,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:02:02,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:02:03,033 INFO L134 CoverageAnalysis]: Checked inductivity of 3585 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3581 trivial. 0 not checked. [2025-01-09 05:02:03,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:02:03,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595645852] [2025-01-09 05:02:03,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595645852] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:02:03,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:02:03,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 05:02:03,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317150627] [2025-01-09 05:02:03,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:02:03,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 05:02:03,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:02:03,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 05:02:03,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 05:02:03,034 INFO L87 Difference]: Start difference. First operand 381 states and 565 transitions. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 6 states have internal predecessors, (72), 4 states have call successors, (46), 3 states have call predecessors, (46), 2 states have return successors, (45), 3 states have call predecessors, (45), 4 states have call successors, (45) [2025-01-09 05:02:03,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:02:03,617 INFO L93 Difference]: Finished difference Result 390 states and 572 transitions. [2025-01-09 05:02:03,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 05:02:03,618 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 6 states have internal predecessors, (72), 4 states have call successors, (46), 3 states have call predecessors, (46), 2 states have return successors, (45), 3 states have call predecessors, (45), 4 states have call successors, (45) Word has length 313 [2025-01-09 05:02:03,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:02:03,621 INFO L225 Difference]: With dead ends: 390 [2025-01-09 05:02:03,621 INFO L226 Difference]: Without dead ends: 388 [2025-01-09 05:02:03,621 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-01-09 05:02:03,622 INFO L435 NwaCegarLoop]: 256 mSDtfsCounter, 394 mSDsluCounter, 710 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 966 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 05:02:03,622 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [410 Valid, 966 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 05:02:03,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2025-01-09 05:02:03,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 385. [2025-01-09 05:02:03,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 238 states have (on average 1.2647058823529411) internal successors, (301), 241 states have internal predecessors, (301), 131 states have call successors, (131), 13 states have call predecessors, (131), 15 states have return successors, (136), 130 states have call predecessors, (136), 129 states have call successors, (136) [2025-01-09 05:02:03,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 568 transitions. [2025-01-09 05:02:03,649 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 568 transitions. Word has length 313 [2025-01-09 05:02:03,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:02:03,649 INFO L471 AbstractCegarLoop]: Abstraction has 385 states and 568 transitions. [2025-01-09 05:02:03,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 6 states have internal predecessors, (72), 4 states have call successors, (46), 3 states have call predecessors, (46), 2 states have return successors, (45), 3 states have call predecessors, (45), 4 states have call successors, (45) [2025-01-09 05:02:03,650 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 568 transitions. [2025-01-09 05:02:03,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2025-01-09 05:02:03,653 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:02:03,653 INFO L218 NwaCegarLoop]: trace histogram [41, 41, 41, 18, 6, 6, 4, 3, 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] [2025-01-09 05:02:03,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 05:02:03,653 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:02:03,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:02:03,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1536510330, now seen corresponding path program 1 times [2025-01-09 05:02:03,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:02:03,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523978913] [2025-01-09 05:02:03,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:02:03,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:02:03,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 318 statements into 1 equivalence classes. [2025-01-09 05:02:04,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 318 of 318 statements. [2025-01-09 05:02:04,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:02:04,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:02:04,736 INFO L134 CoverageAnalysis]: Checked inductivity of 3595 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3589 trivial. 0 not checked. [2025-01-09 05:02:04,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:02:04,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523978913] [2025-01-09 05:02:04,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523978913] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:02:04,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:02:04,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 05:02:04,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106829982] [2025-01-09 05:02:04,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:02:04,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 05:02:04,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:02:04,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 05:02:04,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 05:02:04,738 INFO L87 Difference]: Start difference. First operand 385 states and 568 transitions. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 6 states have internal predecessors, (72), 4 states have call successors, (47), 3 states have call predecessors, (47), 2 states have return successors, (46), 3 states have call predecessors, (46), 4 states have call successors, (46) [2025-01-09 05:02:05,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:02:05,320 INFO L93 Difference]: Finished difference Result 394 states and 575 transitions. [2025-01-09 05:02:05,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 05:02:05,321 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 6 states have internal predecessors, (72), 4 states have call successors, (47), 3 states have call predecessors, (47), 2 states have return successors, (46), 3 states have call predecessors, (46), 4 states have call successors, (46) Word has length 318 [2025-01-09 05:02:05,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:02:05,324 INFO L225 Difference]: With dead ends: 394 [2025-01-09 05:02:05,324 INFO L226 Difference]: Without dead ends: 392 [2025-01-09 05:02:05,324 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-01-09 05:02:05,325 INFO L435 NwaCegarLoop]: 257 mSDtfsCounter, 394 mSDsluCounter, 712 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 969 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 05:02:05,325 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [410 Valid, 969 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 05:02:05,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2025-01-09 05:02:05,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 389. [2025-01-09 05:02:05,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 241 states have (on average 1.2614107883817427) internal successors, (304), 244 states have internal predecessors, (304), 131 states have call successors, (131), 14 states have call predecessors, (131), 16 states have return successors, (136), 130 states have call predecessors, (136), 129 states have call successors, (136) [2025-01-09 05:02:05,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 571 transitions. [2025-01-09 05:02:05,352 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 571 transitions. Word has length 318 [2025-01-09 05:02:05,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:02:05,352 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 571 transitions. [2025-01-09 05:02:05,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 6 states have internal predecessors, (72), 4 states have call successors, (47), 3 states have call predecessors, (47), 2 states have return successors, (46), 3 states have call predecessors, (46), 4 states have call successors, (46) [2025-01-09 05:02:05,353 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 571 transitions. [2025-01-09 05:02:05,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2025-01-09 05:02:05,355 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:02:05,355 INFO L218 NwaCegarLoop]: trace histogram [41, 41, 41, 18, 6, 6, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 05:02:05,355 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:02:05,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:02:05,356 INFO L85 PathProgramCache]: Analyzing trace with hash 649678151, now seen corresponding path program 1 times [2025-01-09 05:02:05,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:02:05,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925826348] [2025-01-09 05:02:05,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:02:05,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:02:05,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 323 statements into 1 equivalence classes. [2025-01-09 05:02:05,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 323 of 323 statements. [2025-01-09 05:02:05,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:02:05,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:02:06,477 INFO L134 CoverageAnalysis]: Checked inductivity of 3609 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3601 trivial. 0 not checked. [2025-01-09 05:02:06,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:02:06,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925826348] [2025-01-09 05:02:06,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925826348] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:02:06,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:02:06,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 05:02:06,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016590946] [2025-01-09 05:02:06,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:02:06,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 05:02:06,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:02:06,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 05:02:06,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 05:02:06,479 INFO L87 Difference]: Start difference. First operand 389 states and 571 transitions. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 6 states have internal predecessors, (72), 4 states have call successors, (48), 3 states have call predecessors, (48), 2 states have return successors, (47), 3 states have call predecessors, (47), 4 states have call successors, (47) [2025-01-09 05:02:07,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:02:07,027 INFO L93 Difference]: Finished difference Result 398 states and 578 transitions. [2025-01-09 05:02:07,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 05:02:07,028 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 6 states have internal predecessors, (72), 4 states have call successors, (48), 3 states have call predecessors, (48), 2 states have return successors, (47), 3 states have call predecessors, (47), 4 states have call successors, (47) Word has length 323 [2025-01-09 05:02:07,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:02:07,032 INFO L225 Difference]: With dead ends: 398 [2025-01-09 05:02:07,033 INFO L226 Difference]: Without dead ends: 396 [2025-01-09 05:02:07,033 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-01-09 05:02:07,033 INFO L435 NwaCegarLoop]: 257 mSDtfsCounter, 388 mSDsluCounter, 748 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 1005 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 05:02:07,034 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [404 Valid, 1005 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 05:02:07,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2025-01-09 05:02:07,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 393. [2025-01-09 05:02:07,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 244 states have (on average 1.2581967213114753) internal successors, (307), 247 states have internal predecessors, (307), 131 states have call successors, (131), 15 states have call predecessors, (131), 17 states have return successors, (136), 130 states have call predecessors, (136), 129 states have call successors, (136) [2025-01-09 05:02:07,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 574 transitions. [2025-01-09 05:02:07,065 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 574 transitions. Word has length 323 [2025-01-09 05:02:07,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:02:07,066 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 574 transitions. [2025-01-09 05:02:07,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 6 states have internal predecessors, (72), 4 states have call successors, (48), 3 states have call predecessors, (48), 2 states have return successors, (47), 3 states have call predecessors, (47), 4 states have call successors, (47) [2025-01-09 05:02:07,067 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 574 transitions. [2025-01-09 05:02:07,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2025-01-09 05:02:07,069 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:02:07,069 INFO L218 NwaCegarLoop]: trace histogram [41, 41, 41, 18, 6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 05:02:07,069 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:02:07,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:02:07,070 INFO L85 PathProgramCache]: Analyzing trace with hash 781039962, now seen corresponding path program 1 times [2025-01-09 05:02:07,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:02:07,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861439997] [2025-01-09 05:02:07,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:02:07,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:02:07,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 328 statements into 1 equivalence classes. [2025-01-09 05:02:07,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 328 of 328 statements. [2025-01-09 05:02:07,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:02:07,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:02:08,107 INFO L134 CoverageAnalysis]: Checked inductivity of 3627 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 3617 trivial. 0 not checked. [2025-01-09 05:02:08,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:02:08,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861439997] [2025-01-09 05:02:08,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861439997] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:02:08,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:02:08,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 05:02:08,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21444895] [2025-01-09 05:02:08,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:02:08,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 05:02:08,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:02:08,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 05:02:08,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 05:02:08,110 INFO L87 Difference]: Start difference. First operand 393 states and 574 transitions. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 6 states have internal predecessors, (72), 4 states have call successors, (49), 3 states have call predecessors, (49), 2 states have return successors, (48), 3 states have call predecessors, (48), 4 states have call successors, (48) [2025-01-09 05:02:08,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:02:08,794 INFO L93 Difference]: Finished difference Result 402 states and 581 transitions. [2025-01-09 05:02:08,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 05:02:08,795 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 6 states have internal predecessors, (72), 4 states have call successors, (49), 3 states have call predecessors, (49), 2 states have return successors, (48), 3 states have call predecessors, (48), 4 states have call successors, (48) Word has length 328 [2025-01-09 05:02:08,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:02:08,800 INFO L225 Difference]: With dead ends: 402 [2025-01-09 05:02:08,800 INFO L226 Difference]: Without dead ends: 398 [2025-01-09 05:02:08,801 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-01-09 05:02:08,801 INFO L435 NwaCegarLoop]: 257 mSDtfsCounter, 464 mSDsluCounter, 653 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 232 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 480 SdHoareTripleChecker+Valid, 910 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 232 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 05:02:08,801 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [480 Valid, 910 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [232 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 05:02:08,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2025-01-09 05:02:08,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 395. [2025-01-09 05:02:08,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 246 states have (on average 1.2520325203252032) internal successors, (308), 248 states have internal predecessors, (308), 131 states have call successors, (131), 16 states have call predecessors, (131), 17 states have return successors, (136), 130 states have call predecessors, (136), 129 states have call successors, (136) [2025-01-09 05:02:08,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 575 transitions. [2025-01-09 05:02:08,850 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 575 transitions. Word has length 328 [2025-01-09 05:02:08,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:02:08,851 INFO L471 AbstractCegarLoop]: Abstraction has 395 states and 575 transitions. [2025-01-09 05:02:08,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 6 states have internal predecessors, (72), 4 states have call successors, (49), 3 states have call predecessors, (49), 2 states have return successors, (48), 3 states have call predecessors, (48), 4 states have call successors, (48) [2025-01-09 05:02:08,852 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 575 transitions. [2025-01-09 05:02:08,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2025-01-09 05:02:08,856 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:02:08,857 INFO L218 NwaCegarLoop]: trace histogram [41, 41, 41, 18, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 05:02:08,857 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:02:08,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:02:08,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1462106343, now seen corresponding path program 1 times [2025-01-09 05:02:08,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:02:08,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569374224] [2025-01-09 05:02:08,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:02:08,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:02:09,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 333 statements into 1 equivalence classes. [2025-01-09 05:02:09,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 333 of 333 statements. [2025-01-09 05:02:09,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:02:09,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:02:09,625 INFO L134 CoverageAnalysis]: Checked inductivity of 3649 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 3637 trivial. 0 not checked. [2025-01-09 05:02:09,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:02:09,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569374224] [2025-01-09 05:02:09,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569374224] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:02:09,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:02:09,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:02:09,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912831834] [2025-01-09 05:02:09,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:02:09,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:02:09,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:02:09,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:02:09,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:02:09,629 INFO L87 Difference]: Start difference. First operand 395 states and 575 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (50), 3 states have call predecessors, (50), 2 states have return successors, (49), 3 states have call predecessors, (49), 3 states have call successors, (49) [2025-01-09 05:02:10,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:02:10,089 INFO L93 Difference]: Finished difference Result 398 states and 577 transitions. [2025-01-09 05:02:10,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 05:02:10,090 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (50), 3 states have call predecessors, (50), 2 states have return successors, (49), 3 states have call predecessors, (49), 3 states have call successors, (49) Word has length 333 [2025-01-09 05:02:10,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:02:10,092 INFO L225 Difference]: With dead ends: 398 [2025-01-09 05:02:10,092 INFO L226 Difference]: Without dead ends: 280 [2025-01-09 05:02:10,093 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-01-09 05:02:10,093 INFO L435 NwaCegarLoop]: 260 mSDtfsCounter, 221 mSDsluCounter, 733 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 993 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 05:02:10,093 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 993 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 05:02:10,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2025-01-09 05:02:10,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 279. [2025-01-09 05:02:10,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 183 states have (on average 1.3278688524590163) internal successors, (243), 186 states have internal predecessors, (243), 84 states have call successors, (84), 9 states have call predecessors, (84), 11 states have return successors, (88), 83 states have call predecessors, (88), 83 states have call successors, (88) [2025-01-09 05:02:10,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 415 transitions. [2025-01-09 05:02:10,111 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 415 transitions. Word has length 333 [2025-01-09 05:02:10,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:02:10,111 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 415 transitions. [2025-01-09 05:02:10,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (50), 3 states have call predecessors, (50), 2 states have return successors, (49), 3 states have call predecessors, (49), 3 states have call successors, (49) [2025-01-09 05:02:10,111 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 415 transitions. [2025-01-09 05:02:10,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2025-01-09 05:02:10,113 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:02:10,113 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 18, 6, 6, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 05:02:10,114 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:02:10,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:02:10,115 INFO L85 PathProgramCache]: Analyzing trace with hash -986379529, now seen corresponding path program 1 times [2025-01-09 05:02:10,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:02:10,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401157954] [2025-01-09 05:02:10,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:02:10,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:02:10,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 371 statements into 1 equivalence classes. [2025-01-09 05:02:10,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 371 of 371 statements. [2025-01-09 05:02:10,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:02:10,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:02:11,099 INFO L134 CoverageAnalysis]: Checked inductivity of 4319 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 4311 trivial. 0 not checked. [2025-01-09 05:02:11,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:02:11,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401157954] [2025-01-09 05:02:11,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401157954] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:02:11,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [709323167] [2025-01-09 05:02:11,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:02:11,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:02:11,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:02:11,104 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:11,113 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