./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test8-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/uthash-2.0.2/uthash_BER_test8-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 fe37ed55d149c65fede95413b0b499314c3ede2b9eb9a49f03115ea64cafc68c --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 20:40:15,392 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 20:40:15,441 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 20:40:15,446 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 20:40:15,450 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 20:40:15,465 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 20:40:15,465 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 20:40:15,465 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 20:40:15,465 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 20:40:15,465 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 20:40:15,465 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 20:40:15,465 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 20:40:15,466 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 20:40:15,466 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 20:40:15,466 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 20:40:15,466 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 20:40:15,466 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 20:40:15,466 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 20:40:15,466 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 20:40:15,466 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 20:40:15,466 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 20:40:15,466 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 20:40:15,466 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 20:40:15,466 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 20:40:15,466 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 20:40:15,466 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 20:40:15,466 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 20:40:15,466 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 20:40:15,466 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 20:40:15,466 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 20:40:15,466 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 20:40:15,467 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 20:40:15,467 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 20:40:15,467 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 20:40:15,467 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 20:40:15,467 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 20:40:15,467 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 20:40:15,467 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 20:40:15,467 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 20:40:15,467 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 20:40:15,467 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 20:40:15,467 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 20:40:15,467 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 20:40:15,467 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 20:40:15,467 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 20:40:15,467 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 20:40:15,467 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 20:40:15,467 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 20:40:15,467 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 -> fe37ed55d149c65fede95413b0b499314c3ede2b9eb9a49f03115ea64cafc68c [2025-01-09 20:40:15,669 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 20:40:15,677 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 20:40:15,678 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 20:40:15,680 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 20:40:15,680 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 20:40:15,681 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test8-2.i [2025-01-09 20:40:16,786 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8eed019d9/eb44c417bf9941779de9c050da889f9c/FLAGa389bac28 [2025-01-09 20:40:17,119 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 20:40:17,121 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test8-2.i [2025-01-09 20:40:17,133 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8eed019d9/eb44c417bf9941779de9c050da889f9c/FLAGa389bac28 [2025-01-09 20:40:17,366 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8eed019d9/eb44c417bf9941779de9c050da889f9c [2025-01-09 20:40:17,368 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 20:40:17,368 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 20:40:17,369 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 20:40:17,369 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 20:40:17,372 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 20:40:17,372 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:40:17" (1/1) ... [2025-01-09 20:40:17,373 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24facbaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:40:17, skipping insertion in model container [2025-01-09 20:40:17,373 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:40:17" (1/1) ... [2025-01-09 20:40:17,394 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 20:40:17,613 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/uthash-2.0.2/uthash_BER_test8-2.i[33021,33034] [2025-01-09 20:40:17,702 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/uthash-2.0.2/uthash_BER_test8-2.i[45234,45247] [2025-01-09 20:40:17,713 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 20:40:17,720 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 20:40:17,743 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/uthash-2.0.2/uthash_BER_test8-2.i[33021,33034] [2025-01-09 20:40:17,780 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/uthash-2.0.2/uthash_BER_test8-2.i[45234,45247] [2025-01-09 20:40:17,797 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 20:40:17,828 INFO L204 MainTranslator]: Completed translation [2025-01-09 20:40:17,828 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:40:17 WrapperNode [2025-01-09 20:40:17,829 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 20:40:17,829 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 20:40:17,829 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 20:40:17,829 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 20:40:17,835 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:40:17" (1/1) ... [2025-01-09 20:40:17,855 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:40:17" (1/1) ... [2025-01-09 20:40:17,899 INFO L138 Inliner]: procedures = 177, calls = 340, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1540 [2025-01-09 20:40:17,900 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 20:40:17,900 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 20:40:17,901 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 20:40:17,901 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 20:40:17,907 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:40:17" (1/1) ... [2025-01-09 20:40:17,908 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:40:17" (1/1) ... [2025-01-09 20:40:17,919 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:40:17" (1/1) ... [2025-01-09 20:40:18,001 INFO L175 MemorySlicer]: Split 304 memory accesses to 3 slices as follows [2, 268, 34]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 62 writes are split as follows [0, 58, 4]. [2025-01-09 20:40:18,001 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:40:17" (1/1) ... [2025-01-09 20:40:18,001 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:40:17" (1/1) ... [2025-01-09 20:40:18,047 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:40:17" (1/1) ... [2025-01-09 20:40:18,053 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:40:17" (1/1) ... [2025-01-09 20:40:18,067 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:40:17" (1/1) ... [2025-01-09 20:40:18,079 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:40:17" (1/1) ... [2025-01-09 20:40:18,084 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:40:17" (1/1) ... [2025-01-09 20:40:18,095 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 20:40:18,096 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 20:40:18,097 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 20:40:18,097 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 20:40:18,097 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:40:17" (1/1) ... [2025-01-09 20:40:18,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 20:40:18,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:40:18,131 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 20:40:18,143 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 20:40:18,159 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 20:40:18,160 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 20:40:18,160 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 20:40:18,160 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-01-09 20:40:18,160 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-01-09 20:40:18,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 20:40:18,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 20:40:18,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 20:40:18,160 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-01-09 20:40:18,160 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-01-09 20:40:18,160 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-01-09 20:40:18,161 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-01-09 20:40:18,161 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-01-09 20:40:18,161 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-01-09 20:40:18,161 INFO L130 BoogieDeclarations]: Found specification of procedure test_int [2025-01-09 20:40:18,161 INFO L138 BoogieDeclarations]: Found implementation of procedure test_int [2025-01-09 20:40:18,161 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 20:40:18,161 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 20:40:18,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 20:40:18,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 20:40:18,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-09 20:40:18,162 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 20:40:18,163 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 20:40:18,163 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 20:40:18,163 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-09 20:40:18,163 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 20:40:18,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 20:40:18,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 20:40:18,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 20:40:18,163 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 20:40:18,164 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 20:40:18,323 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 20:40:18,325 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 20:40:19,520 INFO L? ?]: Removed 354 outVars from TransFormulas that were not future-live. [2025-01-09 20:40:19,520 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 20:40:19,535 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 20:40:19,538 INFO L312 CfgBuilder]: Removed 35 assume(true) statements. [2025-01-09 20:40:19,539 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:40:19 BoogieIcfgContainer [2025-01-09 20:40:19,539 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 20:40:19,540 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 20:40:19,541 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 20:40:19,544 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 20:40:19,544 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 08:40:17" (1/3) ... [2025-01-09 20:40:19,544 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cd48b75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:40:19, skipping insertion in model container [2025-01-09 20:40:19,544 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:40:17" (2/3) ... [2025-01-09 20:40:19,545 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cd48b75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:40:19, skipping insertion in model container [2025-01-09 20:40:19,545 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:40:19" (3/3) ... [2025-01-09 20:40:19,546 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_BER_test8-2.i [2025-01-09 20:40:19,558 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 20:40:19,559 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_BER_test8-2.i that has 6 procedures, 475 locations, 1 initial locations, 42 loop locations, and 2 error locations. [2025-01-09 20:40:19,605 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 20:40:19,612 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;@562a4f6c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 20:40:19,612 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-09 20:40:19,615 INFO L276 IsEmpty]: Start isEmpty. Operand has 467 states, 441 states have (on average 1.6213151927437641) internal successors, (715), 458 states have internal predecessors, (715), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-09 20:40:19,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-09 20:40:19,621 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:40:19,621 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:40:19,622 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:40:19,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:40:19,628 INFO L85 PathProgramCache]: Analyzing trace with hash -978364192, now seen corresponding path program 1 times [2025-01-09 20:40:19,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:40:19,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393894395] [2025-01-09 20:40:19,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:40:19,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:40:19,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-09 20:40:19,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-09 20:40:19,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:40:19,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:40:19,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:40:19,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:40:19,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393894395] [2025-01-09 20:40:19,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393894395] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:40:19,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:40:19,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 20:40:19,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820996300] [2025-01-09 20:40:19,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:40:19,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 20:40:19,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:40:19,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 20:40:19,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 20:40:19,810 INFO L87 Difference]: Start difference. First operand has 467 states, 441 states have (on average 1.6213151927437641) internal successors, (715), 458 states have internal predecessors, (715), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 20:40:19,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:40:19,853 INFO L93 Difference]: Finished difference Result 932 states and 1525 transitions. [2025-01-09 20:40:19,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 20:40:19,854 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-01-09 20:40:19,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:40:19,865 INFO L225 Difference]: With dead ends: 932 [2025-01-09 20:40:19,865 INFO L226 Difference]: Without dead ends: 430 [2025-01-09 20:40:19,870 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 20:40:19,875 INFO L435 NwaCegarLoop]: 683 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 683 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:40:19,876 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 683 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:40:19,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2025-01-09 20:40:19,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 430. [2025-01-09 20:40:19,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 405 states have (on average 1.4641975308641975) internal successors, (593), 421 states have internal predecessors, (593), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-09 20:40:19,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 633 transitions. [2025-01-09 20:40:19,915 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 633 transitions. Word has length 9 [2025-01-09 20:40:19,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:40:19,915 INFO L471 AbstractCegarLoop]: Abstraction has 430 states and 633 transitions. [2025-01-09 20:40:19,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 20:40:19,915 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 633 transitions. [2025-01-09 20:40:19,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-09 20:40:19,917 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:40:19,917 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:40:19,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 20:40:19,917 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:40:19,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:40:19,918 INFO L85 PathProgramCache]: Analyzing trace with hash -739758881, now seen corresponding path program 1 times [2025-01-09 20:40:19,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:40:19,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912312936] [2025-01-09 20:40:19,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:40:19,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:40:19,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 20:40:19,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 20:40:19,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:40:19,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:40:20,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:40:20,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:40:20,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912312936] [2025-01-09 20:40:20,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912312936] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:40:20,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:40:20,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:40:20,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693453127] [2025-01-09 20:40:20,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:40:20,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:40:20,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:40:20,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:40:20,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:40:20,298 INFO L87 Difference]: Start difference. First operand 430 states and 633 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 20:40:20,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:40:20,394 INFO L93 Difference]: Finished difference Result 1040 states and 1532 transitions. [2025-01-09 20:40:20,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:40:20,394 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2025-01-09 20:40:20,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:40:20,397 INFO L225 Difference]: With dead ends: 1040 [2025-01-09 20:40:20,398 INFO L226 Difference]: Without dead ends: 813 [2025-01-09 20:40:20,398 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:40:20,399 INFO L435 NwaCegarLoop]: 614 mSDtfsCounter, 545 mSDsluCounter, 1220 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 550 SdHoareTripleChecker+Valid, 1834 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 20:40:20,399 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [550 Valid, 1834 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 20:40:20,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2025-01-09 20:40:20,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 432. [2025-01-09 20:40:20,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 407 states have (on average 1.461916461916462) internal successors, (595), 423 states have internal predecessors, (595), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-09 20:40:20,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 635 transitions. [2025-01-09 20:40:20,417 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 635 transitions. Word has length 63 [2025-01-09 20:40:20,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:40:20,417 INFO L471 AbstractCegarLoop]: Abstraction has 432 states and 635 transitions. [2025-01-09 20:40:20,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 20:40:20,417 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 635 transitions. [2025-01-09 20:40:20,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-01-09 20:40:20,419 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:40:20,419 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:40:20,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 20:40:20,419 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:40:20,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:40:20,424 INFO L85 PathProgramCache]: Analyzing trace with hash -113861570, now seen corresponding path program 1 times [2025-01-09 20:40:20,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:40:20,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618766198] [2025-01-09 20:40:20,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:40:20,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:40:20,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-01-09 20:40:20,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-01-09 20:40:20,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:40:20,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:40:20,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:40:20,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:40:20,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618766198] [2025-01-09 20:40:20,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618766198] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:40:20,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:40:20,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 20:40:20,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016249714] [2025-01-09 20:40:20,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:40:20,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 20:40:20,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:40:20,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 20:40:20,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:40:20,665 INFO L87 Difference]: Start difference. First operand 432 states and 635 transitions. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 20:40:20,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:40:20,750 INFO L93 Difference]: Finished difference Result 818 states and 1200 transitions. [2025-01-09 20:40:20,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 20:40:20,751 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2025-01-09 20:40:20,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:40:20,753 INFO L225 Difference]: With dead ends: 818 [2025-01-09 20:40:20,753 INFO L226 Difference]: Without dead ends: 390 [2025-01-09 20:40:20,753 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:40:20,754 INFO L435 NwaCegarLoop]: 529 mSDtfsCounter, 33 mSDsluCounter, 1044 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 1573 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 20:40:20,754 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 1573 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 20:40:20,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2025-01-09 20:40:20,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 390. [2025-01-09 20:40:20,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 365 states have (on average 1.4191780821917808) internal successors, (518), 381 states have internal predecessors, (518), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-09 20:40:20,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 558 transitions. [2025-01-09 20:40:20,772 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 558 transitions. Word has length 85 [2025-01-09 20:40:20,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:40:20,773 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 558 transitions. [2025-01-09 20:40:20,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 20:40:20,774 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 558 transitions. [2025-01-09 20:40:20,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-01-09 20:40:20,775 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:40:20,775 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:40:20,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 20:40:20,776 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:40:20,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:40:20,778 INFO L85 PathProgramCache]: Analyzing trace with hash -226195348, now seen corresponding path program 1 times [2025-01-09 20:40:20,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:40:20,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901101662] [2025-01-09 20:40:20,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:40:20,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:40:20,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-01-09 20:40:20,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-01-09 20:40:20,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:40:20,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:40:20,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:40:20,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:40:20,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901101662] [2025-01-09 20:40:20,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901101662] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:40:20,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:40:20,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:40:20,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142564439] [2025-01-09 20:40:20,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:40:20,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:40:20,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:40:20,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:40:20,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:40:20,935 INFO L87 Difference]: Start difference. First operand 390 states and 558 transitions. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 20:40:20,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:40:20,993 INFO L93 Difference]: Finished difference Result 770 states and 1106 transitions. [2025-01-09 20:40:20,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 20:40:20,994 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2025-01-09 20:40:20,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:40:20,996 INFO L225 Difference]: With dead ends: 770 [2025-01-09 20:40:20,996 INFO L226 Difference]: Without dead ends: 384 [2025-01-09 20:40:20,997 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:40:20,998 INFO L435 NwaCegarLoop]: 531 mSDtfsCounter, 9 mSDsluCounter, 1043 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1574 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:40:20,999 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1574 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:40:21,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2025-01-09 20:40:21,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 384. [2025-01-09 20:40:21,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 359 states have (on average 1.415041782729805) internal successors, (508), 375 states have internal predecessors, (508), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-09 20:40:21,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 548 transitions. [2025-01-09 20:40:21,015 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 548 transitions. Word has length 85 [2025-01-09 20:40:21,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:40:21,015 INFO L471 AbstractCegarLoop]: Abstraction has 384 states and 548 transitions. [2025-01-09 20:40:21,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 20:40:21,016 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 548 transitions. [2025-01-09 20:40:21,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-01-09 20:40:21,019 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:40:21,019 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:40:21,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 20:40:21,019 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:40:21,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:40:21,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1778442124, now seen corresponding path program 1 times [2025-01-09 20:40:21,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:40:21,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141965309] [2025-01-09 20:40:21,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:40:21,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:40:21,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-01-09 20:40:21,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-01-09 20:40:21,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:40:21,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:40:21,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:40:21,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:40:21,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141965309] [2025-01-09 20:40:21,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141965309] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:40:21,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:40:21,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 20:40:21,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539408238] [2025-01-09 20:40:21,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:40:21,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 20:40:21,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:40:21,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 20:40:21,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 20:40:21,155 INFO L87 Difference]: Start difference. First operand 384 states and 548 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 20:40:21,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:40:21,234 INFO L93 Difference]: Finished difference Result 1009 states and 1443 transitions. [2025-01-09 20:40:21,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 20:40:21,235 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2025-01-09 20:40:21,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:40:21,239 INFO L225 Difference]: With dead ends: 1009 [2025-01-09 20:40:21,239 INFO L226 Difference]: Without dead ends: 629 [2025-01-09 20:40:21,241 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 20:40:21,242 INFO L435 NwaCegarLoop]: 733 mSDtfsCounter, 290 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 1256 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 20:40:21,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 1256 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 20:40:21,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2025-01-09 20:40:21,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 626. [2025-01-09 20:40:21,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 626 states, 600 states have (on average 1.4216666666666666) internal successors, (853), 616 states have internal predecessors, (853), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2025-01-09 20:40:21,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 895 transitions. [2025-01-09 20:40:21,255 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 895 transitions. Word has length 85 [2025-01-09 20:40:21,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:40:21,255 INFO L471 AbstractCegarLoop]: Abstraction has 626 states and 895 transitions. [2025-01-09 20:40:21,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 20:40:21,255 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 895 transitions. [2025-01-09 20:40:21,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-09 20:40:21,256 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:40:21,256 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 20:40:21,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 20:40:21,256 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:40:21,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:40:21,257 INFO L85 PathProgramCache]: Analyzing trace with hash -200124673, now seen corresponding path program 1 times [2025-01-09 20:40:21,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:40:21,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430887253] [2025-01-09 20:40:21,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:40:21,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:40:21,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 20:40:21,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 20:40:21,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:40:21,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:40:21,547 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 20:40:21,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:40:21,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430887253] [2025-01-09 20:40:21,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430887253] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 20:40:21,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [211921736] [2025-01-09 20:40:21,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:40:21,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:40:21,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:40:21,550 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 20:40:21,552 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 20:40:21,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 20:40:21,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 20:40:21,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:40:21,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:40:21,819 INFO L256 TraceCheckSpWp]: Trace formula consists of 573 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-01-09 20:40:21,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 20:40:21,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 20:40:21,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2025-01-09 20:40:22,614 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 20:40:22,614 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 20:40:22,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [211921736] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:40:22,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 20:40:22,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [4] total 13 [2025-01-09 20:40:22,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998050537] [2025-01-09 20:40:22,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:40:22,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 20:40:22,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:40:22,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 20:40:22,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-01-09 20:40:22,616 INFO L87 Difference]: Start difference. First operand 626 states and 895 transitions. Second operand has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:40:24,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:40:24,036 INFO L93 Difference]: Finished difference Result 1497 states and 2151 transitions. [2025-01-09 20:40:24,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 20:40:24,037 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 100 [2025-01-09 20:40:24,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:40:24,042 INFO L225 Difference]: With dead ends: 1497 [2025-01-09 20:40:24,042 INFO L226 Difference]: Without dead ends: 909 [2025-01-09 20:40:24,043 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2025-01-09 20:40:24,044 INFO L435 NwaCegarLoop]: 512 mSDtfsCounter, 554 mSDsluCounter, 3075 mSDsCounter, 0 mSdLazyCounter, 785 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 558 SdHoareTripleChecker+Valid, 3587 SdHoareTripleChecker+Invalid, 790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 785 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 20:40:24,044 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [558 Valid, 3587 Invalid, 790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 785 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 20:40:24,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2025-01-09 20:40:24,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 626. [2025-01-09 20:40:24,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 626 states, 600 states have (on average 1.42) internal successors, (852), 616 states have internal predecessors, (852), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2025-01-09 20:40:24,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 894 transitions. [2025-01-09 20:40:24,072 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 894 transitions. Word has length 100 [2025-01-09 20:40:24,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:40:24,072 INFO L471 AbstractCegarLoop]: Abstraction has 626 states and 894 transitions. [2025-01-09 20:40:24,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:40:24,072 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 894 transitions. [2025-01-09 20:40:24,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-01-09 20:40:24,073 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:40:24,073 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 20:40:24,084 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 20:40:24,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:40:24,274 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:40:24,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:40:24,274 INFO L85 PathProgramCache]: Analyzing trace with hash -309535791, now seen corresponding path program 1 times [2025-01-09 20:40:24,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:40:24,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819058703] [2025-01-09 20:40:24,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:40:24,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:40:24,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 20:40:24,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 20:40:24,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:40:24,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:40:24,532 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 20:40:24,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:40:24,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819058703] [2025-01-09 20:40:24,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819058703] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 20:40:24,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [750342075] [2025-01-09 20:40:24,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:40:24,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:40:24,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:40:24,535 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 20:40:24,536 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 20:40:24,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 20:40:24,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 20:40:24,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:40:24,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:40:24,932 INFO L256 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 20:40:24,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 20:40:24,969 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 20:40:24,970 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 20:40:24,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [750342075] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:40:24,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 20:40:24,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-01-09 20:40:24,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300295262] [2025-01-09 20:40:24,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:40:24,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:40:24,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:40:24,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:40:24,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 20:40:24,971 INFO L87 Difference]: Start difference. First operand 626 states and 894 transitions. Second operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:40:25,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:40:25,058 INFO L93 Difference]: Finished difference Result 1214 states and 1748 transitions. [2025-01-09 20:40:25,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:40:25,059 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 101 [2025-01-09 20:40:25,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:40:25,061 INFO L225 Difference]: With dead ends: 1214 [2025-01-09 20:40:25,061 INFO L226 Difference]: Without dead ends: 626 [2025-01-09 20:40:25,062 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 20:40:25,062 INFO L435 NwaCegarLoop]: 536 mSDtfsCounter, 13 mSDsluCounter, 948 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 1484 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 20:40:25,062 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 1484 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 20:40:25,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2025-01-09 20:40:25,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2025-01-09 20:40:25,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 626 states, 600 states have (on average 1.4166666666666667) internal successors, (850), 616 states have internal predecessors, (850), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2025-01-09 20:40:25,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 892 transitions. [2025-01-09 20:40:25,076 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 892 transitions. Word has length 101 [2025-01-09 20:40:25,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:40:25,076 INFO L471 AbstractCegarLoop]: Abstraction has 626 states and 892 transitions. [2025-01-09 20:40:25,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:40:25,076 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 892 transitions. [2025-01-09 20:40:25,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-01-09 20:40:25,077 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:40:25,077 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 20:40:25,088 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 20:40:25,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:40:25,278 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:40:25,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:40:25,278 INFO L85 PathProgramCache]: Analyzing trace with hash 911251930, now seen corresponding path program 1 times [2025-01-09 20:40:25,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:40:25,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675439349] [2025-01-09 20:40:25,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:40:25,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:40:25,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-01-09 20:40:25,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-01-09 20:40:25,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:40:25,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:40:25,514 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 20:40:25,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:40:25,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675439349] [2025-01-09 20:40:25,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675439349] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:40:25,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:40:25,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 20:40:25,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280712004] [2025-01-09 20:40:25,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:40:25,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 20:40:25,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:40:25,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 20:40:25,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 20:40:25,516 INFO L87 Difference]: Start difference. First operand 626 states and 892 transitions. Second operand has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:40:25,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:40:25,707 INFO L93 Difference]: Finished difference Result 1217 states and 1750 transitions. [2025-01-09 20:40:25,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 20:40:25,709 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 102 [2025-01-09 20:40:25,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:40:25,711 INFO L225 Difference]: With dead ends: 1217 [2025-01-09 20:40:25,711 INFO L226 Difference]: Without dead ends: 632 [2025-01-09 20:40:25,712 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 20:40:25,712 INFO L435 NwaCegarLoop]: 535 mSDtfsCounter, 4 mSDsluCounter, 1849 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2384 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 20:40:25,713 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2384 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 20:40:25,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2025-01-09 20:40:25,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 632. [2025-01-09 20:40:25,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 632 states, 606 states have (on average 1.4125412541254125) internal successors, (856), 622 states have internal predecessors, (856), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2025-01-09 20:40:25,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 898 transitions. [2025-01-09 20:40:25,724 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 898 transitions. Word has length 102 [2025-01-09 20:40:25,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:40:25,724 INFO L471 AbstractCegarLoop]: Abstraction has 632 states and 898 transitions. [2025-01-09 20:40:25,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:40:25,725 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 898 transitions. [2025-01-09 20:40:25,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-01-09 20:40:25,725 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:40:25,725 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 20:40:25,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 20:40:25,725 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:40:25,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:40:25,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1578219882, now seen corresponding path program 1 times [2025-01-09 20:40:25,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:40:25,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398459466] [2025-01-09 20:40:25,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:40:25,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:40:25,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-09 20:40:25,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-09 20:40:25,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:40:25,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:40:25,963 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 20:40:25,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:40:25,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398459466] [2025-01-09 20:40:25,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398459466] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:40:25,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:40:25,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 20:40:25,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898895277] [2025-01-09 20:40:25,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:40:25,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 20:40:25,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:40:25,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 20:40:25,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 20:40:25,964 INFO L87 Difference]: Start difference. First operand 632 states and 898 transitions. Second operand has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:40:26,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:40:26,202 INFO L93 Difference]: Finished difference Result 1223 states and 1754 transitions. [2025-01-09 20:40:26,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 20:40:26,203 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 103 [2025-01-09 20:40:26,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:40:26,206 INFO L225 Difference]: With dead ends: 1223 [2025-01-09 20:40:26,206 INFO L226 Difference]: Without dead ends: 642 [2025-01-09 20:40:26,207 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 20:40:26,208 INFO L435 NwaCegarLoop]: 525 mSDtfsCounter, 8 mSDsluCounter, 2310 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2835 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 20:40:26,208 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2835 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 20:40:26,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2025-01-09 20:40:26,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 640. [2025-01-09 20:40:26,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 640 states, 614 states have (on average 1.4104234527687296) internal successors, (866), 630 states have internal predecessors, (866), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2025-01-09 20:40:26,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 908 transitions. [2025-01-09 20:40:26,226 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 908 transitions. Word has length 103 [2025-01-09 20:40:26,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:40:26,226 INFO L471 AbstractCegarLoop]: Abstraction has 640 states and 908 transitions. [2025-01-09 20:40:26,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:40:26,227 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 908 transitions. [2025-01-09 20:40:26,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-01-09 20:40:26,228 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:40:26,228 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 20:40:26,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 20:40:26,229 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:40:26,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:40:26,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1150498126, now seen corresponding path program 1 times [2025-01-09 20:40:26,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:40:26,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209767557] [2025-01-09 20:40:26,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:40:26,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:40:26,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-09 20:40:26,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-09 20:40:26,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:40:26,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:40:26,470 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 20:40:26,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:40:26,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209767557] [2025-01-09 20:40:26,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209767557] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 20:40:26,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [905630808] [2025-01-09 20:40:26,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:40:26,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:40:26,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:40:26,477 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 20:40:26,480 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 20:40:26,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-09 20:40:26,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-09 20:40:26,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:40:26,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:40:26,759 INFO L256 TraceCheckSpWp]: Trace formula consists of 573 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 20:40:26,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 20:40:26,779 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:40:26,782 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 20:40:26,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [905630808] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:40:26,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 20:40:26,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2025-01-09 20:40:26,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845715067] [2025-01-09 20:40:26,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:40:26,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:40:26,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:40:26,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:40:26,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:40:26,784 INFO L87 Difference]: Start difference. First operand 640 states and 908 transitions. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 20:40:26,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:40:26,811 INFO L93 Difference]: Finished difference Result 1191 states and 1704 transitions. [2025-01-09 20:40:26,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:40:26,816 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 103 [2025-01-09 20:40:26,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:40:26,819 INFO L225 Difference]: With dead ends: 1191 [2025-01-09 20:40:26,819 INFO L226 Difference]: Without dead ends: 643 [2025-01-09 20:40:26,820 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:40:26,820 INFO L435 NwaCegarLoop]: 542 mSDtfsCounter, 0 mSDsluCounter, 1080 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1622 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:40:26,821 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1622 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:40:26,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2025-01-09 20:40:26,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 643. [2025-01-09 20:40:26,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 643 states, 616 states have (on average 1.4107142857142858) internal successors, (869), 633 states have internal predecessors, (869), 21 states have call successors, (21), 3 states have call predecessors, (21), 4 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2025-01-09 20:40:26,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 912 transitions. [2025-01-09 20:40:26,836 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 912 transitions. Word has length 103 [2025-01-09 20:40:26,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:40:26,837 INFO L471 AbstractCegarLoop]: Abstraction has 643 states and 912 transitions. [2025-01-09 20:40:26,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 20:40:26,837 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 912 transitions. [2025-01-09 20:40:26,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-01-09 20:40:26,837 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:40:26,837 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 20:40:26,847 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 20:40:27,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:40:27,038 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:40:27,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:40:27,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1884867180, now seen corresponding path program 1 times [2025-01-09 20:40:27,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:40:27,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491088906] [2025-01-09 20:40:27,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:40:27,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:40:27,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 20:40:27,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 20:40:27,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:40:27,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:40:27,329 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 20:40:27,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:40:27,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491088906] [2025-01-09 20:40:27,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491088906] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 20:40:27,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1302187159] [2025-01-09 20:40:27,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:40:27,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:40:27,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:40:27,335 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 20:40:27,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 20:40:27,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 20:40:27,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 20:40:27,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:40:27,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:40:27,780 INFO L256 TraceCheckSpWp]: Trace formula consists of 603 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-09 20:40:27,785 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 20:40:28,066 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-09 20:40:28,066 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 20:40:28,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1302187159] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:40:28,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 20:40:28,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 10 [2025-01-09 20:40:28,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860242662] [2025-01-09 20:40:28,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:40:28,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 20:40:28,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:40:28,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 20:40:28,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-01-09 20:40:28,067 INFO L87 Difference]: Start difference. First operand 643 states and 912 transitions. Second operand has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:40:28,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:40:28,327 INFO L93 Difference]: Finished difference Result 1241 states and 1777 transitions. [2025-01-09 20:40:28,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 20:40:28,328 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 105 [2025-01-09 20:40:28,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:40:28,330 INFO L225 Difference]: With dead ends: 1241 [2025-01-09 20:40:28,330 INFO L226 Difference]: Without dead ends: 653 [2025-01-09 20:40:28,331 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-01-09 20:40:28,332 INFO L435 NwaCegarLoop]: 531 mSDtfsCounter, 8 mSDsluCounter, 2311 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2842 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 20:40:28,333 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2842 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 20:40:28,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2025-01-09 20:40:28,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 643. [2025-01-09 20:40:28,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 643 states, 616 states have (on average 1.4107142857142858) internal successors, (869), 633 states have internal predecessors, (869), 21 states have call successors, (21), 3 states have call predecessors, (21), 4 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2025-01-09 20:40:28,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 912 transitions. [2025-01-09 20:40:28,348 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 912 transitions. Word has length 105 [2025-01-09 20:40:28,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:40:28,349 INFO L471 AbstractCegarLoop]: Abstraction has 643 states and 912 transitions. [2025-01-09 20:40:28,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:40:28,349 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 912 transitions. [2025-01-09 20:40:28,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-01-09 20:40:28,349 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:40:28,350 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 20:40:28,363 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 20:40:28,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-01-09 20:40:28,550 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:40:28,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:40:28,551 INFO L85 PathProgramCache]: Analyzing trace with hash -767986932, now seen corresponding path program 1 times [2025-01-09 20:40:28,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:40:28,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316090437] [2025-01-09 20:40:28,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:40:28,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:40:28,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-01-09 20:40:28,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-01-09 20:40:28,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:40:28,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:40:28,803 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-09 20:40:28,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:40:28,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316090437] [2025-01-09 20:40:28,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316090437] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:40:28,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:40:28,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 20:40:28,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709294277] [2025-01-09 20:40:28,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:40:28,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 20:40:28,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:40:28,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 20:40:28,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-09 20:40:28,805 INFO L87 Difference]: Start difference. First operand 643 states and 912 transitions. Second operand has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:40:29,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:40:29,022 INFO L93 Difference]: Finished difference Result 1246 states and 1781 transitions. [2025-01-09 20:40:29,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 20:40:29,023 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 106 [2025-01-09 20:40:29,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:40:29,025 INFO L225 Difference]: With dead ends: 1246 [2025-01-09 20:40:29,025 INFO L226 Difference]: Without dead ends: 663 [2025-01-09 20:40:29,026 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-09 20:40:29,026 INFO L435 NwaCegarLoop]: 525 mSDtfsCounter, 16 mSDsluCounter, 2405 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 2930 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 20:40:29,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 2930 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 20:40:29,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2025-01-09 20:40:29,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 657. [2025-01-09 20:40:29,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 657 states, 630 states have (on average 1.407936507936508) internal successors, (887), 647 states have internal predecessors, (887), 21 states have call successors, (21), 3 states have call predecessors, (21), 4 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2025-01-09 20:40:29,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 930 transitions. [2025-01-09 20:40:29,040 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 930 transitions. Word has length 106 [2025-01-09 20:40:29,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:40:29,040 INFO L471 AbstractCegarLoop]: Abstraction has 657 states and 930 transitions. [2025-01-09 20:40:29,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:40:29,040 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 930 transitions. [2025-01-09 20:40:29,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-01-09 20:40:29,041 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:40:29,041 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 20:40:29,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 20:40:29,041 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:40:29,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:40:29,041 INFO L85 PathProgramCache]: Analyzing trace with hash 141147304, now seen corresponding path program 1 times [2025-01-09 20:40:29,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:40:29,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937894022] [2025-01-09 20:40:29,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:40:29,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:40:29,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-01-09 20:40:29,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-01-09 20:40:29,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:40:29,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:40:29,278 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 20:40:29,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:40:29,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937894022] [2025-01-09 20:40:29,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937894022] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 20:40:29,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [98821535] [2025-01-09 20:40:29,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:40:29,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:40:29,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:40:29,281 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 20:40:29,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 20:40:29,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-01-09 20:40:29,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-01-09 20:40:29,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:40:29,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:40:29,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 604 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-01-09 20:40:29,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 20:40:29,655 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-09 20:40:29,655 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 20:40:29,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [98821535] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:40:29,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 20:40:29,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [5] total 11 [2025-01-09 20:40:29,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453002651] [2025-01-09 20:40:29,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:40:29,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 20:40:29,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:40:29,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 20:40:29,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-01-09 20:40:29,656 INFO L87 Difference]: Start difference. First operand 657 states and 930 transitions. Second operand has 8 states, 8 states have (on average 12.0) internal successors, (96), 8 states have internal predecessors, (96), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:40:29,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:40:29,961 INFO L93 Difference]: Finished difference Result 1267 states and 1808 transitions. [2025-01-09 20:40:29,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 20:40:29,961 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 8 states have internal predecessors, (96), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 106 [2025-01-09 20:40:29,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:40:29,963 INFO L225 Difference]: With dead ends: 1267 [2025-01-09 20:40:29,963 INFO L226 Difference]: Without dead ends: 677 [2025-01-09 20:40:29,964 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-01-09 20:40:29,965 INFO L435 NwaCegarLoop]: 532 mSDtfsCounter, 31 mSDsluCounter, 2811 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 3343 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 20:40:29,966 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 3343 Invalid, 489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 485 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 20:40:29,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2025-01-09 20:40:29,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 667. [2025-01-09 20:40:29,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 667 states, 640 states have (on average 1.4046875) internal successors, (899), 657 states have internal predecessors, (899), 21 states have call successors, (21), 3 states have call predecessors, (21), 4 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2025-01-09 20:40:29,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 942 transitions. [2025-01-09 20:40:29,982 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 942 transitions. Word has length 106 [2025-01-09 20:40:29,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:40:29,982 INFO L471 AbstractCegarLoop]: Abstraction has 667 states and 942 transitions. [2025-01-09 20:40:29,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 8 states have internal predecessors, (96), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:40:29,982 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 942 transitions. [2025-01-09 20:40:29,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-01-09 20:40:29,985 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:40:29,985 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 20:40:29,996 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 20:40:30,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-01-09 20:40:30,186 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:40:30,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:40:30,187 INFO L85 PathProgramCache]: Analyzing trace with hash -571530724, now seen corresponding path program 1 times [2025-01-09 20:40:30,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:40:30,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041800404] [2025-01-09 20:40:30,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:40:30,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:40:30,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-09 20:40:30,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-09 20:40:30,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:40:30,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:40:30,463 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-09 20:40:30,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:40:30,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041800404] [2025-01-09 20:40:30,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041800404] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:40:30,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:40:30,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 20:40:30,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818886948] [2025-01-09 20:40:30,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:40:30,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 20:40:30,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:40:30,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 20:40:30,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-01-09 20:40:30,466 INFO L87 Difference]: Start difference. First operand 667 states and 942 transitions. Second operand has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:40:30,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:40:30,857 INFO L93 Difference]: Finished difference Result 1285 states and 1832 transitions. [2025-01-09 20:40:30,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 20:40:30,858 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 107 [2025-01-09 20:40:30,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:40:30,860 INFO L225 Difference]: With dead ends: 1285 [2025-01-09 20:40:30,860 INFO L226 Difference]: Without dead ends: 685 [2025-01-09 20:40:30,861 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-01-09 20:40:30,861 INFO L435 NwaCegarLoop]: 532 mSDtfsCounter, 19 mSDsluCounter, 3756 mSDsCounter, 0 mSdLazyCounter, 712 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 4288 SdHoareTripleChecker+Invalid, 713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 20:40:30,862 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 4288 Invalid, 713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 712 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 20:40:30,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2025-01-09 20:40:30,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 673. [2025-01-09 20:40:30,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 673 states, 646 states have (on average 1.4009287925696594) internal successors, (905), 663 states have internal predecessors, (905), 21 states have call successors, (21), 3 states have call predecessors, (21), 4 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2025-01-09 20:40:30,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 948 transitions. [2025-01-09 20:40:30,881 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 948 transitions. Word has length 107 [2025-01-09 20:40:30,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:40:30,881 INFO L471 AbstractCegarLoop]: Abstraction has 673 states and 948 transitions. [2025-01-09 20:40:30,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:40:30,882 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 948 transitions. [2025-01-09 20:40:30,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-01-09 20:40:30,883 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:40:30,883 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 20:40:30,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 20:40:30,884 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:40:30,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:40:30,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1841826816, now seen corresponding path program 1 times [2025-01-09 20:40:30,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:40:30,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623108118] [2025-01-09 20:40:30,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:40:30,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:40:30,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-09 20:40:31,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-09 20:40:31,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:40:31,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:40:31,138 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 20:40:31,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:40:31,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623108118] [2025-01-09 20:40:31,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623108118] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 20:40:31,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [977765761] [2025-01-09 20:40:31,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:40:31,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:40:31,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:40:31,142 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 20:40:31,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 20:40:31,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-09 20:40:31,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-09 20:40:31,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:40:31,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:40:31,500 INFO L256 TraceCheckSpWp]: Trace formula consists of 605 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-01-09 20:40:31,502 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 20:40:31,789 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-09 20:40:31,790 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 20:40:31,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [977765761] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:40:31,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 20:40:31,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 12 [2025-01-09 20:40:31,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037945312] [2025-01-09 20:40:31,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:40:31,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 20:40:31,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:40:31,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 20:40:31,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-01-09 20:40:31,791 INFO L87 Difference]: Start difference. First operand 673 states and 948 transitions. Second operand has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:40:32,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:40:32,815 INFO L93 Difference]: Finished difference Result 1276 states and 1814 transitions. [2025-01-09 20:40:32,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 20:40:32,815 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 107 [2025-01-09 20:40:32,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:40:32,818 INFO L225 Difference]: With dead ends: 1276 [2025-01-09 20:40:32,818 INFO L226 Difference]: Without dead ends: 673 [2025-01-09 20:40:32,818 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-01-09 20:40:32,819 INFO L435 NwaCegarLoop]: 530 mSDtfsCounter, 7 mSDsluCounter, 3213 mSDsCounter, 0 mSdLazyCounter, 617 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 3743 SdHoareTripleChecker+Invalid, 618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:40:32,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 3743 Invalid, 618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 617 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 20:40:32,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2025-01-09 20:40:32,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 669. [2025-01-09 20:40:32,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 669 states, 642 states have (on average 1.4003115264797508) internal successors, (899), 659 states have internal predecessors, (899), 21 states have call successors, (21), 3 states have call predecessors, (21), 4 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2025-01-09 20:40:32,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 669 states and 942 transitions. [2025-01-09 20:40:32,831 INFO L78 Accepts]: Start accepts. Automaton has 669 states and 942 transitions. Word has length 107 [2025-01-09 20:40:32,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:40:32,831 INFO L471 AbstractCegarLoop]: Abstraction has 669 states and 942 transitions. [2025-01-09 20:40:32,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:40:32,832 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 942 transitions. [2025-01-09 20:40:32,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-01-09 20:40:32,832 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:40:32,833 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 20:40:32,846 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-09 20:40:33,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-01-09 20:40:33,037 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:40:33,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:40:33,038 INFO L85 PathProgramCache]: Analyzing trace with hash 2115581056, now seen corresponding path program 1 times [2025-01-09 20:40:33,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:40:33,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297576402] [2025-01-09 20:40:33,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:40:33,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:40:33,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-09 20:40:33,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-09 20:40:33,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:40:33,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:40:33,265 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 20:40:33,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:40:33,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297576402] [2025-01-09 20:40:33,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297576402] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 20:40:33,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1615865288] [2025-01-09 20:40:33,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:40:33,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:40:33,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:40:33,270 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 20:40:33,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-09 20:40:33,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-09 20:40:33,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-09 20:40:33,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:40:33,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:40:33,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 605 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-09 20:40:33,598 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 20:40:33,670 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-09 20:40:33,670 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 20:40:33,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1615865288] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:40:33,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 20:40:33,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 10 [2025-01-09 20:40:33,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686583639] [2025-01-09 20:40:33,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:40:33,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 20:40:33,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:40:33,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 20:40:33,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-01-09 20:40:33,671 INFO L87 Difference]: Start difference. First operand 669 states and 942 transitions. Second operand has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 7 states have internal predecessors, (97), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:40:33,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:40:33,894 INFO L93 Difference]: Finished difference Result 1275 states and 1814 transitions. [2025-01-09 20:40:33,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 20:40:33,894 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 7 states have internal predecessors, (97), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 107 [2025-01-09 20:40:33,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:40:33,896 INFO L225 Difference]: With dead ends: 1275 [2025-01-09 20:40:33,897 INFO L226 Difference]: Without dead ends: 679 [2025-01-09 20:40:33,897 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-01-09 20:40:33,898 INFO L435 NwaCegarLoop]: 519 mSDtfsCounter, 30 mSDsluCounter, 2335 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 2854 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 20:40:33,899 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 2854 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 20:40:33,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2025-01-09 20:40:33,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 673. [2025-01-09 20:40:33,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 673 states, 646 states have (on average 1.3978328173374612) internal successors, (903), 663 states have internal predecessors, (903), 21 states have call successors, (21), 3 states have call predecessors, (21), 4 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2025-01-09 20:40:33,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 946 transitions. [2025-01-09 20:40:33,911 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 946 transitions. Word has length 107 [2025-01-09 20:40:33,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:40:33,912 INFO L471 AbstractCegarLoop]: Abstraction has 673 states and 946 transitions. [2025-01-09 20:40:33,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 7 states have internal predecessors, (97), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:40:33,912 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 946 transitions. [2025-01-09 20:40:33,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-01-09 20:40:33,913 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:40:33,913 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 20:40:33,925 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-01-09 20:40:34,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:40:34,114 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:40:34,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:40:34,115 INFO L85 PathProgramCache]: Analyzing trace with hash 638326791, now seen corresponding path program 1 times [2025-01-09 20:40:34,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:40:34,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094396869] [2025-01-09 20:40:34,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:40:34,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:40:34,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-09 20:40:34,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-09 20:40:34,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:40:34,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:40:34,316 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 20:40:34,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:40:34,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094396869] [2025-01-09 20:40:34,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094396869] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 20:40:34,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1240680784] [2025-01-09 20:40:34,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:40:34,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:40:34,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:40:34,320 INFO L229 MonitoredProcess]: Starting monitored process 9 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 20:40:34,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-09 20:40:34,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-09 20:40:34,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-09 20:40:34,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:40:34,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:40:34,673 INFO L256 TraceCheckSpWp]: Trace formula consists of 605 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 20:40:34,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 20:40:34,692 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 20:40:34,693 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 20:40:34,740 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 20:40:34,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1240680784] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 20:40:34,740 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 20:40:34,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-01-09 20:40:34,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396758415] [2025-01-09 20:40:34,740 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 20:40:34,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 20:40:34,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:40:34,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 20:40:34,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-01-09 20:40:34,741 INFO L87 Difference]: Start difference. First operand 673 states and 946 transitions. Second operand has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 9 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-09 20:40:34,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:40:34,815 INFO L93 Difference]: Finished difference Result 1250 states and 1776 transitions. [2025-01-09 20:40:34,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 20:40:34,815 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 9 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 107 [2025-01-09 20:40:34,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:40:34,818 INFO L225 Difference]: With dead ends: 1250 [2025-01-09 20:40:34,818 INFO L226 Difference]: Without dead ends: 684 [2025-01-09 20:40:34,819 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=77, Unknown=0, NotChecked=0, Total=132 [2025-01-09 20:40:34,819 INFO L435 NwaCegarLoop]: 542 mSDtfsCounter, 4 mSDsluCounter, 1620 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2162 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:40:34,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2162 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:40:34,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2025-01-09 20:40:34,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 682. [2025-01-09 20:40:34,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 682 states, 654 states have (on average 1.4021406727828747) internal successors, (917), 671 states have internal predecessors, (917), 21 states have call successors, (21), 4 states have call predecessors, (21), 5 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2025-01-09 20:40:34,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 960 transitions. [2025-01-09 20:40:34,831 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 960 transitions. Word has length 107 [2025-01-09 20:40:34,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:40:34,831 INFO L471 AbstractCegarLoop]: Abstraction has 682 states and 960 transitions. [2025-01-09 20:40:34,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 9 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-09 20:40:34,831 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 960 transitions. [2025-01-09 20:40:34,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-01-09 20:40:34,832 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:40:34,832 INFO L218 NwaCegarLoop]: trace histogram [6, 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] [2025-01-09 20:40:34,841 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-01-09 20:40:35,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-01-09 20:40:35,033 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:40:35,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:40:35,033 INFO L85 PathProgramCache]: Analyzing trace with hash -689899479, now seen corresponding path program 2 times [2025-01-09 20:40:35,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:40:35,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310758680] [2025-01-09 20:40:35,034 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 20:40:35,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:40:35,062 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 111 statements into 2 equivalence classes. [2025-01-09 20:40:35,075 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 98 of 111 statements. [2025-01-09 20:40:35,076 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 20:40:35,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:40:35,226 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-01-09 20:40:35,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:40:35,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310758680] [2025-01-09 20:40:35,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310758680] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:40:35,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:40:35,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 20:40:35,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487882843] [2025-01-09 20:40:35,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:40:35,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 20:40:35,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:40:35,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 20:40:35,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 20:40:35,228 INFO L87 Difference]: Start difference. First operand 682 states and 960 transitions. Second operand has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 7 states have internal predecessors, (97), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:40:35,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:40:35,471 INFO L93 Difference]: Finished difference Result 1302 states and 1853 transitions. [2025-01-09 20:40:35,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 20:40:35,471 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 7 states have internal predecessors, (97), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 111 [2025-01-09 20:40:35,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:40:35,474 INFO L225 Difference]: With dead ends: 1302 [2025-01-09 20:40:35,474 INFO L226 Difference]: Without dead ends: 688 [2025-01-09 20:40:35,475 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 20:40:35,475 INFO L435 NwaCegarLoop]: 530 mSDtfsCounter, 4 mSDsluCounter, 2294 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2824 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 20:40:35,475 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2824 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 20:40:35,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2025-01-09 20:40:35,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 688. [2025-01-09 20:40:35,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 688 states, 660 states have (on average 1.3984848484848484) internal successors, (923), 677 states have internal predecessors, (923), 21 states have call successors, (21), 4 states have call predecessors, (21), 5 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2025-01-09 20:40:35,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 966 transitions. [2025-01-09 20:40:35,488 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 966 transitions. Word has length 111 [2025-01-09 20:40:35,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:40:35,488 INFO L471 AbstractCegarLoop]: Abstraction has 688 states and 966 transitions. [2025-01-09 20:40:35,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 7 states have internal predecessors, (97), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:40:35,488 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 966 transitions. [2025-01-09 20:40:35,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-01-09 20:40:35,488 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:40:35,489 INFO L218 NwaCegarLoop]: trace histogram [6, 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] [2025-01-09 20:40:35,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 20:40:35,490 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:40:35,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:40:35,490 INFO L85 PathProgramCache]: Analyzing trace with hash -630073173, now seen corresponding path program 1 times [2025-01-09 20:40:35,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:40:35,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493343159] [2025-01-09 20:40:35,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:40:35,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:40:35,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 20:40:35,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 20:40:35,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:40:35,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:40:35,774 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 20:40:35,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:40:35,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493343159] [2025-01-09 20:40:35,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493343159] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 20:40:35,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [48607173] [2025-01-09 20:40:35,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:40:35,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:40:35,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:40:35,782 INFO L229 MonitoredProcess]: Starting monitored process 10 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 20:40:35,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-09 20:40:36,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 20:40:36,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 20:40:36,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:40:36,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:40:36,146 INFO L256 TraceCheckSpWp]: Trace formula consists of 666 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-01-09 20:40:36,148 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 20:40:36,243 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 3 proven. 25 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 20:40:36,243 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 20:40:36,343 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-09 20:40:36,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [48607173] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 20:40:36,343 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 20:40:36,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 6] total 19 [2025-01-09 20:40:36,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823864543] [2025-01-09 20:40:36,343 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 20:40:36,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-09 20:40:36,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:40:36,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-09 20:40:36,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2025-01-09 20:40:36,344 INFO L87 Difference]: Start difference. First operand 688 states and 966 transitions. Second operand has 19 states, 19 states have (on average 6.421052631578948) internal successors, (122), 19 states have internal predecessors, (122), 2 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 20:40:36,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:40:36,586 INFO L93 Difference]: Finished difference Result 1283 states and 1821 transitions. [2025-01-09 20:40:36,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-09 20:40:36,586 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 6.421052631578948) internal successors, (122), 19 states have internal predecessors, (122), 2 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 112 [2025-01-09 20:40:36,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:40:36,589 INFO L225 Difference]: With dead ends: 1283 [2025-01-09 20:40:36,589 INFO L226 Difference]: Without dead ends: 701 [2025-01-09 20:40:36,589 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=177, Invalid=473, Unknown=0, NotChecked=0, Total=650 [2025-01-09 20:40:36,590 INFO L435 NwaCegarLoop]: 532 mSDtfsCounter, 27 mSDsluCounter, 2652 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 3184 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 20:40:36,590 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 3184 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 20:40:36,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2025-01-09 20:40:36,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 695. [2025-01-09 20:40:36,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 695 states, 667 states have (on average 1.4002998500749626) internal successors, (934), 684 states have internal predecessors, (934), 21 states have call successors, (21), 4 states have call predecessors, (21), 5 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2025-01-09 20:40:36,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 695 states and 977 transitions. [2025-01-09 20:40:36,601 INFO L78 Accepts]: Start accepts. Automaton has 695 states and 977 transitions. Word has length 112 [2025-01-09 20:40:36,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:40:36,601 INFO L471 AbstractCegarLoop]: Abstraction has 695 states and 977 transitions. [2025-01-09 20:40:36,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 6.421052631578948) internal successors, (122), 19 states have internal predecessors, (122), 2 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 20:40:36,602 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 977 transitions. [2025-01-09 20:40:36,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 20:40:36,602 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:40:36,602 INFO L218 NwaCegarLoop]: trace histogram [13, 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] [2025-01-09 20:40:36,611 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-01-09 20:40:36,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:40:36,807 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:40:36,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:40:36,807 INFO L85 PathProgramCache]: Analyzing trace with hash 627156729, now seen corresponding path program 2 times [2025-01-09 20:40:36,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:40:36,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828378105] [2025-01-09 20:40:36,807 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 20:40:36,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:40:36,839 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 119 statements into 2 equivalence classes. [2025-01-09 20:40:36,861 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 99 of 119 statements. [2025-01-09 20:40:36,861 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 20:40:36,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:40:37,107 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2025-01-09 20:40:37,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:40:37,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828378105] [2025-01-09 20:40:37,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828378105] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:40:37,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:40:37,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 20:40:37,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522063882] [2025-01-09 20:40:37,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:40:37,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 20:40:37,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:40:37,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 20:40:37,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-01-09 20:40:37,108 INFO L87 Difference]: Start difference. First operand 695 states and 977 transitions. Second operand has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:40:37,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:40:37,476 INFO L93 Difference]: Finished difference Result 1321 states and 1877 transitions. [2025-01-09 20:40:37,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 20:40:37,479 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 119 [2025-01-09 20:40:37,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:40:37,481 INFO L225 Difference]: With dead ends: 1321 [2025-01-09 20:40:37,481 INFO L226 Difference]: Without dead ends: 709 [2025-01-09 20:40:37,483 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-01-09 20:40:37,485 INFO L435 NwaCegarLoop]: 523 mSDtfsCounter, 9 mSDsluCounter, 3270 mSDsCounter, 0 mSdLazyCounter, 617 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 3793 SdHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 20:40:37,485 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 3793 Invalid, 617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 617 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 20:40:37,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2025-01-09 20:40:37,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 695. [2025-01-09 20:40:37,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 695 states, 667 states have (on average 1.4002998500749626) internal successors, (934), 684 states have internal predecessors, (934), 21 states have call successors, (21), 4 states have call predecessors, (21), 5 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2025-01-09 20:40:37,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 695 states and 977 transitions. [2025-01-09 20:40:37,501 INFO L78 Accepts]: Start accepts. Automaton has 695 states and 977 transitions. Word has length 119 [2025-01-09 20:40:37,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:40:37,501 INFO L471 AbstractCegarLoop]: Abstraction has 695 states and 977 transitions. [2025-01-09 20:40:37,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:40:37,501 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 977 transitions. [2025-01-09 20:40:37,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 20:40:37,502 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:40:37,502 INFO L218 NwaCegarLoop]: trace histogram [13, 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] [2025-01-09 20:40:37,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 20:40:37,504 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:40:37,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:40:37,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1591139037, now seen corresponding path program 1 times [2025-01-09 20:40:37,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:40:37,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360393267] [2025-01-09 20:40:37,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:40:37,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:40:37,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 20:40:37,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 20:40:37,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:40:37,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:40:37,976 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 71 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-01-09 20:40:37,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:40:37,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360393267] [2025-01-09 20:40:37,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360393267] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 20:40:37,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2026815558] [2025-01-09 20:40:37,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:40:37,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:40:37,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:40:37,979 INFO L229 MonitoredProcess]: Starting monitored process 11 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 20:40:37,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-09 20:40:38,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 20:40:38,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 20:40:38,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:40:38,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:40:38,786 INFO L256 TraceCheckSpWp]: Trace formula consists of 768 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-01-09 20:40:38,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 20:40:38,860 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 57 proven. 15 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-01-09 20:40:38,860 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 20:40:43,081 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 70 refuted. 1 times theorem prover too weak. 37 trivial. 0 not checked. [2025-01-09 20:40:43,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2026815558] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 20:40:43,081 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 20:40:43,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2025-01-09 20:40:43,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386107079] [2025-01-09 20:40:43,081 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 20:40:43,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-01-09 20:40:43,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:40:43,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-01-09 20:40:43,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=324, Unknown=1, NotChecked=0, Total=462 [2025-01-09 20:40:43,083 INFO L87 Difference]: Start difference. First operand 695 states and 977 transitions. Second operand has 22 states, 22 states have (on average 5.681818181818182) internal successors, (125), 22 states have internal predecessors, (125), 2 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 20:40:43,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:40:43,756 INFO L93 Difference]: Finished difference Result 1295 states and 1838 transitions. [2025-01-09 20:40:43,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-01-09 20:40:43,757 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 5.681818181818182) internal successors, (125), 22 states have internal predecessors, (125), 2 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 119 [2025-01-09 20:40:43,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:40:43,760 INFO L225 Difference]: With dead ends: 1295 [2025-01-09 20:40:43,760 INFO L226 Difference]: Without dead ends: 704 [2025-01-09 20:40:43,761 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=346, Invalid=709, Unknown=1, NotChecked=0, Total=1056 [2025-01-09 20:40:43,761 INFO L435 NwaCegarLoop]: 544 mSDtfsCounter, 8 mSDsluCounter, 3808 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 4352 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 20:40:43,761 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 4352 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 20:40:43,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2025-01-09 20:40:43,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 702. [2025-01-09 20:40:43,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 702 states, 674 states have (on average 1.3946587537091988) internal successors, (940), 691 states have internal predecessors, (940), 21 states have call successors, (21), 4 states have call predecessors, (21), 5 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2025-01-09 20:40:43,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 983 transitions. [2025-01-09 20:40:43,772 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 983 transitions. Word has length 119 [2025-01-09 20:40:43,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:40:43,773 INFO L471 AbstractCegarLoop]: Abstraction has 702 states and 983 transitions. [2025-01-09 20:40:43,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 5.681818181818182) internal successors, (125), 22 states have internal predecessors, (125), 2 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 20:40:43,773 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 983 transitions. [2025-01-09 20:40:43,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-01-09 20:40:43,773 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:40:43,773 INFO L218 NwaCegarLoop]: trace histogram [20, 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] [2025-01-09 20:40:43,791 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-01-09 20:40:43,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:40:43,974 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:40:43,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:40:43,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1473135673, now seen corresponding path program 2 times [2025-01-09 20:40:43,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:40:43,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079481042] [2025-01-09 20:40:43,975 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 20:40:43,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:40:44,010 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 126 statements into 2 equivalence classes. [2025-01-09 20:40:44,033 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 99 of 126 statements. [2025-01-09 20:40:44,033 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 20:40:44,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:40:44,407 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2025-01-09 20:40:44,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:40:44,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079481042] [2025-01-09 20:40:44,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079481042] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:40:44,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:40:44,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 20:40:44,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123756773] [2025-01-09 20:40:44,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:40:44,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 20:40:44,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:40:44,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 20:40:44,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-01-09 20:40:44,408 INFO L87 Difference]: Start difference. First operand 702 states and 983 transitions. Second operand has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:40:48,558 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.93s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 20:40:48,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:40:48,981 INFO L93 Difference]: Finished difference Result 1342 states and 1897 transitions. [2025-01-09 20:40:48,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 20:40:48,982 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 126 [2025-01-09 20:40:48,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:40:48,984 INFO L225 Difference]: With dead ends: 1342 [2025-01-09 20:40:48,985 INFO L226 Difference]: Without dead ends: 718 [2025-01-09 20:40:48,986 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2025-01-09 20:40:48,987 INFO L435 NwaCegarLoop]: 530 mSDtfsCounter, 31 mSDsluCounter, 3213 mSDsCounter, 0 mSdLazyCounter, 647 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 3743 SdHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 647 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-01-09 20:40:48,987 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 3743 Invalid, 653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 647 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2025-01-09 20:40:48,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2025-01-09 20:40:48,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 714. [2025-01-09 20:40:48,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 714 states, 686 states have (on average 1.3906705539358601) internal successors, (954), 703 states have internal predecessors, (954), 21 states have call successors, (21), 4 states have call predecessors, (21), 5 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2025-01-09 20:40:49,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 714 states and 997 transitions. [2025-01-09 20:40:49,001 INFO L78 Accepts]: Start accepts. Automaton has 714 states and 997 transitions. Word has length 126 [2025-01-09 20:40:49,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:40:49,002 INFO L471 AbstractCegarLoop]: Abstraction has 714 states and 997 transitions. [2025-01-09 20:40:49,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:40:49,002 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states and 997 transitions. [2025-01-09 20:40:49,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-01-09 20:40:49,003 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:40:49,003 INFO L218 NwaCegarLoop]: trace histogram [20, 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] [2025-01-09 20:40:49,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 20:40:49,003 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:40:49,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:40:49,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1316475914, now seen corresponding path program 1 times [2025-01-09 20:40:49,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:40:49,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764546317] [2025-01-09 20:40:49,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:40:49,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:40:49,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-01-09 20:40:49,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-01-09 20:40:49,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:40:49,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:40:49,664 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 0 proven. 197 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-01-09 20:40:49,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:40:49,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764546317] [2025-01-09 20:40:49,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764546317] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 20:40:49,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1607963846] [2025-01-09 20:40:49,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:40:49,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:40:49,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:40:49,668 INFO L229 MonitoredProcess]: Starting monitored process 12 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 20:40:49,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-01-09 20:40:49,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-01-09 20:40:50,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-01-09 20:40:50,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:40:50,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:40:50,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 876 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-01-09 20:40:50,904 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 20:40:51,235 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2025-01-09 20:40:51,236 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 20:40:51,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1607963846] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:40:51,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 20:40:51,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [16] total 24 [2025-01-09 20:40:51,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141247519] [2025-01-09 20:40:51,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:40:51,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 20:40:51,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:40:51,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 20:40:51,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=495, Unknown=0, NotChecked=0, Total=552 [2025-01-09 20:40:51,238 INFO L87 Difference]: Start difference. First operand 714 states and 997 transitions. Second operand has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:40:51,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:40:51,585 INFO L93 Difference]: Finished difference Result 1375 states and 1941 transitions. [2025-01-09 20:40:51,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 20:40:51,585 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 126 [2025-01-09 20:40:51,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:40:51,588 INFO L225 Difference]: With dead ends: 1375 [2025-01-09 20:40:51,588 INFO L226 Difference]: Without dead ends: 740 [2025-01-09 20:40:51,589 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=495, Unknown=0, NotChecked=0, Total=552 [2025-01-09 20:40:51,589 INFO L435 NwaCegarLoop]: 519 mSDtfsCounter, 15 mSDsluCounter, 3272 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 3791 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 20:40:51,589 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 3791 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 581 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 20:40:51,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2025-01-09 20:40:51,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 728. [2025-01-09 20:40:51,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 728 states, 700 states have (on average 1.3857142857142857) internal successors, (970), 717 states have internal predecessors, (970), 21 states have call successors, (21), 4 states have call predecessors, (21), 5 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2025-01-09 20:40:51,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 728 states and 1013 transitions. [2025-01-09 20:40:51,601 INFO L78 Accepts]: Start accepts. Automaton has 728 states and 1013 transitions. Word has length 126 [2025-01-09 20:40:51,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:40:51,601 INFO L471 AbstractCegarLoop]: Abstraction has 728 states and 1013 transitions. [2025-01-09 20:40:51,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 20:40:51,601 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 1013 transitions. [2025-01-09 20:40:51,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-01-09 20:40:51,602 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:40:51,602 INFO L218 NwaCegarLoop]: trace histogram [20, 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] [2025-01-09 20:40:51,621 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-01-09 20:40:51,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-01-09 20:40:51,803 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:40:51,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:40:51,803 INFO L85 PathProgramCache]: Analyzing trace with hash 160811763, now seen corresponding path program 1 times [2025-01-09 20:40:51,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:40:51,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577430023] [2025-01-09 20:40:51,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:40:51,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:40:51,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-01-09 20:40:51,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-01-09 20:40:51,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:40:51,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:40:52,559 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 0 proven. 197 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-01-09 20:40:52,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:40:52,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577430023] [2025-01-09 20:40:52,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577430023] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 20:40:52,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1531487404] [2025-01-09 20:40:52,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:40:52,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:40:52,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:40:52,563 INFO L229 MonitoredProcess]: Starting monitored process 13 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 20:40:52,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-01-09 20:40:52,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-01-09 20:40:53,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-01-09 20:40:53,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:40:53,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:40:53,888 INFO L256 TraceCheckSpWp]: Trace formula consists of 873 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-01-09 20:40:53,891 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 20:40:54,101 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 1 proven. 218 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-09 20:40:54,101 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 20:41:22,701 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 119 proven. 29 refuted. 7 times theorem prover too weak. 79 trivial. 0 not checked. [2025-01-09 20:41:22,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1531487404] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 20:41:22,703 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 20:41:22,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 12] total 37 [2025-01-09 20:41:22,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964141100] [2025-01-09 20:41:22,703 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 20:41:22,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-01-09 20:41:22,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:41:22,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-01-09 20:41:22,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=321, Invalid=1004, Unknown=7, NotChecked=0, Total=1332 [2025-01-09 20:41:22,705 INFO L87 Difference]: Start difference. First operand 728 states and 1013 transitions. Second operand has 37 states, 37 states have (on average 3.810810810810811) internal successors, (141), 37 states have internal predecessors, (141), 2 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-09 20:41:25,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:41:25,584 INFO L93 Difference]: Finished difference Result 1368 states and 1933 transitions. [2025-01-09 20:41:25,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2025-01-09 20:41:25,589 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 3.810810810810811) internal successors, (141), 37 states have internal predecessors, (141), 2 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 126 [2025-01-09 20:41:25,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:41:25,591 INFO L225 Difference]: With dead ends: 1368 [2025-01-09 20:41:25,591 INFO L226 Difference]: Without dead ends: 761 [2025-01-09 20:41:25,595 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 964 ImplicationChecksByTransitivity, 31.2s TimeCoverageRelationStatistics Valid=1164, Invalid=4231, Unknown=7, NotChecked=0, Total=5402 [2025-01-09 20:41:25,597 INFO L435 NwaCegarLoop]: 541 mSDtfsCounter, 18 mSDsluCounter, 5947 mSDsCounter, 0 mSdLazyCounter, 598 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 6488 SdHoareTripleChecker+Invalid, 624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 20:41:25,598 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 6488 Invalid, 624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 598 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 20:41:25,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2025-01-09 20:41:25,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 753. [2025-01-09 20:41:25,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 753 states, 725 states have (on average 1.3875862068965517) internal successors, (1006), 741 states have internal predecessors, (1006), 21 states have call successors, (21), 5 states have call predecessors, (21), 5 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2025-01-09 20:41:25,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 753 states and 1049 transitions. [2025-01-09 20:41:25,627 INFO L78 Accepts]: Start accepts. Automaton has 753 states and 1049 transitions. Word has length 126 [2025-01-09 20:41:25,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:41:25,627 INFO L471 AbstractCegarLoop]: Abstraction has 753 states and 1049 transitions. [2025-01-09 20:41:25,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 3.810810810810811) internal successors, (141), 37 states have internal predecessors, (141), 2 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-09 20:41:25,627 INFO L276 IsEmpty]: Start isEmpty. Operand 753 states and 1049 transitions. [2025-01-09 20:41:25,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-01-09 20:41:25,629 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:41:25,632 INFO L218 NwaCegarLoop]: trace histogram [35, 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] [2025-01-09 20:41:25,671 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-01-09 20:41:25,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 20:41:25,833 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 20:41:25,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:41:25,834 INFO L85 PathProgramCache]: Analyzing trace with hash 521663025, now seen corresponding path program 2 times [2025-01-09 20:41:25,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:41:25,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272822114] [2025-01-09 20:41:25,834 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 20:41:25,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:41:25,906 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 141 statements into 2 equivalence classes. [2025-01-09 20:41:25,959 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 99 of 141 statements. [2025-01-09 20:41:25,959 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 20:41:25,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:41:35,456 WARN L286 SmtUtils]: Spent 5.10s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-01-09 20:41:48,787 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* (div |c_ULTIMATE.start_main_~_hj_j~0#1| 4294967296) 524288)) (.cse0 (div |c_ULTIMATE.start_main_~_hj_j~0#1| 8192))) (and (= .cse0 (+ .cse1 |c_ULTIMATE.start_main_~_ha_hashv~0#1|)) (<= 4408680405129836981 (+ (* 1030789530 |c_ULTIMATE.start_main_~_ha_hashv~0#1|) (* |c_ULTIMATE.start_main_~_hj_j~0#1| 2061579059) (* (div (+ (* (- 4123158118) |c_ULTIMATE.start_main_~_hj_j~0#1|) 8817360810260198248 .cse1 (* (- 2061579059) |c_ULTIMATE.start_main_~_ha_hashv~0#1|) (* (- 1) .cse0)) 4294967296) 2147483648))))) is different from false [2025-01-09 20:41:48,851 INFO L134 CoverageAnalysis]: Checked inductivity of 669 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 669 trivial. 0 not checked. [2025-01-09 20:41:48,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:41:48,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272822114] [2025-01-09 20:41:48,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272822114] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:41:48,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:41:48,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 20:41:48,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014586812] [2025-01-09 20:41:48,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:41:48,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 20:41:48,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:41:48,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 20:41:48,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=72, Unknown=1, NotChecked=16, Total=110 [2025-01-09 20:41:48,853 INFO L87 Difference]: Start difference. First operand 753 states and 1049 transitions. Second operand has 11 states, 11 states have (on average 8.909090909090908) internal successors, (98), 11 states have internal predecessors, (98), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)