./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec4_product24.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/email_spec4_product24.cil.c -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 cc83a32f8f5c6143265231752530a7f576faa355052cdad9509cfbce0d0adeb3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 15:45:17,028 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 15:45:17,086 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 15:45:17,092 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 15:45:17,092 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 15:45:17,123 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 15:45:17,124 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 15:45:17,124 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 15:45:17,125 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 15:45:17,125 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 15:45:17,126 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 15:45:17,126 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 15:45:17,126 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 15:45:17,126 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 15:45:17,126 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 15:45:17,128 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 15:45:17,128 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 15:45:17,128 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 15:45:17,128 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 15:45:17,128 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 15:45:17,128 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 15:45:17,128 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 15:45:17,128 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 15:45:17,128 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 15:45:17,128 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 15:45:17,128 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 15:45:17,128 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 15:45:17,128 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 15:45:17,128 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 15:45:17,129 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 15:45:17,129 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 15:45:17,129 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 15:45:17,129 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:45:17,129 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 15:45:17,129 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 15:45:17,129 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 15:45:17,129 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 15:45:17,129 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 15:45:17,129 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 15:45:17,129 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 15:45:17,129 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 15:45:17,129 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 15:45:17,129 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 15:45:17,129 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 -> cc83a32f8f5c6143265231752530a7f576faa355052cdad9509cfbce0d0adeb3 [2025-02-05 15:45:17,432 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 15:45:17,444 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 15:45:17,447 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 15:45:17,449 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 15:45:17,449 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 15:45:17,451 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec4_product24.cil.c [2025-02-05 15:45:18,853 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fbc695efa/4ec99a9f6a804c82a62726b7216c062b/FLAG76e326cf9 [2025-02-05 15:45:19,250 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 15:45:19,252 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec4_product24.cil.c [2025-02-05 15:45:19,272 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fbc695efa/4ec99a9f6a804c82a62726b7216c062b/FLAG76e326cf9 [2025-02-05 15:45:19,293 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fbc695efa/4ec99a9f6a804c82a62726b7216c062b [2025-02-05 15:45:19,296 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 15:45:19,298 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 15:45:19,299 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 15:45:19,300 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 15:45:19,304 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 15:45:19,306 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:45:19" (1/1) ... [2025-02-05 15:45:19,306 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e69d2ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:45:19, skipping insertion in model container [2025-02-05 15:45:19,307 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:45:19" (1/1) ... [2025-02-05 15:45:19,359 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 15:45:19,685 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/product-lines/email_spec4_product24.cil.c[33676,33689] [2025-02-05 15:45:19,883 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:45:19,899 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 15:45:19,908 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [48] [2025-02-05 15:45:19,909 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [277] [2025-02-05 15:45:19,909 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [1357] [2025-02-05 15:45:19,910 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [1375] [2025-02-05 15:45:19,910 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [1424] [2025-02-05 15:45:19,910 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [1433] [2025-02-05 15:45:19,910 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [1799] [2025-02-05 15:45:19,910 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [2211] [2025-02-05 15:45:19,910 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"SignForward_spec.i","") [2503] [2025-02-05 15:45:19,910 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [2530] [2025-02-05 15:45:19,911 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [2629] [2025-02-05 15:45:19,972 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/product-lines/email_spec4_product24.cil.c[33676,33689] [2025-02-05 15:45:20,044 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:45:20,081 INFO L204 MainTranslator]: Completed translation [2025-02-05 15:45:20,082 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:45:20 WrapperNode [2025-02-05 15:45:20,083 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 15:45:20,084 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 15:45:20,084 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 15:45:20,084 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 15:45:20,089 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:45:20" (1/1) ... [2025-02-05 15:45:20,111 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:45:20" (1/1) ... [2025-02-05 15:45:20,156 INFO L138 Inliner]: procedures = 130, calls = 193, calls flagged for inlining = 63, calls inlined = 58, statements flattened = 1039 [2025-02-05 15:45:20,158 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 15:45:20,159 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 15:45:20,159 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 15:45:20,159 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 15:45:20,170 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:45:20" (1/1) ... [2025-02-05 15:45:20,171 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:45:20" (1/1) ... [2025-02-05 15:45:20,177 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:45:20" (1/1) ... [2025-02-05 15:45:20,204 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 4, 4, 4]. 29 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 4, 4, 4]. The 0 writes are split as follows [0, 0, 0, 0]. [2025-02-05 15:45:20,204 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:45:20" (1/1) ... [2025-02-05 15:45:20,205 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:45:20" (1/1) ... [2025-02-05 15:45:20,233 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:45:20" (1/1) ... [2025-02-05 15:45:20,235 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:45:20" (1/1) ... [2025-02-05 15:45:20,243 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:45:20" (1/1) ... [2025-02-05 15:45:20,250 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:45:20" (1/1) ... [2025-02-05 15:45:20,259 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 15:45:20,260 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 15:45:20,260 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 15:45:20,261 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 15:45:20,261 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:45:20" (1/1) ... [2025-02-05 15:45:20,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:45:20,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:45:20,300 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 15:45:20,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 15:45:20,328 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2025-02-05 15:45:20,328 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2025-02-05 15:45:20,328 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-02-05 15:45:20,328 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-02-05 15:45:20,328 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-02-05 15:45:20,328 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-02-05 15:45:20,328 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2025-02-05 15:45:20,328 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2025-02-05 15:45:20,328 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-02-05 15:45:20,328 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-02-05 15:45:20,328 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2025-02-05 15:45:20,328 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2025-02-05 15:45:20,328 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-02-05 15:45:20,328 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-02-05 15:45:20,328 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-02-05 15:45:20,328 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-02-05 15:45:20,329 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2025-02-05 15:45:20,329 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2025-02-05 15:45:20,329 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-02-05 15:45:20,329 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-02-05 15:45:20,329 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 15:45:20,329 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2025-02-05 15:45:20,329 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2025-02-05 15:45:20,329 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-02-05 15:45:20,329 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-02-05 15:45:20,329 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-02-05 15:45:20,329 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-02-05 15:45:20,329 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-02-05 15:45:20,329 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-02-05 15:45:20,329 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-02-05 15:45:20,329 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-02-05 15:45:20,329 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-02-05 15:45:20,332 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-02-05 15:45:20,332 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-02-05 15:45:20,332 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-02-05 15:45:20,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 15:45:20,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-05 15:45:20,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-05 15:45:20,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-05 15:45:20,333 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-02-05 15:45:20,333 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-02-05 15:45:20,334 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 15:45:20,334 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 15:45:20,540 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 15:45:20,542 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 15:45:20,589 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2155: #res := ~retValue_acc~32; [2025-02-05 15:45:20,934 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2192-1: isVerified_#res#1 := isVerified_~retValue_acc~33#1; [2025-02-05 15:45:20,935 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1334-1: getClientId_#res#1 := getClientId_~retValue_acc~16#1; [2025-02-05 15:45:20,935 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1855-1: getEmailId_#res#1 := getEmailId_~retValue_acc~24#1; [2025-02-05 15:45:20,935 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1287-1: getClientForwardReceiver_#res#1 := getClientForwardReceiver_~retValue_acc~15#1; [2025-02-05 15:45:20,935 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2840-1: isKeyPairValid_#res#1 := isKeyPairValid_~retValue_acc~42#1; [2025-02-05 15:45:20,935 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1215-1: findPublicKey_#res#1 := findPublicKey_~retValue_acc~14#1; [2025-02-05 15:45:20,935 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L852-1: getClientAutoResponse_#res#1 := getClientAutoResponse_~retValue_acc~8#1; [2025-02-05 15:45:20,946 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2118: #res := ~retValue_acc~31; [2025-02-05 15:45:20,968 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1929: #res := ~retValue_acc~26; [2025-02-05 15:45:20,991 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L991: #res#1 := ~retValue_acc~11#1; [2025-02-05 15:45:20,991 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L946-1: getClientKeyringSize_#res#1 := getClientKeyringSize_~retValue_acc~10#1; [2025-02-05 15:45:20,999 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L899: #res := ~retValue_acc~9; [2025-02-05 15:45:21,036 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2626-1: createEmail_#res#1 := createEmail_~retValue_acc~37#1; [2025-02-05 15:45:21,309 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1161-1: getClientKeyringPublicKey_#res#1 := getClientKeyringPublicKey_~retValue_acc~13#1; [2025-02-05 15:45:21,310 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1054-1: getClientKeyringUser_#res#1 := getClientKeyringUser_~retValue_acc~12#1; [2025-02-05 15:45:21,310 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2797-1: is_queue_empty_#res#1 := is_queue_empty_~retValue_acc~39#1; [2025-02-05 15:45:21,310 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2806-1: get_queued_client_#res#1 := get_queued_client_~retValue_acc~40#1; [2025-02-05 15:45:21,310 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2815-1: get_queued_email_#res#1 := get_queued_email_~retValue_acc~41#1; [2025-02-05 15:45:21,310 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1421-1: valid_product_#res#1 := valid_product_~retValue_acc~19#1; [2025-02-05 15:45:21,317 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1892: #res := ~retValue_acc~25; [2025-02-05 15:45:21,319 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2602: #res := ~retValue_acc~35; [2025-02-05 15:45:21,471 INFO L? ?]: Removed 458 outVars from TransFormulas that were not future-live. [2025-02-05 15:45:21,471 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 15:45:21,496 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 15:45:21,496 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 15:45:21,497 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:45:21 BoogieIcfgContainer [2025-02-05 15:45:21,497 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 15:45:21,499 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 15:45:21,499 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 15:45:21,503 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 15:45:21,504 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 03:45:19" (1/3) ... [2025-02-05 15:45:21,505 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ce22d95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:45:21, skipping insertion in model container [2025-02-05 15:45:21,505 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:45:20" (2/3) ... [2025-02-05 15:45:21,505 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ce22d95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:45:21, skipping insertion in model container [2025-02-05 15:45:21,505 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:45:21" (3/3) ... [2025-02-05 15:45:21,506 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec4_product24.cil.c [2025-02-05 15:45:21,523 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 15:45:21,527 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec4_product24.cil.c that has 19 procedures, 326 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 15:45:21,618 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 15:45:21,633 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;@49f2ad40, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 15:45:21,634 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 15:45:21,641 INFO L276 IsEmpty]: Start isEmpty. Operand has 326 states, 258 states have (on average 1.5271317829457365) internal successors, (394), 260 states have internal predecessors, (394), 48 states have call successors, (48), 18 states have call predecessors, (48), 18 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-02-05 15:45:21,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-02-05 15:45:21,657 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:45:21,658 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:45:21,659 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:45:21,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:45:21,664 INFO L85 PathProgramCache]: Analyzing trace with hash -660377199, now seen corresponding path program 1 times [2025-02-05 15:45:21,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:45:21,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398548187] [2025-02-05 15:45:21,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:45:21,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:45:21,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-05 15:45:21,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-05 15:45:21,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:45:21,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:45:22,392 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-02-05 15:45:22,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:45:22,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398548187] [2025-02-05 15:45:22,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398548187] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:45:22,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [991783840] [2025-02-05 15:45:22,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:45:22,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:45:22,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:45:22,398 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:45:22,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 15:45:22,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-05 15:45:22,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-05 15:45:22,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:45:22,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:45:22,776 INFO L256 TraceCheckSpWp]: Trace formula consists of 928 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 15:45:22,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:45:22,803 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-02-05 15:45:22,806 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:45:22,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [991783840] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:45:22,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:45:22,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 5 [2025-02-05 15:45:22,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509561643] [2025-02-05 15:45:22,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:45:22,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 15:45:22,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:45:22,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 15:45:22,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:45:22,837 INFO L87 Difference]: Start difference. First operand has 326 states, 258 states have (on average 1.5271317829457365) internal successors, (394), 260 states have internal predecessors, (394), 48 states have call successors, (48), 18 states have call predecessors, (48), 18 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:45:22,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:45:22,907 INFO L93 Difference]: Finished difference Result 494 states and 728 transitions. [2025-02-05 15:45:22,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 15:45:22,909 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 92 [2025-02-05 15:45:22,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:45:22,926 INFO L225 Difference]: With dead ends: 494 [2025-02-05 15:45:22,929 INFO L226 Difference]: Without dead ends: 319 [2025-02-05 15:45:22,937 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:45:22,941 INFO L435 NwaCegarLoop]: 487 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, 487 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-02-05 15:45:22,944 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 487 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:45:22,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2025-02-05 15:45:23,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 319. [2025-02-05 15:45:23,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 252 states have (on average 1.5238095238095237) internal successors, (384), 253 states have internal predecessors, (384), 48 states have call successors, (48), 18 states have call predecessors, (48), 18 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47) [2025-02-05 15:45:23,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 479 transitions. [2025-02-05 15:45:23,029 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 479 transitions. Word has length 92 [2025-02-05 15:45:23,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:45:23,032 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 479 transitions. [2025-02-05 15:45:23,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:45:23,033 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 479 transitions. [2025-02-05 15:45:23,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-02-05 15:45:23,042 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:45:23,042 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:45:23,054 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 15:45:23,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-05 15:45:23,244 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:45:23,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:45:23,246 INFO L85 PathProgramCache]: Analyzing trace with hash -251068570, now seen corresponding path program 1 times [2025-02-05 15:45:23,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:45:23,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301382062] [2025-02-05 15:45:23,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:45:23,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:45:23,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-05 15:45:23,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-05 15:45:23,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:45:23,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:45:23,577 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-02-05 15:45:23,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:45:23,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301382062] [2025-02-05 15:45:23,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301382062] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:45:23,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [717432144] [2025-02-05 15:45:23,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:45:23,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:45:23,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:45:23,581 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:45:23,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 15:45:23,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-05 15:45:23,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-05 15:45:23,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:45:23,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:45:23,887 INFO L256 TraceCheckSpWp]: Trace formula consists of 929 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 15:45:23,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:45:23,925 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-02-05 15:45:23,926 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:45:23,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [717432144] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:45:23,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:45:23,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-02-05 15:45:23,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016583723] [2025-02-05 15:45:23,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:45:23,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:45:23,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:45:23,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:45:23,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:45:23,932 INFO L87 Difference]: Start difference. First operand 319 states and 479 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:45:23,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:45:23,981 INFO L93 Difference]: Finished difference Result 483 states and 709 transitions. [2025-02-05 15:45:23,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:45:23,982 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 93 [2025-02-05 15:45:23,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:45:23,984 INFO L225 Difference]: With dead ends: 483 [2025-02-05 15:45:23,985 INFO L226 Difference]: Without dead ends: 321 [2025-02-05 15:45:23,986 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 93 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-02-05 15:45:23,990 INFO L435 NwaCegarLoop]: 478 mSDtfsCounter, 0 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 954 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:45:23,990 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 954 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:45:23,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2025-02-05 15:45:24,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 321. [2025-02-05 15:45:24,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 254 states have (on average 1.5196850393700787) internal successors, (386), 255 states have internal predecessors, (386), 48 states have call successors, (48), 18 states have call predecessors, (48), 18 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47) [2025-02-05 15:45:24,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 481 transitions. [2025-02-05 15:45:24,028 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 481 transitions. Word has length 93 [2025-02-05 15:45:24,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:45:24,029 INFO L471 AbstractCegarLoop]: Abstraction has 321 states and 481 transitions. [2025-02-05 15:45:24,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:45:24,030 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 481 transitions. [2025-02-05 15:45:24,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-02-05 15:45:24,034 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:45:24,035 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:45:24,045 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-02-05 15:45:24,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:45:24,236 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:45:24,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:45:24,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1427515126, now seen corresponding path program 1 times [2025-02-05 15:45:24,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:45:24,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319399486] [2025-02-05 15:45:24,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:45:24,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:45:24,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-05 15:45:24,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-05 15:45:24,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:45:24,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:45:24,504 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-05 15:45:24,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:45:24,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319399486] [2025-02-05 15:45:24,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319399486] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:45:24,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1252901036] [2025-02-05 15:45:24,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:45:24,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:45:24,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:45:24,510 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:45:24,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 15:45:24,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-05 15:45:24,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-05 15:45:24,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:45:24,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:45:24,803 INFO L256 TraceCheckSpWp]: Trace formula consists of 954 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 15:45:24,811 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:45:24,832 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-02-05 15:45:24,836 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:45:24,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1252901036] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:45:24,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:45:24,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-02-05 15:45:24,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851881284] [2025-02-05 15:45:24,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:45:24,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:45:24,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:45:24,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:45:24,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:45:24,839 INFO L87 Difference]: Start difference. First operand 321 states and 481 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:45:24,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:45:24,887 INFO L93 Difference]: Finished difference Result 676 states and 1028 transitions. [2025-02-05 15:45:24,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:45:24,888 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 101 [2025-02-05 15:45:24,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:45:24,893 INFO L225 Difference]: With dead ends: 676 [2025-02-05 15:45:24,893 INFO L226 Difference]: Without dead ends: 382 [2025-02-05 15:45:24,896 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 101 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-02-05 15:45:24,897 INFO L435 NwaCegarLoop]: 493 mSDtfsCounter, 115 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 925 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:45:24,899 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 925 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:45:24,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2025-02-05 15:45:24,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 374. [2025-02-05 15:45:24,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 296 states have (on average 1.537162162162162) internal successors, (455), 297 states have internal predecessors, (455), 59 states have call successors, (59), 18 states have call predecessors, (59), 18 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2025-02-05 15:45:24,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 572 transitions. [2025-02-05 15:45:24,940 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 572 transitions. Word has length 101 [2025-02-05 15:45:24,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:45:24,940 INFO L471 AbstractCegarLoop]: Abstraction has 374 states and 572 transitions. [2025-02-05 15:45:24,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:45:24,942 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 572 transitions. [2025-02-05 15:45:24,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-02-05 15:45:24,945 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:45:24,946 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:45:24,955 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-02-05 15:45:25,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:45:25,150 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:45:25,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:45:25,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1834948273, now seen corresponding path program 1 times [2025-02-05 15:45:25,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:45:25,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019818149] [2025-02-05 15:45:25,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:45:25,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:45:25,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-05 15:45:25,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-05 15:45:25,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:45:25,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:45:25,322 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-05 15:45:25,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:45:25,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019818149] [2025-02-05 15:45:25,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019818149] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:45:25,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2134542471] [2025-02-05 15:45:25,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:45:25,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:45:25,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:45:25,325 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-02-05 15:45:25,328 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-02-05 15:45:25,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-05 15:45:25,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-05 15:45:25,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:45:25,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:45:25,608 INFO L256 TraceCheckSpWp]: Trace formula consists of 959 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-05 15:45:25,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:45:25,668 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-05 15:45:25,670 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:45:25,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2134542471] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:45:25,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:45:25,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-02-05 15:45:25,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388778368] [2025-02-05 15:45:25,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:45:25,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:45:25,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:45:25,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:45:25,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:45:25,672 INFO L87 Difference]: Start difference. First operand 374 states and 572 transitions. Second operand has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-05 15:45:25,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:45:25,748 INFO L93 Difference]: Finished difference Result 739 states and 1134 transitions. [2025-02-05 15:45:25,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:45:25,749 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 102 [2025-02-05 15:45:25,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:45:25,778 INFO L225 Difference]: With dead ends: 739 [2025-02-05 15:45:25,778 INFO L226 Difference]: Without dead ends: 376 [2025-02-05 15:45:25,779 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:45:25,780 INFO L435 NwaCegarLoop]: 471 mSDtfsCounter, 2 mSDsluCounter, 1402 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1873 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:45:25,780 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1873 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:45:25,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2025-02-05 15:45:25,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 376. [2025-02-05 15:45:25,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 297 states have (on average 1.5353535353535352) internal successors, (456), 299 states have internal predecessors, (456), 59 states have call successors, (59), 18 states have call predecessors, (59), 19 states have return successors, (60), 58 states have call predecessors, (60), 58 states have call successors, (60) [2025-02-05 15:45:25,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 575 transitions. [2025-02-05 15:45:25,812 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 575 transitions. Word has length 102 [2025-02-05 15:45:25,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:45:25,812 INFO L471 AbstractCegarLoop]: Abstraction has 376 states and 575 transitions. [2025-02-05 15:45:25,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-05 15:45:25,812 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 575 transitions. [2025-02-05 15:45:25,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-02-05 15:45:25,817 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:45:25,818 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:45:25,829 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-05 15:45:26,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:45:26,022 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:45:26,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:45:26,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1033854370, now seen corresponding path program 1 times [2025-02-05 15:45:26,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:45:26,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701622675] [2025-02-05 15:45:26,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:45:26,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:45:26,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-05 15:45:26,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-05 15:45:26,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:45:26,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:45:26,222 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-05 15:45:26,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:45:26,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701622675] [2025-02-05 15:45:26,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701622675] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:45:26,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2119662736] [2025-02-05 15:45:26,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:45:26,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:45:26,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:45:26,227 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-02-05 15:45:26,228 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-02-05 15:45:26,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-05 15:45:26,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-05 15:45:26,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:45:26,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:45:26,504 INFO L256 TraceCheckSpWp]: Trace formula consists of 960 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 15:45:26,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:45:26,564 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-05 15:45:26,564 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:45:26,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2119662736] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:45:26,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:45:26,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-02-05 15:45:26,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726606808] [2025-02-05 15:45:26,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:45:26,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:45:26,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:45:26,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:45:26,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-02-05 15:45:26,569 INFO L87 Difference]: Start difference. First operand 376 states and 575 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-05 15:45:26,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:45:26,687 INFO L93 Difference]: Finished difference Result 741 states and 1139 transitions. [2025-02-05 15:45:26,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:45:26,688 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 103 [2025-02-05 15:45:26,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:45:26,691 INFO L225 Difference]: With dead ends: 741 [2025-02-05 15:45:26,691 INFO L226 Difference]: Without dead ends: 378 [2025-02-05 15:45:26,693 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-02-05 15:45:26,694 INFO L435 NwaCegarLoop]: 469 mSDtfsCounter, 2 mSDsluCounter, 1390 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1859 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:45:26,694 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1859 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:45:26,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2025-02-05 15:45:26,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 378. [2025-02-05 15:45:26,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 298 states have (on average 1.5335570469798658) internal successors, (457), 301 states have internal predecessors, (457), 59 states have call successors, (59), 18 states have call predecessors, (59), 20 states have return successors, (65), 58 states have call predecessors, (65), 58 states have call successors, (65) [2025-02-05 15:45:26,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 581 transitions. [2025-02-05 15:45:26,713 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 581 transitions. Word has length 103 [2025-02-05 15:45:26,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:45:26,714 INFO L471 AbstractCegarLoop]: Abstraction has 378 states and 581 transitions. [2025-02-05 15:45:26,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-05 15:45:26,715 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 581 transitions. [2025-02-05 15:45:26,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-02-05 15:45:26,720 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:45:26,720 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:45:26,730 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-02-05 15:45:26,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:45:26,921 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:45:26,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:45:26,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1707982378, now seen corresponding path program 1 times [2025-02-05 15:45:26,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:45:26,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51353242] [2025-02-05 15:45:26,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:45:26,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:45:26,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-05 15:45:26,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-05 15:45:26,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:45:26,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:45:27,104 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-05 15:45:27,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:45:27,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51353242] [2025-02-05 15:45:27,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51353242] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:45:27,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:45:27,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:45:27,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426939871] [2025-02-05 15:45:27,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:45:27,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:45:27,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:45:27,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:45:27,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:45:27,106 INFO L87 Difference]: Start difference. First operand 378 states and 581 transitions. Second operand has 5 states, 4 states have (on average 16.0) internal successors, (64), 5 states have internal predecessors, (64), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-05 15:45:27,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:45:27,172 INFO L93 Difference]: Finished difference Result 733 states and 1130 transitions. [2025-02-05 15:45:27,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:45:27,174 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.0) internal successors, (64), 5 states have internal predecessors, (64), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 104 [2025-02-05 15:45:27,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:45:27,178 INFO L225 Difference]: With dead ends: 733 [2025-02-05 15:45:27,178 INFO L226 Difference]: Without dead ends: 378 [2025-02-05 15:45:27,180 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:45:27,181 INFO L435 NwaCegarLoop]: 472 mSDtfsCounter, 2 mSDsluCounter, 1405 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1877 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:45:27,183 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1877 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:45:27,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2025-02-05 15:45:27,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 378. [2025-02-05 15:45:27,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 298 states have (on average 1.5335570469798658) internal successors, (457), 301 states have internal predecessors, (457), 59 states have call successors, (59), 18 states have call predecessors, (59), 20 states have return successors, (64), 58 states have call predecessors, (64), 58 states have call successors, (64) [2025-02-05 15:45:27,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 580 transitions. [2025-02-05 15:45:27,211 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 580 transitions. Word has length 104 [2025-02-05 15:45:27,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:45:27,212 INFO L471 AbstractCegarLoop]: Abstraction has 378 states and 580 transitions. [2025-02-05 15:45:27,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.0) internal successors, (64), 5 states have internal predecessors, (64), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-05 15:45:27,212 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 580 transitions. [2025-02-05 15:45:27,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-02-05 15:45:27,215 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:45:27,215 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:45:27,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 15:45:27,216 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:45:27,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:45:27,216 INFO L85 PathProgramCache]: Analyzing trace with hash -1501645817, now seen corresponding path program 2 times [2025-02-05 15:45:27,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:45:27,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105757415] [2025-02-05 15:45:27,217 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 15:45:27,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:45:27,236 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 105 statements into 2 equivalence classes. [2025-02-05 15:45:27,242 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 46 of 105 statements. [2025-02-05 15:45:27,243 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-05 15:45:27,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:45:27,431 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-02-05 15:45:27,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:45:27,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105757415] [2025-02-05 15:45:27,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105757415] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:45:27,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:45:27,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 15:45:27,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004336242] [2025-02-05 15:45:27,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:45:27,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 15:45:27,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:45:27,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 15:45:27,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:45:27,433 INFO L87 Difference]: Start difference. First operand 378 states and 580 transitions. Second operand has 8 states, 8 states have (on average 8.25) internal successors, (66), 7 states have internal predecessors, (66), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:45:27,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:45:27,883 INFO L93 Difference]: Finished difference Result 766 states and 1183 transitions. [2025-02-05 15:45:27,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-05 15:45:27,884 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 7 states have internal predecessors, (66), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) Word has length 105 [2025-02-05 15:45:27,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:45:27,890 INFO L225 Difference]: With dead ends: 766 [2025-02-05 15:45:27,891 INFO L226 Difference]: Without dead ends: 762 [2025-02-05 15:45:27,892 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-02-05 15:45:27,893 INFO L435 NwaCegarLoop]: 493 mSDtfsCounter, 800 mSDsluCounter, 2328 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 801 SdHoareTripleChecker+Valid, 2821 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 15:45:27,893 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [801 Valid, 2821 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 15:45:27,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2025-02-05 15:45:27,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 751. [2025-02-05 15:45:27,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 751 states, 594 states have (on average 1.5387205387205387) internal successors, (914), 597 states have internal predecessors, (914), 116 states have call successors, (116), 37 states have call predecessors, (116), 40 states have return successors, (130), 116 states have call predecessors, (130), 114 states have call successors, (130) [2025-02-05 15:45:27,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 751 states and 1160 transitions. [2025-02-05 15:45:27,952 INFO L78 Accepts]: Start accepts. Automaton has 751 states and 1160 transitions. Word has length 105 [2025-02-05 15:45:27,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:45:27,953 INFO L471 AbstractCegarLoop]: Abstraction has 751 states and 1160 transitions. [2025-02-05 15:45:27,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 7 states have internal predecessors, (66), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:45:27,953 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 1160 transitions. [2025-02-05 15:45:27,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-02-05 15:45:27,958 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:45:27,958 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:45:27,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 15:45:27,958 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:45:27,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:45:27,959 INFO L85 PathProgramCache]: Analyzing trace with hash 358474480, now seen corresponding path program 1 times [2025-02-05 15:45:27,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:45:27,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023504555] [2025-02-05 15:45:27,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:45:27,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:45:27,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-02-05 15:45:27,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-02-05 15:45:27,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:45:27,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:45:28,146 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-05 15:45:28,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:45:28,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023504555] [2025-02-05 15:45:28,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023504555] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:45:28,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:45:28,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:45:28,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540254338] [2025-02-05 15:45:28,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:45:28,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:45:28,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:45:28,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:45:28,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:45:28,148 INFO L87 Difference]: Start difference. First operand 751 states and 1160 transitions. Second operand has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-05 15:45:28,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:45:28,206 INFO L93 Difference]: Finished difference Result 1471 states and 2280 transitions. [2025-02-05 15:45:28,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:45:28,207 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 106 [2025-02-05 15:45:28,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:45:28,215 INFO L225 Difference]: With dead ends: 1471 [2025-02-05 15:45:28,215 INFO L226 Difference]: Without dead ends: 755 [2025-02-05 15:45:28,218 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:45:28,219 INFO L435 NwaCegarLoop]: 473 mSDtfsCounter, 1 mSDsluCounter, 1407 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1880 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:45:28,219 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1880 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:45:28,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2025-02-05 15:45:28,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 755. [2025-02-05 15:45:28,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 755 states, 596 states have (on average 1.5369127516778522) internal successors, (916), 601 states have internal predecessors, (916), 116 states have call successors, (116), 37 states have call predecessors, (116), 42 states have return successors, (133), 116 states have call predecessors, (133), 114 states have call successors, (133) [2025-02-05 15:45:28,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 755 states to 755 states and 1165 transitions. [2025-02-05 15:45:28,267 INFO L78 Accepts]: Start accepts. Automaton has 755 states and 1165 transitions. Word has length 106 [2025-02-05 15:45:28,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:45:28,268 INFO L471 AbstractCegarLoop]: Abstraction has 755 states and 1165 transitions. [2025-02-05 15:45:28,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-05 15:45:28,268 INFO L276 IsEmpty]: Start isEmpty. Operand 755 states and 1165 transitions. [2025-02-05 15:45:28,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-02-05 15:45:28,271 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:45:28,271 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:45:28,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 15:45:28,271 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:45:28,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:45:28,272 INFO L85 PathProgramCache]: Analyzing trace with hash 518837860, now seen corresponding path program 1 times [2025-02-05 15:45:28,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:45:28,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58212981] [2025-02-05 15:45:28,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:45:28,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:45:28,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-05 15:45:28,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-05 15:45:28,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:45:28,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:45:28,438 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-05 15:45:28,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:45:28,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58212981] [2025-02-05 15:45:28,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58212981] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:45:28,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:45:28,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 15:45:28,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638714694] [2025-02-05 15:45:28,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:45:28,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 15:45:28,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:45:28,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 15:45:28,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:45:28,440 INFO L87 Difference]: Start difference. First operand 755 states and 1165 transitions. Second operand has 8 states, 7 states have (on average 10.142857142857142) internal successors, (71), 8 states have internal predecessors, (71), 4 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2025-02-05 15:45:28,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:45:28,601 INFO L93 Difference]: Finished difference Result 1469 states and 2272 transitions. [2025-02-05 15:45:28,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 15:45:28,602 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 10.142857142857142) internal successors, (71), 8 states have internal predecessors, (71), 4 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) Word has length 107 [2025-02-05 15:45:28,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:45:28,607 INFO L225 Difference]: With dead ends: 1469 [2025-02-05 15:45:28,608 INFO L226 Difference]: Without dead ends: 759 [2025-02-05 15:45:28,611 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-02-05 15:45:28,612 INFO L435 NwaCegarLoop]: 463 mSDtfsCounter, 7 mSDsluCounter, 2749 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 3212 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:45:28,613 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 3212 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:45:28,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2025-02-05 15:45:28,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 757. [2025-02-05 15:45:28,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 757 states, 598 states have (on average 1.5351170568561874) internal successors, (918), 602 states have internal predecessors, (918), 116 states have call successors, (116), 38 states have call predecessors, (116), 42 states have return successors, (131), 116 states have call predecessors, (131), 114 states have call successors, (131) [2025-02-05 15:45:28,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 757 states to 757 states and 1165 transitions. [2025-02-05 15:45:28,691 INFO L78 Accepts]: Start accepts. Automaton has 757 states and 1165 transitions. Word has length 107 [2025-02-05 15:45:28,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:45:28,691 INFO L471 AbstractCegarLoop]: Abstraction has 757 states and 1165 transitions. [2025-02-05 15:45:28,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 10.142857142857142) internal successors, (71), 8 states have internal predecessors, (71), 4 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2025-02-05 15:45:28,692 INFO L276 IsEmpty]: Start isEmpty. Operand 757 states and 1165 transitions. [2025-02-05 15:45:28,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-02-05 15:45:28,696 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:45:28,696 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:45:28,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 15:45:28,697 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:45:28,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:45:28,697 INFO L85 PathProgramCache]: Analyzing trace with hash -2005675414, now seen corresponding path program 2 times [2025-02-05 15:45:28,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:45:28,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094968652] [2025-02-05 15:45:28,698 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 15:45:28,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:45:28,719 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 108 statements into 2 equivalence classes. [2025-02-05 15:45:28,727 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 49 of 108 statements. [2025-02-05 15:45:28,727 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-05 15:45:28,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:45:28,832 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-02-05 15:45:28,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:45:28,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094968652] [2025-02-05 15:45:28,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094968652] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:45:28,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:45:28,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 15:45:28,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647637204] [2025-02-05 15:45:28,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:45:28,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 15:45:28,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:45:28,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 15:45:28,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:45:28,834 INFO L87 Difference]: Start difference. First operand 757 states and 1165 transitions. Second operand has 8 states, 8 states have (on average 8.75) internal successors, (70), 7 states have internal predecessors, (70), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:45:29,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:45:29,228 INFO L93 Difference]: Finished difference Result 1511 states and 2350 transitions. [2025-02-05 15:45:29,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 15:45:29,229 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 7 states have internal predecessors, (70), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) Word has length 108 [2025-02-05 15:45:29,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:45:29,239 INFO L225 Difference]: With dead ends: 1511 [2025-02-05 15:45:29,239 INFO L226 Difference]: Without dead ends: 1509 [2025-02-05 15:45:29,241 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-02-05 15:45:29,242 INFO L435 NwaCegarLoop]: 484 mSDtfsCounter, 430 mSDsluCounter, 2692 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 430 SdHoareTripleChecker+Valid, 3176 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 15:45:29,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [430 Valid, 3176 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 15:45:29,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1509 states. [2025-02-05 15:45:29,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1509 to 1485. [2025-02-05 15:45:29,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1485 states, 1177 states have (on average 1.5420560747663552) internal successors, (1815), 1186 states have internal predecessors, (1815), 222 states have call successors, (222), 74 states have call predecessors, (222), 85 states have return successors, (274), 224 states have call predecessors, (274), 218 states have call successors, (274) [2025-02-05 15:45:29,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1485 states to 1485 states and 2311 transitions. [2025-02-05 15:45:29,327 INFO L78 Accepts]: Start accepts. Automaton has 1485 states and 2311 transitions. Word has length 108 [2025-02-05 15:45:29,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:45:29,327 INFO L471 AbstractCegarLoop]: Abstraction has 1485 states and 2311 transitions. [2025-02-05 15:45:29,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 7 states have internal predecessors, (70), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:45:29,327 INFO L276 IsEmpty]: Start isEmpty. Operand 1485 states and 2311 transitions. [2025-02-05 15:45:29,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-02-05 15:45:29,334 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:45:29,334 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:45:29,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 15:45:29,334 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:45:29,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:45:29,335 INFO L85 PathProgramCache]: Analyzing trace with hash 437868899, now seen corresponding path program 1 times [2025-02-05 15:45:29,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:45:29,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983577035] [2025-02-05 15:45:29,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:45:29,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:45:29,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-05 15:45:29,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-05 15:45:29,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:45:29,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:45:29,464 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:45:29,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:45:29,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983577035] [2025-02-05 15:45:29,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983577035] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:45:29,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1016163727] [2025-02-05 15:45:29,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:45:29,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:45:29,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:45:29,469 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-02-05 15:45:29,471 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-02-05 15:45:29,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-05 15:45:29,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-05 15:45:29,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:45:29,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:45:29,729 INFO L256 TraceCheckSpWp]: Trace formula consists of 965 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 15:45:29,734 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:45:29,781 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-02-05 15:45:29,784 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:45:29,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1016163727] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:45:29,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:45:29,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-02-05 15:45:29,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952448969] [2025-02-05 15:45:29,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:45:29,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:45:29,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:45:29,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:45:29,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:45:29,787 INFO L87 Difference]: Start difference. First operand 1485 states and 2311 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:45:29,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:45:29,878 INFO L93 Difference]: Finished difference Result 2245 states and 3485 transitions. [2025-02-05 15:45:29,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:45:29,879 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 108 [2025-02-05 15:45:29,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:45:29,890 INFO L225 Difference]: With dead ends: 2245 [2025-02-05 15:45:29,890 INFO L226 Difference]: Without dead ends: 1499 [2025-02-05 15:45:29,894 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:45:29,895 INFO L435 NwaCegarLoop]: 472 mSDtfsCounter, 1 mSDsluCounter, 1398 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1870 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:45:29,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1870 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:45:29,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1499 states. [2025-02-05 15:45:29,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1499 to 1487. [2025-02-05 15:45:29,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1487 states, 1178 states have (on average 1.5415959252971136) internal successors, (1816), 1188 states have internal predecessors, (1816), 222 states have call successors, (222), 74 states have call predecessors, (222), 86 states have return successors, (276), 224 states have call predecessors, (276), 218 states have call successors, (276) [2025-02-05 15:45:29,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1487 states to 1487 states and 2314 transitions. [2025-02-05 15:45:29,978 INFO L78 Accepts]: Start accepts. Automaton has 1487 states and 2314 transitions. Word has length 108 [2025-02-05 15:45:29,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:45:29,978 INFO L471 AbstractCegarLoop]: Abstraction has 1487 states and 2314 transitions. [2025-02-05 15:45:29,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:45:29,979 INFO L276 IsEmpty]: Start isEmpty. Operand 1487 states and 2314 transitions. [2025-02-05 15:45:29,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-02-05 15:45:29,984 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:45:29,985 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:45:29,994 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-02-05 15:45:30,185 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,SelfDestructingSolverStorable10 [2025-02-05 15:45:30,186 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:45:30,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:45:30,187 INFO L85 PathProgramCache]: Analyzing trace with hash 167047946, now seen corresponding path program 1 times [2025-02-05 15:45:30,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:45:30,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401538899] [2025-02-05 15:45:30,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:45:30,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:45:30,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-05 15:45:30,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-05 15:45:30,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:45:30,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:45:30,363 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-05 15:45:30,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:45:30,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401538899] [2025-02-05 15:45:30,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401538899] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:45:30,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:45:30,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 15:45:30,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366655978] [2025-02-05 15:45:30,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:45:30,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 15:45:30,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:45:30,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 15:45:30,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:45:30,365 INFO L87 Difference]: Start difference. First operand 1487 states and 2314 transitions. Second operand has 8 states, 7 states have (on average 10.428571428571429) internal successors, (73), 8 states have internal predecessors, (73), 4 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2025-02-05 15:45:30,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:45:30,545 INFO L93 Difference]: Finished difference Result 2207 states and 3430 transitions. [2025-02-05 15:45:30,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 15:45:30,546 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 10.428571428571429) internal successors, (73), 8 states have internal predecessors, (73), 4 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) Word has length 109 [2025-02-05 15:45:30,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:45:30,553 INFO L225 Difference]: With dead ends: 2207 [2025-02-05 15:45:30,553 INFO L226 Difference]: Without dead ends: 769 [2025-02-05 15:45:30,559 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-02-05 15:45:30,560 INFO L435 NwaCegarLoop]: 465 mSDtfsCounter, 5 mSDsluCounter, 2761 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 3226 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:45:30,560 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 3226 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:45:30,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 769 states. [2025-02-05 15:45:30,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 769 to 767. [2025-02-05 15:45:30,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 767 states, 605 states have (on average 1.5289256198347108) internal successors, (925), 611 states have internal predecessors, (925), 116 states have call successors, (116), 39 states have call predecessors, (116), 45 states have return successors, (140), 116 states have call predecessors, (140), 114 states have call successors, (140) [2025-02-05 15:45:30,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 767 states and 1181 transitions. [2025-02-05 15:45:30,604 INFO L78 Accepts]: Start accepts. Automaton has 767 states and 1181 transitions. Word has length 109 [2025-02-05 15:45:30,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:45:30,605 INFO L471 AbstractCegarLoop]: Abstraction has 767 states and 1181 transitions. [2025-02-05 15:45:30,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 10.428571428571429) internal successors, (73), 8 states have internal predecessors, (73), 4 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2025-02-05 15:45:30,605 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 1181 transitions. [2025-02-05 15:45:30,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-02-05 15:45:30,608 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:45:30,608 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:45:30,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 15:45:30,609 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:45:30,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:45:30,610 INFO L85 PathProgramCache]: Analyzing trace with hash -919814425, now seen corresponding path program 1 times [2025-02-05 15:45:30,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:45:30,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160136869] [2025-02-05 15:45:30,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:45:30,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:45:30,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-05 15:45:30,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-05 15:45:30,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:45:30,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:45:30,790 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-02-05 15:45:30,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:45:30,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160136869] [2025-02-05 15:45:30,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160136869] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:45:30,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [375754556] [2025-02-05 15:45:30,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:45:30,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:45:30,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:45:30,793 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-02-05 15:45:30,795 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-02-05 15:45:30,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-05 15:45:31,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-05 15:45:31,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:45:31,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:45:31,072 INFO L256 TraceCheckSpWp]: Trace formula consists of 966 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 15:45:31,075 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:45:31,130 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-02-05 15:45:31,132 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:45:31,236 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-02-05 15:45:31,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [375754556] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:45:31,237 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:45:31,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 11 [2025-02-05 15:45:31,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457901974] [2025-02-05 15:45:31,238 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:45:31,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 15:45:31,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:45:31,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 15:45:31,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-02-05 15:45:31,240 INFO L87 Difference]: Start difference. First operand 767 states and 1181 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 4 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (22), 3 states have call predecessors, (22), 4 states have call successors, (22) [2025-02-05 15:45:31,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:45:31,918 INFO L93 Difference]: Finished difference Result 2225 states and 3583 transitions. [2025-02-05 15:45:31,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 15:45:31,919 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 4 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (22), 3 states have call predecessors, (22), 4 states have call successors, (22) Word has length 109 [2025-02-05 15:45:31,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:45:31,929 INFO L225 Difference]: With dead ends: 2225 [2025-02-05 15:45:31,930 INFO L226 Difference]: Without dead ends: 1513 [2025-02-05 15:45:31,933 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=400, Unknown=0, NotChecked=0, Total=506 [2025-02-05 15:45:31,934 INFO L435 NwaCegarLoop]: 470 mSDtfsCounter, 1151 mSDsluCounter, 3266 mSDsCounter, 0 mSdLazyCounter, 541 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1151 SdHoareTripleChecker+Valid, 3736 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 15:45:31,934 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1151 Valid, 3736 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 541 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 15:45:31,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1513 states. [2025-02-05 15:45:32,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1465. [2025-02-05 15:45:32,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1465 states, 1175 states have (on average 1.582127659574468) internal successors, (1859), 1180 states have internal predecessors, (1859), 244 states have call successors, (244), 40 states have call predecessors, (244), 45 states have return successors, (293), 244 states have call predecessors, (293), 242 states have call successors, (293) [2025-02-05 15:45:32,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1465 states to 1465 states and 2396 transitions. [2025-02-05 15:45:32,012 INFO L78 Accepts]: Start accepts. Automaton has 1465 states and 2396 transitions. Word has length 109 [2025-02-05 15:45:32,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:45:32,012 INFO L471 AbstractCegarLoop]: Abstraction has 1465 states and 2396 transitions. [2025-02-05 15:45:32,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 4 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (22), 3 states have call predecessors, (22), 4 states have call successors, (22) [2025-02-05 15:45:32,013 INFO L276 IsEmpty]: Start isEmpty. Operand 1465 states and 2396 transitions. [2025-02-05 15:45:32,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-02-05 15:45:32,019 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:45:32,019 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:45:32,030 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-05 15:45:32,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:45:32,220 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:45:32,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:45:32,221 INFO L85 PathProgramCache]: Analyzing trace with hash -125502281, now seen corresponding path program 1 times [2025-02-05 15:45:32,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:45:32,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428809380] [2025-02-05 15:45:32,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:45:32,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:45:32,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-05 15:45:32,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-05 15:45:32,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:45:32,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:45:32,295 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-02-05 15:45:32,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:45:32,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428809380] [2025-02-05 15:45:32,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428809380] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:45:32,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:45:32,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:45:32,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475739194] [2025-02-05 15:45:32,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:45:32,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:45:32,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:45:32,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:45:32,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:45:32,298 INFO L87 Difference]: Start difference. First operand 1465 states and 2396 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:45:32,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:45:32,374 INFO L93 Difference]: Finished difference Result 3437 states and 5715 transitions. [2025-02-05 15:45:32,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:45:32,374 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 112 [2025-02-05 15:45:32,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:45:32,388 INFO L225 Difference]: With dead ends: 3437 [2025-02-05 15:45:32,389 INFO L226 Difference]: Without dead ends: 2121 [2025-02-05 15:45:32,395 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:45:32,395 INFO L435 NwaCegarLoop]: 490 mSDtfsCounter, 112 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 958 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:45:32,397 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 958 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:45:32,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2121 states. [2025-02-05 15:45:32,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2121 to 2105. [2025-02-05 15:45:32,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2105 states, 1687 states have (on average 1.5998814463544755) internal successors, (2699), 1692 states have internal predecessors, (2699), 372 states have call successors, (372), 40 states have call predecessors, (372), 45 states have return successors, (446), 372 states have call predecessors, (446), 370 states have call successors, (446) [2025-02-05 15:45:32,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2105 states to 2105 states and 3517 transitions. [2025-02-05 15:45:32,526 INFO L78 Accepts]: Start accepts. Automaton has 2105 states and 3517 transitions. Word has length 112 [2025-02-05 15:45:32,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:45:32,528 INFO L471 AbstractCegarLoop]: Abstraction has 2105 states and 3517 transitions. [2025-02-05 15:45:32,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:45:32,529 INFO L276 IsEmpty]: Start isEmpty. Operand 2105 states and 3517 transitions. [2025-02-05 15:45:32,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-02-05 15:45:32,538 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:45:32,539 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:45:32,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 15:45:32,539 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:45:32,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:45:32,539 INFO L85 PathProgramCache]: Analyzing trace with hash 478453199, now seen corresponding path program 1 times [2025-02-05 15:45:32,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:45:32,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978674559] [2025-02-05 15:45:32,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:45:32,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:45:32,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-02-05 15:45:32,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-02-05 15:45:32,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:45:32,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:45:32,605 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-02-05 15:45:32,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:45:32,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978674559] [2025-02-05 15:45:32,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978674559] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:45:32,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:45:32,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:45:32,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753617877] [2025-02-05 15:45:32,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:45:32,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:45:32,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:45:32,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:45:32,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:45:32,608 INFO L87 Difference]: Start difference. First operand 2105 states and 3517 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:45:32,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:45:32,713 INFO L93 Difference]: Finished difference Result 5025 states and 8454 transitions. [2025-02-05 15:45:32,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:45:32,714 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 113 [2025-02-05 15:45:32,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:45:32,736 INFO L225 Difference]: With dead ends: 5025 [2025-02-05 15:45:32,736 INFO L226 Difference]: Without dead ends: 3171 [2025-02-05 15:45:32,746 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:45:32,748 INFO L435 NwaCegarLoop]: 479 mSDtfsCounter, 110 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 950 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:45:32,748 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 950 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:45:32,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3171 states. [2025-02-05 15:45:32,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3171 to 3155. [2025-02-05 15:45:32,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3155 states, 2547 states have (on average 1.607773851590106) internal successors, (4095), 2552 states have internal predecessors, (4095), 562 states have call successors, (562), 40 states have call predecessors, (562), 45 states have return successors, (652), 562 states have call predecessors, (652), 560 states have call successors, (652) [2025-02-05 15:45:32,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3155 states to 3155 states and 5309 transitions. [2025-02-05 15:45:32,952 INFO L78 Accepts]: Start accepts. Automaton has 3155 states and 5309 transitions. Word has length 113 [2025-02-05 15:45:32,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:45:32,952 INFO L471 AbstractCegarLoop]: Abstraction has 3155 states and 5309 transitions. [2025-02-05 15:45:32,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:45:32,953 INFO L276 IsEmpty]: Start isEmpty. Operand 3155 states and 5309 transitions. [2025-02-05 15:45:32,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-02-05 15:45:32,969 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:45:32,969 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:45:32,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 15:45:32,969 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:45:32,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:45:32,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1578572776, now seen corresponding path program 1 times [2025-02-05 15:45:32,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:45:32,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388519989] [2025-02-05 15:45:32,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:45:32,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:45:32,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-02-05 15:45:32,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-02-05 15:45:32,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:45:32,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:45:33,035 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-02-05 15:45:33,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:45:33,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388519989] [2025-02-05 15:45:33,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388519989] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:45:33,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:45:33,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:45:33,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729678598] [2025-02-05 15:45:33,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:45:33,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:45:33,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:45:33,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:45:33,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:45:33,038 INFO L87 Difference]: Start difference. First operand 3155 states and 5309 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:45:33,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:45:33,177 INFO L93 Difference]: Finished difference Result 7403 states and 12556 transitions. [2025-02-05 15:45:33,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:45:33,178 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 114 [2025-02-05 15:45:33,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:45:33,209 INFO L225 Difference]: With dead ends: 7403 [2025-02-05 15:45:33,210 INFO L226 Difference]: Without dead ends: 4763 [2025-02-05 15:45:33,223 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:45:33,224 INFO L435 NwaCegarLoop]: 477 mSDtfsCounter, 108 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 945 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:45:33,225 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 945 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:45:33,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4763 states. [2025-02-05 15:45:33,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4763 to 4747. [2025-02-05 15:45:33,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4747 states, 3893 states have (on average 1.6139224248651425) internal successors, (6283), 3898 states have internal predecessors, (6283), 808 states have call successors, (808), 40 states have call predecessors, (808), 45 states have return successors, (948), 808 states have call predecessors, (948), 806 states have call successors, (948) [2025-02-05 15:45:33,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4747 states to 4747 states and 8039 transitions. [2025-02-05 15:45:33,576 INFO L78 Accepts]: Start accepts. Automaton has 4747 states and 8039 transitions. Word has length 114 [2025-02-05 15:45:33,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:45:33,577 INFO L471 AbstractCegarLoop]: Abstraction has 4747 states and 8039 transitions. [2025-02-05 15:45:33,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:45:33,577 INFO L276 IsEmpty]: Start isEmpty. Operand 4747 states and 8039 transitions. [2025-02-05 15:45:33,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-02-05 15:45:33,598 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:45:33,598 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:45:33,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 15:45:33,599 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:45:33,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:45:33,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1187534030, now seen corresponding path program 1 times [2025-02-05 15:45:33,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:45:33,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104800292] [2025-02-05 15:45:33,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:45:33,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:45:33,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-02-05 15:45:33,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-02-05 15:45:33,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:45:33,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:45:33,668 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-02-05 15:45:33,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:45:33,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104800292] [2025-02-05 15:45:33,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104800292] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:45:33,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:45:33,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:45:33,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870772758] [2025-02-05 15:45:33,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:45:33,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:45:33,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:45:33,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:45:33,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:45:33,670 INFO L87 Difference]: Start difference. First operand 4747 states and 8039 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:45:33,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:45:33,893 INFO L93 Difference]: Finished difference Result 11109 states and 18952 transitions. [2025-02-05 15:45:33,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:45:33,893 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 115 [2025-02-05 15:45:33,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:45:33,952 INFO L225 Difference]: With dead ends: 11109 [2025-02-05 15:45:33,953 INFO L226 Difference]: Without dead ends: 7307 [2025-02-05 15:45:33,970 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:45:33,971 INFO L435 NwaCegarLoop]: 477 mSDtfsCounter, 106 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 945 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:45:33,971 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 945 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:45:33,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7307 states. [2025-02-05 15:45:34,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7307 to 7291. [2025-02-05 15:45:34,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7291 states, 6079 states have (on average 1.6178647803915118) internal successors, (9835), 6084 states have internal predecessors, (9835), 1166 states have call successors, (1166), 40 states have call predecessors, (1166), 45 states have return successors, (1389), 1166 states have call predecessors, (1389), 1164 states have call successors, (1389) [2025-02-05 15:45:34,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7291 states to 7291 states and 12390 transitions. [2025-02-05 15:45:34,363 INFO L78 Accepts]: Start accepts. Automaton has 7291 states and 12390 transitions. Word has length 115 [2025-02-05 15:45:34,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:45:34,366 INFO L471 AbstractCegarLoop]: Abstraction has 7291 states and 12390 transitions. [2025-02-05 15:45:34,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:45:34,367 INFO L276 IsEmpty]: Start isEmpty. Operand 7291 states and 12390 transitions. [2025-02-05 15:45:34,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-02-05 15:45:34,387 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:45:34,387 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:45:34,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 15:45:34,388 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:45:34,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:45:34,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1229776473, now seen corresponding path program 1 times [2025-02-05 15:45:34,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:45:34,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653094959] [2025-02-05 15:45:34,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:45:34,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:45:34,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-05 15:45:34,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-05 15:45:34,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:45:34,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:45:34,445 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-02-05 15:45:34,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:45:34,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653094959] [2025-02-05 15:45:34,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653094959] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:45:34,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:45:34,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:45:34,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695144915] [2025-02-05 15:45:34,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:45:34,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:45:34,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:45:34,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:45:34,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:45:34,448 INFO L87 Difference]: Start difference. First operand 7291 states and 12390 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:45:34,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:45:34,779 INFO L93 Difference]: Finished difference Result 17203 states and 29459 transitions. [2025-02-05 15:45:34,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:45:34,779 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 116 [2025-02-05 15:45:34,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:45:34,843 INFO L225 Difference]: With dead ends: 17203 [2025-02-05 15:45:34,844 INFO L226 Difference]: Without dead ends: 11511 [2025-02-05 15:45:34,870 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:45:34,870 INFO L435 NwaCegarLoop]: 488 mSDtfsCounter, 104 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 954 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:45:34,870 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 954 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:45:34,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11511 states. [2025-02-05 15:45:35,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11511 to 11495. [2025-02-05 15:45:35,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11495 states, 9531 states have (on average 1.6125275417060119) internal successors, (15369), 9536 states have internal predecessors, (15369), 1918 states have call successors, (1918), 40 states have call predecessors, (1918), 45 states have return successors, (2285), 1918 states have call predecessors, (2285), 1916 states have call successors, (2285) [2025-02-05 15:45:35,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11495 states to 11495 states and 19572 transitions. [2025-02-05 15:45:35,656 INFO L78 Accepts]: Start accepts. Automaton has 11495 states and 19572 transitions. Word has length 116 [2025-02-05 15:45:35,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:45:35,656 INFO L471 AbstractCegarLoop]: Abstraction has 11495 states and 19572 transitions. [2025-02-05 15:45:35,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:45:35,657 INFO L276 IsEmpty]: Start isEmpty. Operand 11495 states and 19572 transitions. [2025-02-05 15:45:35,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-02-05 15:45:35,690 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:45:35,690 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:45:35,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 15:45:35,690 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:45:35,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:45:35,691 INFO L85 PathProgramCache]: Analyzing trace with hash 689343949, now seen corresponding path program 1 times [2025-02-05 15:45:35,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:45:35,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446261174] [2025-02-05 15:45:35,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:45:35,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:45:35,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-02-05 15:45:35,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-02-05 15:45:35,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:45:35,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:45:35,759 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-02-05 15:45:35,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:45:35,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446261174] [2025-02-05 15:45:35,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446261174] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:45:35,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:45:35,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:45:35,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458272607] [2025-02-05 15:45:35,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:45:35,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:45:35,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:45:35,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:45:35,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:45:35,763 INFO L87 Difference]: Start difference. First operand 11495 states and 19572 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:45:36,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:45:36,351 INFO L93 Difference]: Finished difference Result 28227 states and 48325 transitions. [2025-02-05 15:45:36,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:45:36,352 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 117 [2025-02-05 15:45:36,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:45:36,444 INFO L225 Difference]: With dead ends: 28227 [2025-02-05 15:45:36,444 INFO L226 Difference]: Without dead ends: 19123 [2025-02-05 15:45:36,487 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:45:36,488 INFO L435 NwaCegarLoop]: 477 mSDtfsCounter, 102 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 948 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:45:36,488 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 948 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:45:36,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19123 states. [2025-02-05 15:45:37,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19123 to 19107. [2025-02-05 15:45:37,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19107 states, 15931 states have (on average 1.6108844391438077) internal successors, (25663), 15936 states have internal predecessors, (25663), 3130 states have call successors, (3130), 40 states have call predecessors, (3130), 45 states have return successors, (3686), 3130 states have call predecessors, (3686), 3128 states have call successors, (3686) [2025-02-05 15:45:37,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19107 states to 19107 states and 32479 transitions. [2025-02-05 15:45:37,554 INFO L78 Accepts]: Start accepts. Automaton has 19107 states and 32479 transitions. Word has length 117 [2025-02-05 15:45:37,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:45:37,555 INFO L471 AbstractCegarLoop]: Abstraction has 19107 states and 32479 transitions. [2025-02-05 15:45:37,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:45:37,555 INFO L276 IsEmpty]: Start isEmpty. Operand 19107 states and 32479 transitions. [2025-02-05 15:45:37,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-02-05 15:45:37,596 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:45:37,596 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:45:37,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 15:45:37,596 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:45:37,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:45:37,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1429888390, now seen corresponding path program 1 times [2025-02-05 15:45:37,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:45:37,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758321337] [2025-02-05 15:45:37,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:45:37,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:45:37,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-05 15:45:37,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-05 15:45:37,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:45:37,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:45:37,660 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-02-05 15:45:37,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:45:37,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758321337] [2025-02-05 15:45:37,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758321337] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:45:37,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:45:37,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:45:37,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103379625] [2025-02-05 15:45:37,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:45:37,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:45:37,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:45:37,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:45:37,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:45:37,662 INFO L87 Difference]: Start difference. First operand 19107 states and 32479 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:45:38,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:45:38,839 INFO L93 Difference]: Finished difference Result 49241 states and 84097 transitions. [2025-02-05 15:45:38,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:45:38,840 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 118 [2025-02-05 15:45:38,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:45:39,045 INFO L225 Difference]: With dead ends: 49241 [2025-02-05 15:45:39,045 INFO L226 Difference]: Without dead ends: 33475 [2025-02-05 15:45:39,115 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:45:39,116 INFO L435 NwaCegarLoop]: 486 mSDtfsCounter, 100 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 961 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:45:39,117 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 961 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:45:39,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33475 states. [2025-02-05 15:45:40,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33475 to 33459. [2025-02-05 15:45:40,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33459 states, 27877 states have (on average 1.602790831151128) internal successors, (44681), 27882 states have internal predecessors, (44681), 5536 states have call successors, (5536), 40 states have call predecessors, (5536), 45 states have return successors, (6517), 5536 states have call predecessors, (6517), 5534 states have call successors, (6517) [2025-02-05 15:45:40,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33459 states to 33459 states and 56734 transitions. [2025-02-05 15:45:40,858 INFO L78 Accepts]: Start accepts. Automaton has 33459 states and 56734 transitions. Word has length 118 [2025-02-05 15:45:40,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:45:40,858 INFO L471 AbstractCegarLoop]: Abstraction has 33459 states and 56734 transitions. [2025-02-05 15:45:40,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:45:40,859 INFO L276 IsEmpty]: Start isEmpty. Operand 33459 states and 56734 transitions. [2025-02-05 15:45:40,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-02-05 15:45:40,905 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:45:40,906 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:45:40,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 15:45:40,906 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:45:40,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:45:40,907 INFO L85 PathProgramCache]: Analyzing trace with hash -984289460, now seen corresponding path program 1 times [2025-02-05 15:45:40,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:45:40,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621595565] [2025-02-05 15:45:40,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:45:40,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:45:40,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-05 15:45:40,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-05 15:45:40,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:45:40,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:45:40,977 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-02-05 15:45:40,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:45:40,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621595565] [2025-02-05 15:45:40,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621595565] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:45:40,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:45:40,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:45:40,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703372985] [2025-02-05 15:45:40,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:45:40,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:45:40,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:45:40,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:45:40,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:45:40,979 INFO L87 Difference]: Start difference. First operand 33459 states and 56734 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:45:42,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:45:42,987 INFO L93 Difference]: Finished difference Result 88403 states and 150656 transitions. [2025-02-05 15:45:42,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:45:42,987 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 119 [2025-02-05 15:45:42,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:45:43,363 INFO L225 Difference]: With dead ends: 88403 [2025-02-05 15:45:43,364 INFO L226 Difference]: Without dead ends: 59623 [2025-02-05 15:45:43,482 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:45:43,483 INFO L435 NwaCegarLoop]: 477 mSDtfsCounter, 98 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 948 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:45:43,484 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 948 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:45:43,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59623 states. [2025-02-05 15:45:46,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59623 to 59607. [2025-02-05 15:45:46,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59607 states, 49947 states have (on average 1.599195146855667) internal successors, (79875), 49952 states have internal predecessors, (79875), 9614 states have call successors, (9614), 40 states have call predecessors, (9614), 45 states have return successors, (11409), 9614 states have call predecessors, (11409), 9612 states have call successors, (11409) [2025-02-05 15:45:46,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59607 states to 59607 states and 100898 transitions. [2025-02-05 15:45:46,700 INFO L78 Accepts]: Start accepts. Automaton has 59607 states and 100898 transitions. Word has length 119 [2025-02-05 15:45:46,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:45:46,701 INFO L471 AbstractCegarLoop]: Abstraction has 59607 states and 100898 transitions. [2025-02-05 15:45:46,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:45:46,701 INFO L276 IsEmpty]: Start isEmpty. Operand 59607 states and 100898 transitions. [2025-02-05 15:45:46,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-02-05 15:45:46,742 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:45:46,742 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:45:46,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 15:45:46,742 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:45:46,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:45:46,743 INFO L85 PathProgramCache]: Analyzing trace with hash 312679291, now seen corresponding path program 1 times [2025-02-05 15:45:46,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:45:46,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668631646] [2025-02-05 15:45:46,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:45:46,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:45:46,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-02-05 15:45:46,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-02-05 15:45:46,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:45:46,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:45:46,802 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-02-05 15:45:46,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:45:46,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668631646] [2025-02-05 15:45:46,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668631646] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:45:46,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:45:46,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:45:46,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73154874] [2025-02-05 15:45:46,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:45:46,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:45:46,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:45:46,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:45:46,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:45:46,805 INFO L87 Difference]: Start difference. First operand 59607 states and 100898 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:45:49,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:45:49,726 INFO L93 Difference]: Finished difference Result 162317 states and 275300 transitions. [2025-02-05 15:45:49,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:45:49,726 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 120 [2025-02-05 15:45:49,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:45:50,587 INFO L225 Difference]: With dead ends: 162317 [2025-02-05 15:45:50,588 INFO L226 Difference]: Without dead ends: 108995 [2025-02-05 15:45:50,743 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:45:50,749 INFO L435 NwaCegarLoop]: 479 mSDtfsCounter, 96 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 950 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:45:50,750 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 950 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:45:50,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108995 states. [2025-02-05 15:45:54,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108995 to 108979. [2025-02-05 15:45:54,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108979 states, 91889 states have (on average 1.594216935650622) internal successors, (146491), 91894 states have internal predecessors, (146491), 17044 states have call successors, (17044), 40 states have call predecessors, (17044), 45 states have return successors, (19903), 17044 states have call predecessors, (19903), 17042 states have call successors, (19903) [2025-02-05 15:45:55,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108979 states to 108979 states and 183438 transitions. [2025-02-05 15:45:55,274 INFO L78 Accepts]: Start accepts. Automaton has 108979 states and 183438 transitions. Word has length 120 [2025-02-05 15:45:55,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:45:55,275 INFO L471 AbstractCegarLoop]: Abstraction has 108979 states and 183438 transitions. [2025-02-05 15:45:55,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:45:55,275 INFO L276 IsEmpty]: Start isEmpty. Operand 108979 states and 183438 transitions. [2025-02-05 15:45:55,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-02-05 15:45:55,329 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:45:55,329 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:45:55,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-05 15:45:55,330 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:45:55,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:45:55,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1688868821, now seen corresponding path program 1 times [2025-02-05 15:45:55,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:45:55,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142384797] [2025-02-05 15:45:55,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:45:55,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:45:55,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-02-05 15:45:55,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-02-05 15:45:55,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:45:55,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:45:55,392 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-02-05 15:45:55,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:45:55,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142384797] [2025-02-05 15:45:55,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142384797] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:45:55,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:45:55,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:45:55,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185237204] [2025-02-05 15:45:55,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:45:55,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:45:55,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:45:55,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:45:55,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:45:55,394 INFO L87 Difference]: Start difference. First operand 108979 states and 183438 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:46:00,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:46:00,181 INFO L93 Difference]: Finished difference Result 203403 states and 343105 transitions. [2025-02-05 15:46:00,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:46:00,181 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 121 [2025-02-05 15:46:00,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:46:01,179 INFO L225 Difference]: With dead ends: 203403 [2025-02-05 15:46:01,180 INFO L226 Difference]: Without dead ends: 203077 [2025-02-05 15:46:01,258 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:46:01,258 INFO L435 NwaCegarLoop]: 486 mSDtfsCounter, 91 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 962 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 15:46:01,258 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 962 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 15:46:01,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203077 states. [2025-02-05 15:46:07,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203077 to 203061. [2025-02-05 15:46:07,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203061 states, 172373 states have (on average 1.587760264078481) internal successors, (273687), 172378 states have internal predecessors, (273687), 30642 states have call successors, (30642), 40 states have call predecessors, (30642), 45 states have return successors, (36116), 30642 states have call predecessors, (36116), 30640 states have call successors, (36116)