./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec8_product31.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_spec8_product31.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 aa31ba7b6b6c5a20100c4ed7bd6bb53a6560ae9fc8557479e094a44cc1bad058 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 15:48:37,794 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 15:48:37,857 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:48:37,862 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 15:48:37,862 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 15:48:37,881 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 15:48:37,882 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 15:48:37,882 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 15:48:37,882 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 15:48:37,882 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 15:48:37,882 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 15:48:37,882 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 15:48:37,882 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 15:48:37,882 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 15:48:37,884 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 15:48:37,884 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 15:48:37,884 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 15:48:37,884 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 15:48:37,885 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 15:48:37,885 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 15:48:37,885 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 15:48:37,885 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 15:48:37,885 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 15:48:37,885 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 15:48:37,885 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 15:48:37,885 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 15:48:37,885 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 15:48:37,885 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 15:48:37,886 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 15:48:37,886 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 15:48:37,886 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 15:48:37,886 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 15:48:37,886 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:48:37,886 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 15:48:37,886 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 15:48:37,886 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 15:48:37,887 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 15:48:37,887 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 15:48:37,887 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 15:48:37,887 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 15:48:37,887 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 15:48:37,887 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 15:48:37,887 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 15:48:37,887 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 -> aa31ba7b6b6c5a20100c4ed7bd6bb53a6560ae9fc8557479e094a44cc1bad058 [2025-02-05 15:48:38,110 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 15:48:38,118 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 15:48:38,120 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 15:48:38,121 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 15:48:38,121 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 15:48:38,122 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec8_product31.cil.c [2025-02-05 15:48:39,300 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9b2a51957/ce00e41a92144a4aa14cea55b0112a57/FLAG7f65b0856 [2025-02-05 15:48:39,626 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 15:48:39,626 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec8_product31.cil.c [2025-02-05 15:48:39,650 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9b2a51957/ce00e41a92144a4aa14cea55b0112a57/FLAG7f65b0856 [2025-02-05 15:48:39,668 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9b2a51957/ce00e41a92144a4aa14cea55b0112a57 [2025-02-05 15:48:39,670 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 15:48:39,671 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 15:48:39,673 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 15:48:39,673 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 15:48:39,677 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 15:48:39,678 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:48:39" (1/1) ... [2025-02-05 15:48:39,678 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7567087d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:48:39, skipping insertion in model container [2025-02-05 15:48:39,679 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:48:39" (1/1) ... [2025-02-05 15:48:39,732 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 15:48:39,976 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_spec8_product31.cil.c[36672,36685] [2025-02-05 15:48:40,126 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:48:40,138 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 15:48:40,144 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [48] [2025-02-05 15:48:40,145 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [1128] [2025-02-05 15:48:40,145 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [1494] [2025-02-05 15:48:40,145 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [1503] [2025-02-05 15:48:40,145 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [1521] [2025-02-05 15:48:40,146 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [1680] [2025-02-05 15:48:40,146 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [2082] [2025-02-05 15:48:40,146 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [2120] [2025-02-05 15:48:40,146 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [2484] [2025-02-05 15:48:40,146 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [2769] [2025-02-05 15:48:40,146 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EncryptAutoResponder_spec.i","") [2985] [2025-02-05 15:48:40,189 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_spec8_product31.cil.c[36672,36685] [2025-02-05 15:48:40,220 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:48:40,244 INFO L204 MainTranslator]: Completed translation [2025-02-05 15:48:40,245 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:48:40 WrapperNode [2025-02-05 15:48:40,245 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 15:48:40,246 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 15:48:40,246 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 15:48:40,246 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 15:48:40,251 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:48:40" (1/1) ... [2025-02-05 15:48:40,273 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:48:40" (1/1) ... [2025-02-05 15:48:40,315 INFO L138 Inliner]: procedures = 132, calls = 207, calls flagged for inlining = 62, calls inlined = 57, statements flattened = 1040 [2025-02-05 15:48:40,315 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 15:48:40,316 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 15:48:40,316 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 15:48:40,316 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 15:48:40,322 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:48:40" (1/1) ... [2025-02-05 15:48:40,323 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:48:40" (1/1) ... [2025-02-05 15:48:40,333 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:48:40" (1/1) ... [2025-02-05 15:48:40,355 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:48:40,355 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:48:40" (1/1) ... [2025-02-05 15:48:40,355 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:48:40" (1/1) ... [2025-02-05 15:48:40,376 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:48:40" (1/1) ... [2025-02-05 15:48:40,378 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:48:40" (1/1) ... [2025-02-05 15:48:40,383 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:48:40" (1/1) ... [2025-02-05 15:48:40,389 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:48:40" (1/1) ... [2025-02-05 15:48:40,394 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 15:48:40,395 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 15:48:40,395 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 15:48:40,395 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 15:48:40,396 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:48:40" (1/1) ... [2025-02-05 15:48:40,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:48:40,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:48:40,424 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:48:40,426 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:48:40,447 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2025-02-05 15:48:40,447 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2025-02-05 15:48:40,447 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2025-02-05 15:48:40,447 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2025-02-05 15:48:40,447 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2025-02-05 15:48:40,447 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2025-02-05 15:48:40,447 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-02-05 15:48:40,447 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-02-05 15:48:40,448 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-02-05 15:48:40,448 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-02-05 15:48:40,448 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2025-02-05 15:48:40,448 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2025-02-05 15:48:40,448 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-02-05 15:48:40,448 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-02-05 15:48:40,448 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2025-02-05 15:48:40,448 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2025-02-05 15:48:40,449 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2025-02-05 15:48:40,450 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2025-02-05 15:48:40,450 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-02-05 15:48:40,450 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-02-05 15:48:40,450 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-02-05 15:48:40,450 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-02-05 15:48:40,450 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-02-05 15:48:40,450 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-02-05 15:48:40,450 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 15:48:40,450 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2025-02-05 15:48:40,450 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2025-02-05 15:48:40,450 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2025-02-05 15:48:40,450 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2025-02-05 15:48:40,450 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-02-05 15:48:40,450 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-02-05 15:48:40,450 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-02-05 15:48:40,450 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-02-05 15:48:40,450 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-02-05 15:48:40,450 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-02-05 15:48:40,450 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2025-02-05 15:48:40,450 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2025-02-05 15:48:40,450 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-02-05 15:48:40,450 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-02-05 15:48:40,450 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2025-02-05 15:48:40,450 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2025-02-05 15:48:40,450 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-02-05 15:48:40,450 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-02-05 15:48:40,450 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-02-05 15:48:40,450 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-02-05 15:48:40,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 15:48:40,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-05 15:48:40,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-05 15:48:40,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-05 15:48:40,451 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-02-05 15:48:40,451 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-02-05 15:48:40,451 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 15:48:40,451 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 15:48:40,615 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 15:48:40,617 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 15:48:40,870 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1105-1: getClientId_#res#1 := getClientId_~retValue_acc~16#1; [2025-02-05 15:48:40,870 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2063-1: isVerified_#res#1 := isVerified_~retValue_acc~35#1; [2025-02-05 15:48:40,870 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1726-1: getEmailId_#res#1 := getEmailId_~retValue_acc~26#1; [2025-02-05 15:48:40,870 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1058-1: getClientForwardReceiver_#res#1 := getClientForwardReceiver_~retValue_acc~15#1; [2025-02-05 15:48:40,880 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1989: #res := ~retValue_acc~33; [2025-02-05 15:48:40,892 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2390: #res := ~retValue_acc~42; [2025-02-05 15:48:40,926 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L762: #res#1 := ~retValue_acc~11#1; [2025-02-05 15:48:40,926 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L717-1: getClientKeyringSize_#res#1 := getClientKeyringSize_~retValue_acc~10#1; [2025-02-05 15:48:40,944 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L986: #res := ~retValue_acc~14; [2025-02-05 15:48:40,952 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L670: #res := ~retValue_acc~9; [2025-02-05 15:48:40,959 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1677-1: createEmail_#res#1 := createEmail_~retValue_acc~24#1; [2025-02-05 15:48:40,969 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1915: #res := ~retValue_acc~31; [2025-02-05 15:48:40,978 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1952: #res := ~retValue_acc~32; [2025-02-05 15:48:40,983 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2026: #res := ~retValue_acc~34; [2025-02-05 15:48:40,999 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1800: #res := ~retValue_acc~28; [2025-02-05 15:48:41,225 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2356-1: get_queued_client_#res#1 := get_queued_client_~retValue_acc~40#1; [2025-02-05 15:48:41,225 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2117-1: valid_product_#res#1 := valid_product_~retValue_acc~37#1; [2025-02-05 15:48:41,225 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2365-1: get_queued_email_#res#1 := get_queued_email_~retValue_acc~41#1; [2025-02-05 15:48:41,225 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L932-1: getClientKeyringPublicKey_#res#1 := getClientKeyringPublicKey_~retValue_acc~13#1; [2025-02-05 15:48:41,225 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L825-1: getClientKeyringUser_#res#1 := getClientKeyringUser_~retValue_acc~12#1; [2025-02-05 15:48:41,225 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2347-1: is_queue_empty_#res#1 := is_queue_empty_~retValue_acc~39#1; [2025-02-05 15:48:41,230 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1763: #res := ~retValue_acc~27; [2025-02-05 15:48:41,242 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1633-1: isReadable__wrappee__Keys_#res#1 := isReadable__wrappee__Keys_~retValue_acc~21#1; [2025-02-05 15:48:41,242 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1653: #res#1 := ~retValue_acc~22#1; [2025-02-05 15:48:41,385 INFO L? ?]: Removed 479 outVars from TransFormulas that were not future-live. [2025-02-05 15:48:41,385 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 15:48:41,403 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 15:48:41,405 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 15:48:41,406 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:48:41 BoogieIcfgContainer [2025-02-05 15:48:41,406 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 15:48:41,408 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 15:48:41,409 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 15:48:41,412 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 15:48:41,412 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 03:48:39" (1/3) ... [2025-02-05 15:48:41,413 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78bafcda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:48:41, skipping insertion in model container [2025-02-05 15:48:41,413 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:48:40" (2/3) ... [2025-02-05 15:48:41,413 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78bafcda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:48:41, skipping insertion in model container [2025-02-05 15:48:41,413 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:48:41" (3/3) ... [2025-02-05 15:48:41,414 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec8_product31.cil.c [2025-02-05 15:48:41,425 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 15:48:41,429 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec8_product31.cil.c that has 24 procedures, 369 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 15:48:41,491 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 15:48:41,501 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;@38339f86, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 15:48:41,502 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 15:48:41,505 INFO L276 IsEmpty]: Start isEmpty. Operand has 369 states, 285 states have (on average 1.4982456140350877) internal successors, (427), 289 states have internal predecessors, (427), 59 states have call successors, (59), 23 states have call predecessors, (59), 23 states have return successors, (59), 59 states have call predecessors, (59), 59 states have call successors, (59) [2025-02-05 15:48:41,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-02-05 15:48:41,517 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:48:41,517 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:48:41,518 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:48:41,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:48:41,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1294011773, now seen corresponding path program 1 times [2025-02-05 15:48:41,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:48:41,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409293657] [2025-02-05 15:48:41,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:41,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:48:41,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-05 15:48:41,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-05 15:48:41,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:41,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:42,094 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-05 15:48:42,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:48:42,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409293657] [2025-02-05 15:48:42,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409293657] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:48:42,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [937199560] [2025-02-05 15:48:42,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:42,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:48:42,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:48:42,098 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:48:42,100 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:48:42,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-05 15:48:42,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-05 15:48:42,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:42,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:42,381 INFO L256 TraceCheckSpWp]: Trace formula consists of 1023 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 15:48:42,387 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:48:42,403 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-05 15:48:42,403 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:48:42,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [937199560] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:48:42,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:48:42,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 5 [2025-02-05 15:48:42,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867928403] [2025-02-05 15:48:42,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:48:42,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 15:48:42,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:48:42,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 15:48:42,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:48:42,430 INFO L87 Difference]: Start difference. First operand has 369 states, 285 states have (on average 1.4982456140350877) internal successors, (427), 289 states have internal predecessors, (427), 59 states have call successors, (59), 23 states have call predecessors, (59), 23 states have return successors, (59), 59 states have call predecessors, (59), 59 states have call successors, (59) Second operand has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-05 15:48:42,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:48:42,483 INFO L93 Difference]: Finished difference Result 585 states and 846 transitions. [2025-02-05 15:48:42,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 15:48:42,485 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 101 [2025-02-05 15:48:42,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:48:42,494 INFO L225 Difference]: With dead ends: 585 [2025-02-05 15:48:42,494 INFO L226 Difference]: Without dead ends: 362 [2025-02-05 15:48:42,498 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 102 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:48:42,500 INFO L435 NwaCegarLoop]: 542 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, 542 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:48:42,500 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 542 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:48:42,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2025-02-05 15:48:42,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 362. [2025-02-05 15:48:42,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 279 states have (on average 1.4946236559139785) internal successors, (417), 282 states have internal predecessors, (417), 59 states have call successors, (59), 23 states have call predecessors, (59), 23 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2025-02-05 15:48:42,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 534 transitions. [2025-02-05 15:48:42,544 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 534 transitions. Word has length 101 [2025-02-05 15:48:42,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:48:42,545 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 534 transitions. [2025-02-05 15:48:42,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-05 15:48:42,545 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 534 transitions. [2025-02-05 15:48:42,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-02-05 15:48:42,552 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:48:42,552 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:48:42,566 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:48:42,753 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:48:42,753 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:48:42,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:48:42,754 INFO L85 PathProgramCache]: Analyzing trace with hash 116294191, now seen corresponding path program 1 times [2025-02-05 15:48:42,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:48:42,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712245568] [2025-02-05 15:48:42,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:42,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:48:42,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-05 15:48:42,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-05 15:48:42,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:42,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:42,977 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-05 15:48:42,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:48:42,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712245568] [2025-02-05 15:48:42,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712245568] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:48:42,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1113104706] [2025-02-05 15:48:42,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:42,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:48:42,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:48:42,982 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:48:42,984 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:48:43,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-05 15:48:43,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-05 15:48:43,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:43,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:43,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 1024 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 15:48:43,262 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:48:43,281 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-05 15:48:43,282 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:48:43,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1113104706] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:48:43,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:48:43,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-02-05 15:48:43,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747499036] [2025-02-05 15:48:43,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:48:43,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:48:43,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:48:43,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:48:43,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:48:43,283 INFO L87 Difference]: Start difference. First operand 362 states and 534 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-05 15:48:43,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:48:43,323 INFO L93 Difference]: Finished difference Result 574 states and 827 transitions. [2025-02-05 15:48:43,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:48:43,323 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 102 [2025-02-05 15:48:43,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:48:43,326 INFO L225 Difference]: With dead ends: 574 [2025-02-05 15:48:43,327 INFO L226 Difference]: Without dead ends: 364 [2025-02-05 15:48:43,328 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 102 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:48:43,329 INFO L435 NwaCegarLoop]: 533 mSDtfsCounter, 0 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1064 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:48:43,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1064 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:48:43,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2025-02-05 15:48:43,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 364. [2025-02-05 15:48:43,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 281 states have (on average 1.491103202846975) internal successors, (419), 284 states have internal predecessors, (419), 59 states have call successors, (59), 23 states have call predecessors, (59), 23 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2025-02-05 15:48:43,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 536 transitions. [2025-02-05 15:48:43,349 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 536 transitions. Word has length 102 [2025-02-05 15:48:43,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:48:43,350 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 536 transitions. [2025-02-05 15:48:43,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-05 15:48:43,350 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 536 transitions. [2025-02-05 15:48:43,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-02-05 15:48:43,352 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:48:43,353 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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:48:43,360 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 15:48:43,553 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:48:43,553 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:48:43,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:48:43,554 INFO L85 PathProgramCache]: Analyzing trace with hash -1462067000, now seen corresponding path program 1 times [2025-02-05 15:48:43,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:48:43,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742559632] [2025-02-05 15:48:43,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:43,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:48:43,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-05 15:48:43,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-05 15:48:43,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:43,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:43,780 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-05 15:48:43,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:48:43,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742559632] [2025-02-05 15:48:43,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742559632] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:48:43,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1479553526] [2025-02-05 15:48:43,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:43,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:48:43,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:48:43,785 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:48:43,786 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:48:43,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-05 15:48:44,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-05 15:48:44,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:44,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:44,053 INFO L256 TraceCheckSpWp]: Trace formula consists of 1036 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 15:48:44,056 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:48:44,073 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-05 15:48:44,073 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:48:44,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1479553526] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:48:44,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:48:44,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-02-05 15:48:44,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446177872] [2025-02-05 15:48:44,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:48:44,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:48:44,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:48:44,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:48:44,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:48:44,077 INFO L87 Difference]: Start difference. First operand 364 states and 536 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-05 15:48:44,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:48:44,111 INFO L93 Difference]: Finished difference Result 757 states and 1130 transitions. [2025-02-05 15:48:44,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:48:44,112 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 107 [2025-02-05 15:48:44,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:48:44,115 INFO L225 Difference]: With dead ends: 757 [2025-02-05 15:48:44,115 INFO L226 Difference]: Without dead ends: 420 [2025-02-05 15:48:44,116 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 107 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:48:44,117 INFO L435 NwaCegarLoop]: 548 mSDtfsCounter, 107 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 1036 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:48:44,117 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 1036 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:48:44,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2025-02-05 15:48:44,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 412. [2025-02-05 15:48:44,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 318 states have (on average 1.509433962264151) internal successors, (480), 321 states have internal predecessors, (480), 70 states have call successors, (70), 23 states have call predecessors, (70), 23 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) [2025-02-05 15:48:44,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 619 transitions. [2025-02-05 15:48:44,135 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 619 transitions. Word has length 107 [2025-02-05 15:48:44,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:48:44,135 INFO L471 AbstractCegarLoop]: Abstraction has 412 states and 619 transitions. [2025-02-05 15:48:44,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-05 15:48:44,136 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 619 transitions. [2025-02-05 15:48:44,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-02-05 15:48:44,138 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:48:44,138 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2025-02-05 15:48:44,146 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:48:44,338 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:48:44,339 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:48:44,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:48:44,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1349621324, now seen corresponding path program 1 times [2025-02-05 15:48:44,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:48:44,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844920554] [2025-02-05 15:48:44,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:44,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:48:44,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-05 15:48:44,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-05 15:48:44,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:44,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:44,508 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-05 15:48:44,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:48:44,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844920554] [2025-02-05 15:48:44,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844920554] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:48:44,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1337021051] [2025-02-05 15:48:44,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:44,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:48:44,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:48:44,511 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:48:44,513 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:48:44,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-05 15:48:44,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-05 15:48:44,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:44,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:44,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 1041 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-05 15:48:44,751 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:48:44,803 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-05 15:48:44,803 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:48:44,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1337021051] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:48:44,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:48:44,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-02-05 15:48:44,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287499623] [2025-02-05 15:48:44,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:48:44,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:48:44,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:48:44,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:48:44,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:48:44,805 INFO L87 Difference]: Start difference. First operand 412 states and 619 transitions. Second operand has 5 states, 4 states have (on average 18.25) internal successors, (73), 5 states have internal predecessors, (73), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-02-05 15:48:44,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:48:44,875 INFO L93 Difference]: Finished difference Result 815 states and 1228 transitions. [2025-02-05 15:48:44,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:48:44,876 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 18.25) internal successors, (73), 5 states have internal predecessors, (73), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 108 [2025-02-05 15:48:44,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:48:44,879 INFO L225 Difference]: With dead ends: 815 [2025-02-05 15:48:44,879 INFO L226 Difference]: Without dead ends: 414 [2025-02-05 15:48:44,881 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:48:44,882 INFO L435 NwaCegarLoop]: 526 mSDtfsCounter, 2 mSDsluCounter, 1567 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2093 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:48:44,883 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2093 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:48:44,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2025-02-05 15:48:44,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 414. [2025-02-05 15:48:44,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 319 states have (on average 1.5078369905956113) internal successors, (481), 323 states have internal predecessors, (481), 70 states have call successors, (70), 23 states have call predecessors, (70), 24 states have return successors, (71), 69 states have call predecessors, (71), 69 states have call successors, (71) [2025-02-05 15:48:44,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 622 transitions. [2025-02-05 15:48:44,907 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 622 transitions. Word has length 108 [2025-02-05 15:48:44,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:48:44,907 INFO L471 AbstractCegarLoop]: Abstraction has 414 states and 622 transitions. [2025-02-05 15:48:44,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 18.25) internal successors, (73), 5 states have internal predecessors, (73), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-02-05 15:48:44,907 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 622 transitions. [2025-02-05 15:48:44,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-02-05 15:48:44,910 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:48:44,910 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2025-02-05 15:48:44,919 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:48:45,115 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:48:45,116 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:48:45,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:48:45,116 INFO L85 PathProgramCache]: Analyzing trace with hash -857011006, now seen corresponding path program 1 times [2025-02-05 15:48:45,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:48:45,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676430711] [2025-02-05 15:48:45,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:45,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:48:45,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-05 15:48:45,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-05 15:48:45,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:45,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:45,325 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-05 15:48:45,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:48:45,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676430711] [2025-02-05 15:48:45,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676430711] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:48:45,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1085010758] [2025-02-05 15:48:45,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:45,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:48:45,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:48:45,330 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:48:45,331 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:48:45,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-05 15:48:45,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-05 15:48:45,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:45,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:45,560 INFO L256 TraceCheckSpWp]: Trace formula consists of 1042 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 15:48:45,563 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:48:45,609 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-05 15:48:45,609 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:48:45,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1085010758] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:48:45,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:48:45,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-02-05 15:48:45,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783304464] [2025-02-05 15:48:45,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:48:45,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:48:45,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:48:45,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:48:45,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-02-05 15:48:45,610 INFO L87 Difference]: Start difference. First operand 414 states and 622 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-02-05 15:48:45,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:48:45,698 INFO L93 Difference]: Finished difference Result 817 states and 1233 transitions. [2025-02-05 15:48:45,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:48:45,701 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 109 [2025-02-05 15:48:45,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:48:45,705 INFO L225 Difference]: With dead ends: 817 [2025-02-05 15:48:45,706 INFO L226 Difference]: Without dead ends: 416 [2025-02-05 15:48:45,708 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-02-05 15:48:45,708 INFO L435 NwaCegarLoop]: 524 mSDtfsCounter, 2 mSDsluCounter, 1555 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2079 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.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:48:45,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2079 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:48:45,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2025-02-05 15:48:45,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 416. [2025-02-05 15:48:45,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 320 states have (on average 1.50625) internal successors, (482), 325 states have internal predecessors, (482), 70 states have call successors, (70), 23 states have call predecessors, (70), 25 states have return successors, (76), 69 states have call predecessors, (76), 69 states have call successors, (76) [2025-02-05 15:48:45,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 628 transitions. [2025-02-05 15:48:45,727 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 628 transitions. Word has length 109 [2025-02-05 15:48:45,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:48:45,727 INFO L471 AbstractCegarLoop]: Abstraction has 416 states and 628 transitions. [2025-02-05 15:48:45,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-02-05 15:48:45,728 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 628 transitions. [2025-02-05 15:48:45,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-02-05 15:48:45,730 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:48:45,730 INFO L218 NwaCegarLoop]: trace histogram [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, 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:48:45,740 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:48:45,930 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:48:45,931 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:48:45,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:48:45,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1648592166, now seen corresponding path program 1 times [2025-02-05 15:48:45,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:48:45,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035463027] [2025-02-05 15:48:45,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:45,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:48:45,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-05 15:48:45,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-05 15:48:45,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:45,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:46,086 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-05 15:48:46,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:48:46,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035463027] [2025-02-05 15:48:46,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035463027] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:48:46,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:48:46,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:48:46,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405947816] [2025-02-05 15:48:46,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:48:46,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:48:46,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:48:46,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:48:46,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:48:46,089 INFO L87 Difference]: Start difference. First operand 416 states and 628 transitions. Second operand has 5 states, 4 states have (on average 17.75) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-02-05 15:48:46,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:48:46,137 INFO L93 Difference]: Finished difference Result 809 states and 1224 transitions. [2025-02-05 15:48:46,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:48:46,138 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.75) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 110 [2025-02-05 15:48:46,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:48:46,142 INFO L225 Difference]: With dead ends: 809 [2025-02-05 15:48:46,142 INFO L226 Difference]: Without dead ends: 416 [2025-02-05 15:48:46,144 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:48:46,145 INFO L435 NwaCegarLoop]: 527 mSDtfsCounter, 2 mSDsluCounter, 1570 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2097 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:48:46,145 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2097 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:48:46,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2025-02-05 15:48:46,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 416. [2025-02-05 15:48:46,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 320 states have (on average 1.50625) internal successors, (482), 325 states have internal predecessors, (482), 70 states have call successors, (70), 23 states have call predecessors, (70), 25 states have return successors, (75), 69 states have call predecessors, (75), 69 states have call successors, (75) [2025-02-05 15:48:46,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 627 transitions. [2025-02-05 15:48:46,164 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 627 transitions. Word has length 110 [2025-02-05 15:48:46,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:48:46,165 INFO L471 AbstractCegarLoop]: Abstraction has 416 states and 627 transitions. [2025-02-05 15:48:46,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.75) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-02-05 15:48:46,165 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 627 transitions. [2025-02-05 15:48:46,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-02-05 15:48:46,167 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:48:46,167 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] [2025-02-05 15:48:46,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 15:48:46,168 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:48:46,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:48:46,168 INFO L85 PathProgramCache]: Analyzing trace with hash 778972370, now seen corresponding path program 2 times [2025-02-05 15:48:46,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:48:46,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060659501] [2025-02-05 15:48:46,169 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 15:48:46,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:48:46,218 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 111 statements into 2 equivalence classes. [2025-02-05 15:48:46,228 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 111 of 111 statements. [2025-02-05 15:48:46,229 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 15:48:46,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:46,327 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-05 15:48:46,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:48:46,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060659501] [2025-02-05 15:48:46,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060659501] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:48:46,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:48:46,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:48:46,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79737255] [2025-02-05 15:48:46,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:48:46,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:48:46,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:48:46,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:48:46,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:48:46,329 INFO L87 Difference]: Start difference. First operand 416 states and 627 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-02-05 15:48:46,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:48:46,376 INFO L93 Difference]: Finished difference Result 807 states and 1219 transitions. [2025-02-05 15:48:46,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:48:46,376 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 111 [2025-02-05 15:48:46,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:48:46,379 INFO L225 Difference]: With dead ends: 807 [2025-02-05 15:48:46,379 INFO L226 Difference]: Without dead ends: 416 [2025-02-05 15:48:46,380 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:48:46,380 INFO L435 NwaCegarLoop]: 525 mSDtfsCounter, 2 mSDsluCounter, 1558 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2083 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:48:46,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2083 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:48:46,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2025-02-05 15:48:46,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 416. [2025-02-05 15:48:46,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 320 states have (on average 1.50625) internal successors, (482), 325 states have internal predecessors, (482), 70 states have call successors, (70), 23 states have call predecessors, (70), 25 states have return successors, (74), 69 states have call predecessors, (74), 69 states have call successors, (74) [2025-02-05 15:48:46,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 626 transitions. [2025-02-05 15:48:46,397 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 626 transitions. Word has length 111 [2025-02-05 15:48:46,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:48:46,397 INFO L471 AbstractCegarLoop]: Abstraction has 416 states and 626 transitions. [2025-02-05 15:48:46,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-02-05 15:48:46,398 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 626 transitions. [2025-02-05 15:48:46,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-02-05 15:48:46,399 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:48:46,399 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, 1, 1, 1] [2025-02-05 15:48:46,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 15:48:46,399 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:48:46,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:48:46,399 INFO L85 PathProgramCache]: Analyzing trace with hash 2079634324, now seen corresponding path program 3 times [2025-02-05 15:48:46,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:48:46,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397218197] [2025-02-05 15:48:46,400 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 15:48:46,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:48:46,415 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 112 statements into 3 equivalence classes. [2025-02-05 15:48:46,423 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 100 of 112 statements. [2025-02-05 15:48:46,423 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-05 15:48:46,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:46,495 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-05 15:48:46,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:48:46,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397218197] [2025-02-05 15:48:46,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397218197] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:48:46,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:48:46,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:48:46,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672212920] [2025-02-05 15:48:46,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:48:46,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:48:46,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:48:46,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:48:46,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:48:46,497 INFO L87 Difference]: Start difference. First operand 416 states and 626 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-02-05 15:48:46,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:48:46,550 INFO L93 Difference]: Finished difference Result 809 states and 1225 transitions. [2025-02-05 15:48:46,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:48:46,550 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 112 [2025-02-05 15:48:46,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:48:46,554 INFO L225 Difference]: With dead ends: 809 [2025-02-05 15:48:46,554 INFO L226 Difference]: Without dead ends: 418 [2025-02-05 15:48:46,555 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:48:46,555 INFO L435 NwaCegarLoop]: 528 mSDtfsCounter, 1 mSDsluCounter, 1566 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2094 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.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:48:46,556 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2094 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:48:46,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2025-02-05 15:48:46,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 418. [2025-02-05 15:48:46,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 321 states have (on average 1.5046728971962617) internal successors, (483), 327 states have internal predecessors, (483), 70 states have call successors, (70), 23 states have call predecessors, (70), 26 states have return successors, (79), 69 states have call predecessors, (79), 69 states have call successors, (79) [2025-02-05 15:48:46,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 632 transitions. [2025-02-05 15:48:46,571 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 632 transitions. Word has length 112 [2025-02-05 15:48:46,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:48:46,571 INFO L471 AbstractCegarLoop]: Abstraction has 418 states and 632 transitions. [2025-02-05 15:48:46,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-02-05 15:48:46,571 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 632 transitions. [2025-02-05 15:48:46,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-02-05 15:48:46,573 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:48:46,573 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:48:46,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 15:48:46,573 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:48:46,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:48:46,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1372061487, now seen corresponding path program 1 times [2025-02-05 15:48:46,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:48:46,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723724684] [2025-02-05 15:48:46,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:46,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:48:46,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-02-05 15:48:46,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-02-05 15:48:46,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:46,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:46,701 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-05 15:48:46,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:48:46,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723724684] [2025-02-05 15:48:46,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723724684] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:48:46,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:48:46,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:48:46,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411024172] [2025-02-05 15:48:46,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:48:46,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:48:46,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:48:46,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:48:46,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:48:46,702 INFO L87 Difference]: Start difference. First operand 418 states and 632 transitions. Second operand has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 states have internal predecessors, (74), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-02-05 15:48:46,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:48:46,744 INFO L93 Difference]: Finished difference Result 815 states and 1235 transitions. [2025-02-05 15:48:46,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:48:46,744 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 states have internal predecessors, (74), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 113 [2025-02-05 15:48:46,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:48:46,747 INFO L225 Difference]: With dead ends: 815 [2025-02-05 15:48:46,747 INFO L226 Difference]: Without dead ends: 420 [2025-02-05 15:48:46,748 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:48:46,751 INFO L435 NwaCegarLoop]: 528 mSDtfsCounter, 1 mSDsluCounter, 1572 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2100 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:48:46,751 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2100 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:48:46,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2025-02-05 15:48:46,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 420. [2025-02-05 15:48:46,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 322 states have (on average 1.5031055900621118) internal successors, (484), 329 states have internal predecessors, (484), 70 states have call successors, (70), 23 states have call predecessors, (70), 27 states have return successors, (81), 69 states have call predecessors, (81), 69 states have call successors, (81) [2025-02-05 15:48:46,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 635 transitions. [2025-02-05 15:48:46,768 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 635 transitions. Word has length 113 [2025-02-05 15:48:46,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:48:46,769 INFO L471 AbstractCegarLoop]: Abstraction has 420 states and 635 transitions. [2025-02-05 15:48:46,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 states have internal predecessors, (74), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-02-05 15:48:46,769 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 635 transitions. [2025-02-05 15:48:46,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-02-05 15:48:46,771 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:48:46,771 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 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:48:46,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 15:48:46,771 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:48:46,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:48:46,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1950725408, now seen corresponding path program 1 times [2025-02-05 15:48:46,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:48:46,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177103639] [2025-02-05 15:48:46,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:46,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:48:46,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-02-05 15:48:46,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-02-05 15:48:46,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:46,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:46,869 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:48:46,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:48:46,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177103639] [2025-02-05 15:48:46,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177103639] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:48:46,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [566261919] [2025-02-05 15:48:46,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:46,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:48:46,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:48:46,871 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:48:46,873 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:48:47,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-02-05 15:48:47,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-02-05 15:48:47,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:47,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:47,106 INFO L256 TraceCheckSpWp]: Trace formula consists of 1047 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 15:48:47,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:48:47,127 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:48:47,129 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:48:47,222 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:48:47,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [566261919] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:48:47,222 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:48:47,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-05 15:48:47,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278440759] [2025-02-05 15:48:47,222 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:48:47,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 15:48:47,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:48:47,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 15:48:47,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:48:47,223 INFO L87 Difference]: Start difference. First operand 420 states and 635 transitions. Second operand has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 7 states have internal predecessors, (104), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-02-05 15:48:47,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:48:47,348 INFO L93 Difference]: Finished difference Result 977 states and 1529 transitions. [2025-02-05 15:48:47,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:48:47,348 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 7 states have internal predecessors, (104), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 114 [2025-02-05 15:48:47,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:48:47,354 INFO L225 Difference]: With dead ends: 977 [2025-02-05 15:48:47,354 INFO L226 Difference]: Without dead ends: 767 [2025-02-05 15:48:47,355 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:48:47,356 INFO L435 NwaCegarLoop]: 579 mSDtfsCounter, 407 mSDsluCounter, 1445 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 452 SdHoareTripleChecker+Valid, 2024 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:48:47,356 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [452 Valid, 2024 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:48:47,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 767 states. [2025-02-05 15:48:47,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 767 to 743. [2025-02-05 15:48:47,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 743 states, 581 states have (on average 1.5783132530120483) internal successors, (917), 588 states have internal predecessors, (917), 134 states have call successors, (134), 23 states have call predecessors, (134), 27 states have return successors, (155), 133 states have call predecessors, (155), 133 states have call successors, (155) [2025-02-05 15:48:47,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 743 states and 1206 transitions. [2025-02-05 15:48:47,391 INFO L78 Accepts]: Start accepts. Automaton has 743 states and 1206 transitions. Word has length 114 [2025-02-05 15:48:47,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:48:47,392 INFO L471 AbstractCegarLoop]: Abstraction has 743 states and 1206 transitions. [2025-02-05 15:48:47,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 7 states have internal predecessors, (104), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-02-05 15:48:47,392 INFO L276 IsEmpty]: Start isEmpty. Operand 743 states and 1206 transitions. [2025-02-05 15:48:47,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-02-05 15:48:47,395 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:48:47,396 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:48:47,410 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:48:47,596 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,SelfDestructingSolverStorable9 [2025-02-05 15:48:47,596 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:48:47,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:48:47,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1389448960, now seen corresponding path program 1 times [2025-02-05 15:48:47,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:48:47,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702429843] [2025-02-05 15:48:47,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:47,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:48:47,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-02-05 15:48:47,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-02-05 15:48:47,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:47,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:47,671 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:48:47,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:48:47,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702429843] [2025-02-05 15:48:47,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702429843] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:48:47,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:48:47,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:48:47,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363216365] [2025-02-05 15:48:47,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:48:47,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:48:47,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:48:47,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:48:47,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:48:47,673 INFO L87 Difference]: Start difference. First operand 743 states and 1206 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-05 15:48:47,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:48:47,710 INFO L93 Difference]: Finished difference Result 1748 states and 2881 transitions. [2025-02-05 15:48:47,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:48:47,711 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 120 [2025-02-05 15:48:47,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:48:47,719 INFO L225 Difference]: With dead ends: 1748 [2025-02-05 15:48:47,720 INFO L226 Difference]: Without dead ends: 1071 [2025-02-05 15:48:47,723 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:48:47,724 INFO L435 NwaCegarLoop]: 538 mSDtfsCounter, 105 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 1068 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:48:47,724 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 1068 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:48:47,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1071 states. [2025-02-05 15:48:47,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1071 to 1063. [2025-02-05 15:48:47,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1063 states, 837 states have (on average 1.5973715651135005) internal successors, (1337), 844 states have internal predecessors, (1337), 198 states have call successors, (198), 23 states have call predecessors, (198), 27 states have return successors, (229), 197 states have call predecessors, (229), 197 states have call successors, (229) [2025-02-05 15:48:47,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1063 states to 1063 states and 1764 transitions. [2025-02-05 15:48:47,780 INFO L78 Accepts]: Start accepts. Automaton has 1063 states and 1764 transitions. Word has length 120 [2025-02-05 15:48:47,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:48:47,781 INFO L471 AbstractCegarLoop]: Abstraction has 1063 states and 1764 transitions. [2025-02-05 15:48:47,781 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-05 15:48:47,781 INFO L276 IsEmpty]: Start isEmpty. Operand 1063 states and 1764 transitions. [2025-02-05 15:48:47,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-02-05 15:48:47,786 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:48:47,786 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:48:47,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 15:48:47,787 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:48:47,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:48:47,787 INFO L85 PathProgramCache]: Analyzing trace with hash 589148251, now seen corresponding path program 1 times [2025-02-05 15:48:47,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:48:47,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95303306] [2025-02-05 15:48:47,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:47,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:48:47,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-02-05 15:48:47,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-02-05 15:48:47,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:47,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:47,852 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:48:47,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:48:47,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95303306] [2025-02-05 15:48:47,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95303306] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:48:47,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:48:47,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:48:47,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043396999] [2025-02-05 15:48:47,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:48:47,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:48:47,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:48:47,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:48:47,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:48:47,854 INFO L87 Difference]: Start difference. First operand 1063 states and 1764 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-05 15:48:47,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:48:47,909 INFO L93 Difference]: Finished difference Result 2517 states and 4203 transitions. [2025-02-05 15:48:47,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:48:47,910 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 121 [2025-02-05 15:48:47,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:48:47,921 INFO L225 Difference]: With dead ends: 2517 [2025-02-05 15:48:47,921 INFO L226 Difference]: Without dead ends: 1571 [2025-02-05 15:48:47,926 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:48:47,927 INFO L435 NwaCegarLoop]: 533 mSDtfsCounter, 103 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 1060 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:48:47,927 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 1060 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:48:47,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1571 states. [2025-02-05 15:48:48,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1571 to 1563. [2025-02-05 15:48:48,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1563 states, 1242 states have (on average 1.6103059581320451) internal successors, (2000), 1249 states have internal predecessors, (2000), 293 states have call successors, (293), 23 states have call predecessors, (293), 27 states have return successors, (324), 292 states have call predecessors, (324), 292 states have call successors, (324) [2025-02-05 15:48:48,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1563 states and 2617 transitions. [2025-02-05 15:48:48,020 INFO L78 Accepts]: Start accepts. Automaton has 1563 states and 2617 transitions. Word has length 121 [2025-02-05 15:48:48,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:48:48,020 INFO L471 AbstractCegarLoop]: Abstraction has 1563 states and 2617 transitions. [2025-02-05 15:48:48,021 INFO L472 AbstractCegarLoop]: INTERPOLANT 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-05 15:48:48,021 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 2617 transitions. [2025-02-05 15:48:48,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-02-05 15:48:48,031 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:48:48,031 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:48:48,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 15:48:48,031 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:48:48,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:48:48,032 INFO L85 PathProgramCache]: Analyzing trace with hash 968314305, now seen corresponding path program 1 times [2025-02-05 15:48:48,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:48:48,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568579659] [2025-02-05 15:48:48,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:48,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:48:48,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-05 15:48:48,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-05 15:48:48,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:48,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:48,104 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:48:48,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:48:48,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568579659] [2025-02-05 15:48:48,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568579659] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:48:48,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:48:48,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:48:48,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337007410] [2025-02-05 15:48:48,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:48:48,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:48:48,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:48:48,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:48:48,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:48:48,107 INFO L87 Difference]: Start difference. First operand 1563 states and 2617 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-05 15:48:48,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:48:48,224 INFO L93 Difference]: Finished difference Result 3651 states and 6160 transitions. [2025-02-05 15:48:48,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:48:48,225 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 122 [2025-02-05 15:48:48,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:48:48,243 INFO L225 Difference]: With dead ends: 3651 [2025-02-05 15:48:48,244 INFO L226 Difference]: Without dead ends: 2327 [2025-02-05 15:48:48,251 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:48:48,252 INFO L435 NwaCegarLoop]: 533 mSDtfsCounter, 101 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 1057 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:48:48,252 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 1057 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:48:48,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2327 states. [2025-02-05 15:48:48,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2327 to 2319. [2025-02-05 15:48:48,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2319 states, 1875 states have (on average 1.6202666666666667) internal successors, (3038), 1882 states have internal predecessors, (3038), 416 states have call successors, (416), 23 states have call predecessors, (416), 27 states have return successors, (463), 415 states have call predecessors, (463), 415 states have call successors, (463) [2025-02-05 15:48:48,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2319 states to 2319 states and 3917 transitions. [2025-02-05 15:48:48,419 INFO L78 Accepts]: Start accepts. Automaton has 2319 states and 3917 transitions. Word has length 122 [2025-02-05 15:48:48,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:48:48,420 INFO L471 AbstractCegarLoop]: Abstraction has 2319 states and 3917 transitions. [2025-02-05 15:48:48,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-05 15:48:48,420 INFO L276 IsEmpty]: Start isEmpty. Operand 2319 states and 3917 transitions. [2025-02-05 15:48:48,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-05 15:48:48,434 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:48:48,434 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:48:48,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 15:48:48,435 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:48:48,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:48:48,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1670644742, now seen corresponding path program 1 times [2025-02-05 15:48:48,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:48:48,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124620774] [2025-02-05 15:48:48,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:48,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:48:48,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-05 15:48:48,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-05 15:48:48,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:48,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:48,499 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:48:48,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:48:48,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124620774] [2025-02-05 15:48:48,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124620774] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:48:48,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:48:48,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:48:48,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24905244] [2025-02-05 15:48:48,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:48:48,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:48:48,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:48:48,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:48:48,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:48:48,501 INFO L87 Difference]: Start difference. First operand 2319 states and 3917 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-05 15:48:48,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:48:48,622 INFO L93 Difference]: Finished difference Result 5414 states and 9206 transitions. [2025-02-05 15:48:48,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:48:48,623 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 123 [2025-02-05 15:48:48,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:48:48,649 INFO L225 Difference]: With dead ends: 5414 [2025-02-05 15:48:48,649 INFO L226 Difference]: Without dead ends: 3534 [2025-02-05 15:48:48,659 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:48:48,660 INFO L435 NwaCegarLoop]: 533 mSDtfsCounter, 99 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 1057 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:48:48,660 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 1057 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:48:48,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3534 states. [2025-02-05 15:48:48,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3534 to 3526. [2025-02-05 15:48:48,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3526 states, 2903 states have (on average 1.6269376507061661) internal successors, (4723), 2910 states have internal predecessors, (4723), 595 states have call successors, (595), 23 states have call predecessors, (595), 27 states have return successors, (668), 594 states have call predecessors, (668), 594 states have call successors, (668) [2025-02-05 15:48:48,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3526 states to 3526 states and 5986 transitions. [2025-02-05 15:48:48,880 INFO L78 Accepts]: Start accepts. Automaton has 3526 states and 5986 transitions. Word has length 123 [2025-02-05 15:48:48,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:48:48,881 INFO L471 AbstractCegarLoop]: Abstraction has 3526 states and 5986 transitions. [2025-02-05 15:48:48,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-05 15:48:48,881 INFO L276 IsEmpty]: Start isEmpty. Operand 3526 states and 5986 transitions. [2025-02-05 15:48:48,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-02-05 15:48:48,896 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:48:48,897 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:48:48,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 15:48:48,897 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:48:48,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:48:48,897 INFO L85 PathProgramCache]: Analyzing trace with hash -551293086, now seen corresponding path program 1 times [2025-02-05 15:48:48,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:48:48,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693751616] [2025-02-05 15:48:48,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:48,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:48:48,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-05 15:48:48,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-05 15:48:48,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:48,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:48,964 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:48:48,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:48:48,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693751616] [2025-02-05 15:48:48,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693751616] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:48:48,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:48:48,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:48:48,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246628206] [2025-02-05 15:48:48,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:48:48,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:48:48,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:48:48,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:48:48,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:48:48,967 INFO L87 Difference]: Start difference. First operand 3526 states and 5986 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-05 15:48:49,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:48:49,131 INFO L93 Difference]: Finished difference Result 8306 states and 14197 transitions. [2025-02-05 15:48:49,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:48:49,132 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 124 [2025-02-05 15:48:49,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:48:49,169 INFO L225 Difference]: With dead ends: 8306 [2025-02-05 15:48:49,169 INFO L226 Difference]: Without dead ends: 5526 [2025-02-05 15:48:49,183 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:48:49,183 INFO L435 NwaCegarLoop]: 548 mSDtfsCounter, 97 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 1071 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:48:49,184 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 1071 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:48:49,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5526 states. [2025-02-05 15:48:49,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5526 to 5518. [2025-02-05 15:48:49,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5518 states, 4519 states have (on average 1.6233680017703032) internal successors, (7336), 4526 states have internal predecessors, (7336), 971 states have call successors, (971), 23 states have call predecessors, (971), 27 states have return successors, (1088), 970 states have call predecessors, (1088), 970 states have call successors, (1088) [2025-02-05 15:48:49,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5518 states to 5518 states and 9395 transitions. [2025-02-05 15:48:49,514 INFO L78 Accepts]: Start accepts. Automaton has 5518 states and 9395 transitions. Word has length 124 [2025-02-05 15:48:49,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:48:49,515 INFO L471 AbstractCegarLoop]: Abstraction has 5518 states and 9395 transitions. [2025-02-05 15:48:49,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-05 15:48:49,515 INFO L276 IsEmpty]: Start isEmpty. Operand 5518 states and 9395 transitions. [2025-02-05 15:48:49,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-02-05 15:48:49,540 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:48:49,541 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:48:49,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 15:48:49,541 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:48:49,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:48:49,542 INFO L85 PathProgramCache]: Analyzing trace with hash -21995111, now seen corresponding path program 1 times [2025-02-05 15:48:49,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:48:49,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123419195] [2025-02-05 15:48:49,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:49,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:48:49,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-05 15:48:49,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-05 15:48:49,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:49,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:49,619 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:48:49,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:48:49,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123419195] [2025-02-05 15:48:49,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123419195] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:48:49,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:48:49,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:48:49,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519643394] [2025-02-05 15:48:49,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:48:49,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:48:49,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:48:49,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:48:49,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:48:49,623 INFO L87 Difference]: Start difference. First operand 5518 states and 9395 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-05 15:48:49,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:48:49,828 INFO L93 Difference]: Finished difference Result 13538 states and 23202 transitions. [2025-02-05 15:48:49,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:48:49,832 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 125 [2025-02-05 15:48:49,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:48:49,878 INFO L225 Difference]: With dead ends: 13538 [2025-02-05 15:48:49,879 INFO L226 Difference]: Without dead ends: 9137 [2025-02-05 15:48:49,895 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:48:49,896 INFO L435 NwaCegarLoop]: 542 mSDtfsCounter, 95 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 1070 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:48:49,896 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 1070 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:48:49,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9137 states. [2025-02-05 15:48:50,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9137 to 9129. [2025-02-05 15:48:50,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9129 states, 7524 states have (on average 1.6228070175438596) internal successors, (12210), 7531 states have internal predecessors, (12210), 1577 states have call successors, (1577), 23 states have call predecessors, (1577), 27 states have return successors, (1772), 1576 states have call predecessors, (1772), 1576 states have call successors, (1772) [2025-02-05 15:48:50,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9129 states to 9129 states and 15559 transitions. [2025-02-05 15:48:50,329 INFO L78 Accepts]: Start accepts. Automaton has 9129 states and 15559 transitions. Word has length 125 [2025-02-05 15:48:50,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:48:50,330 INFO L471 AbstractCegarLoop]: Abstraction has 9129 states and 15559 transitions. [2025-02-05 15:48:50,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-05 15:48:50,332 INFO L276 IsEmpty]: Start isEmpty. Operand 9129 states and 15559 transitions. [2025-02-05 15:48:50,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-02-05 15:48:50,355 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:48:50,355 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:48:50,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 15:48:50,355 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:48:50,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:48:50,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1373819619, now seen corresponding path program 1 times [2025-02-05 15:48:50,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:48:50,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384855403] [2025-02-05 15:48:50,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:50,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:48:50,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-02-05 15:48:50,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-02-05 15:48:50,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:50,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:50,413 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:48:50,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:48:50,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384855403] [2025-02-05 15:48:50,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384855403] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:48:50,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:48:50,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:48:50,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105773878] [2025-02-05 15:48:50,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:48:50,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:48:50,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:48:50,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:48:50,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:48:50,415 INFO L87 Difference]: Start difference. First operand 9129 states and 15559 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-05 15:48:50,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:48:50,756 INFO L93 Difference]: Finished difference Result 23520 states and 40265 transitions. [2025-02-05 15:48:50,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:48:50,756 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 126 [2025-02-05 15:48:50,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:48:50,833 INFO L225 Difference]: With dead ends: 23520 [2025-02-05 15:48:50,833 INFO L226 Difference]: Without dead ends: 15953 [2025-02-05 15:48:50,867 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:48:50,867 INFO L435 NwaCegarLoop]: 548 mSDtfsCounter, 93 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 1078 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:48:50,867 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 1078 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:48:50,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15953 states. [2025-02-05 15:48:51,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15953 to 15945. [2025-02-05 15:48:51,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15945 states, 13137 states have (on average 1.6149044682956535) internal successors, (21215), 13144 states have internal predecessors, (21215), 2780 states have call successors, (2780), 23 states have call predecessors, (2780), 27 states have return successors, (3119), 2779 states have call predecessors, (3119), 2779 states have call successors, (3119) [2025-02-05 15:48:51,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15945 states to 15945 states and 27114 transitions. [2025-02-05 15:48:51,585 INFO L78 Accepts]: Start accepts. Automaton has 15945 states and 27114 transitions. Word has length 126 [2025-02-05 15:48:51,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:48:51,586 INFO L471 AbstractCegarLoop]: Abstraction has 15945 states and 27114 transitions. [2025-02-05 15:48:51,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-05 15:48:51,586 INFO L276 IsEmpty]: Start isEmpty. Operand 15945 states and 27114 transitions. [2025-02-05 15:48:51,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-02-05 15:48:51,636 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:48:51,636 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:48:51,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 15:48:51,637 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:48:51,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:48:51,637 INFO L85 PathProgramCache]: Analyzing trace with hash -1409546312, now seen corresponding path program 1 times [2025-02-05 15:48:51,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:48:51,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140882556] [2025-02-05 15:48:51,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:51,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:48:51,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-02-05 15:48:51,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-02-05 15:48:51,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:51,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:51,735 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:48:51,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:48:51,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140882556] [2025-02-05 15:48:51,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140882556] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:48:51,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:48:51,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:48:51,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154024834] [2025-02-05 15:48:51,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:48:51,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:48:51,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:48:51,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:48:51,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:48:51,738 INFO L87 Difference]: Start difference. First operand 15945 states and 27114 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-05 15:48:52,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:48:52,534 INFO L93 Difference]: Finished difference Result 42091 states and 71929 transitions. [2025-02-05 15:48:52,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:48:52,535 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 127 [2025-02-05 15:48:52,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:48:52,685 INFO L225 Difference]: With dead ends: 42091 [2025-02-05 15:48:52,686 INFO L226 Difference]: Without dead ends: 28342 [2025-02-05 15:48:52,754 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:48:52,755 INFO L435 NwaCegarLoop]: 533 mSDtfsCounter, 91 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 1060 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:48:52,755 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 1060 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:48:52,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28342 states. [2025-02-05 15:48:53,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28342 to 28334. [2025-02-05 15:48:53,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28334 states, 23487 states have (on average 1.6116575126665815) internal successors, (37853), 23494 states have internal predecessors, (37853), 4819 states have call successors, (4819), 23 states have call predecessors, (4819), 27 states have return successors, (5432), 4818 states have call predecessors, (5432), 4818 states have call successors, (5432) [2025-02-05 15:48:54,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28334 states to 28334 states and 48104 transitions. [2025-02-05 15:48:54,065 INFO L78 Accepts]: Start accepts. Automaton has 28334 states and 48104 transitions. Word has length 127 [2025-02-05 15:48:54,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:48:54,065 INFO L471 AbstractCegarLoop]: Abstraction has 28334 states and 48104 transitions. [2025-02-05 15:48:54,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-05 15:48:54,065 INFO L276 IsEmpty]: Start isEmpty. Operand 28334 states and 48104 transitions. [2025-02-05 15:48:54,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-02-05 15:48:54,096 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:48:54,096 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:48:54,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 15:48:54,096 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:48:54,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:48:54,097 INFO L85 PathProgramCache]: Analyzing trace with hash 668400452, now seen corresponding path program 1 times [2025-02-05 15:48:54,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:48:54,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084804806] [2025-02-05 15:48:54,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:54,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:48:54,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-02-05 15:48:54,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-02-05 15:48:54,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:54,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:54,148 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:48:54,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:48:54,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084804806] [2025-02-05 15:48:54,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084804806] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:48:54,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:48:54,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:48:54,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999546114] [2025-02-05 15:48:54,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:48:54,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:48:54,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:48:54,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:48:54,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:48:54,149 INFO L87 Difference]: Start difference. First operand 28334 states and 48104 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-05 15:48:54,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:48:54,945 INFO L93 Difference]: Finished difference Result 77073 states and 131376 transitions. [2025-02-05 15:48:54,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:48:54,946 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 128 [2025-02-05 15:48:54,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:48:55,292 INFO L225 Difference]: With dead ends: 77073 [2025-02-05 15:48:55,292 INFO L226 Difference]: Without dead ends: 51698 [2025-02-05 15:48:55,354 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:48:55,355 INFO L435 NwaCegarLoop]: 535 mSDtfsCounter, 89 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 1062 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:48:55,356 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 1062 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:48:55,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51698 states. [2025-02-05 15:48:57,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51698 to 51690. [2025-02-05 15:48:57,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51690 states, 43128 states have (on average 1.6068215544425895) internal successors, (69299), 43135 states have internal predecessors, (69299), 8534 states have call successors, (8534), 23 states have call predecessors, (8534), 27 states have return successors, (9679), 8533 states have call predecessors, (9679), 8533 states have call successors, (9679) [2025-02-05 15:48:57,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51690 states to 51690 states and 87512 transitions. [2025-02-05 15:48:57,297 INFO L78 Accepts]: Start accepts. Automaton has 51690 states and 87512 transitions. Word has length 128 [2025-02-05 15:48:57,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:48:57,297 INFO L471 AbstractCegarLoop]: Abstraction has 51690 states and 87512 transitions. [2025-02-05 15:48:57,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-05 15:48:57,298 INFO L276 IsEmpty]: Start isEmpty. Operand 51690 states and 87512 transitions. [2025-02-05 15:48:57,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-02-05 15:48:57,331 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:48:57,331 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:48:57,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 15:48:57,332 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:48:57,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:48:57,333 INFO L85 PathProgramCache]: Analyzing trace with hash 305036599, now seen corresponding path program 1 times [2025-02-05 15:48:57,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:48:57,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55159134] [2025-02-05 15:48:57,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:57,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:48:57,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-02-05 15:48:57,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-02-05 15:48:57,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:57,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:57,391 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:48:57,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:48:57,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55159134] [2025-02-05 15:48:57,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55159134] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:48:57,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:48:57,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:48:57,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146398041] [2025-02-05 15:48:57,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:48:57,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:48:57,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:48:57,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:48:57,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:48:57,394 INFO L87 Difference]: Start difference. First operand 51690 states and 87512 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-05 15:48:59,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:48:59,196 INFO L93 Difference]: Finished difference Result 96334 states and 163484 transitions. [2025-02-05 15:48:59,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:48:59,196 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 129 [2025-02-05 15:48:59,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:48:59,602 INFO L225 Difference]: With dead ends: 96334 [2025-02-05 15:48:59,602 INFO L226 Difference]: Without dead ends: 96124 [2025-02-05 15:48:59,650 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:48:59,652 INFO L435 NwaCegarLoop]: 542 mSDtfsCounter, 84 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 1074 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:48:59,652 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 1074 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:48:59,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96124 states. [2025-02-05 15:49:02,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96124 to 96116. [2025-02-05 15:49:02,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96116 states, 80755 states have (on average 1.6003467277567953) internal successors, (129236), 80762 states have internal predecessors, (129236), 15333 states have call successors, (15333), 23 states have call predecessors, (15333), 27 states have return successors, (17524), 15332 states have call predecessors, (17524), 15332 states have call successors, (17524) [2025-02-05 15:49:02,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96116 states to 96116 states and 162093 transitions. [2025-02-05 15:49:02,658 INFO L78 Accepts]: Start accepts. Automaton has 96116 states and 162093 transitions. Word has length 129 [2025-02-05 15:49:02,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:49:02,658 INFO L471 AbstractCegarLoop]: Abstraction has 96116 states and 162093 transitions. [2025-02-05 15:49:02,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-05 15:49:02,659 INFO L276 IsEmpty]: Start isEmpty. Operand 96116 states and 162093 transitions. [2025-02-05 15:49:03,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-02-05 15:49:03,245 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:49:03,245 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:49:03,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 15:49:03,245 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:49:03,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:49:03,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1998238693, now seen corresponding path program 1 times [2025-02-05 15:49:03,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:49:03,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799849079] [2025-02-05 15:49:03,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:49:03,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:49:03,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-02-05 15:49:03,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-02-05 15:49:03,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:49:03,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:49:03,608 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:49:03,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:49:03,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799849079] [2025-02-05 15:49:03,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799849079] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:49:03,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:49:03,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-02-05 15:49:03,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174721131] [2025-02-05 15:49:03,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:49:03,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-05 15:49:03,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:49:03,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-05 15:49:03,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2025-02-05 15:49:03,610 INFO L87 Difference]: Start difference. First operand 96116 states and 162093 transitions. Second operand has 14 states, 12 states have (on average 7.416666666666667) internal successors, (89), 12 states have internal predecessors, (89), 6 states have call successors, (15), 3 states have call predecessors, (15), 4 states have return successors, (13), 6 states have call predecessors, (13), 6 states have call successors, (13) [2025-02-05 15:49:08,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:49:08,969 INFO L93 Difference]: Finished difference Result 191841 states and 328941 transitions. [2025-02-05 15:49:08,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-02-05 15:49:08,969 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.416666666666667) internal successors, (89), 12 states have internal predecessors, (89), 6 states have call successors, (15), 3 states have call predecessors, (15), 4 states have return successors, (13), 6 states have call predecessors, (13), 6 states have call successors, (13) Word has length 130 [2025-02-05 15:49:08,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:49:09,976 INFO L225 Difference]: With dead ends: 191841 [2025-02-05 15:49:09,976 INFO L226 Difference]: Without dead ends: 191637 [2025-02-05 15:49:10,072 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=159, Invalid=833, Unknown=0, NotChecked=0, Total=992 [2025-02-05 15:49:10,072 INFO L435 NwaCegarLoop]: 651 mSDtfsCounter, 1634 mSDsluCounter, 6849 mSDsCounter, 0 mSdLazyCounter, 1522 mSolverCounterSat, 528 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1634 SdHoareTripleChecker+Valid, 7500 SdHoareTripleChecker+Invalid, 2050 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 528 IncrementalHoareTripleChecker+Valid, 1522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-05 15:49:10,073 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1634 Valid, 7500 Invalid, 2050 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [528 Valid, 1522 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-05 15:49:10,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191637 states. [2025-02-05 15:49:16,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191637 to 191468. [2025-02-05 15:49:16,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191468 states, 160929 states have (on average 1.6011160201082464) internal successors, (257666), 160833 states have internal predecessors, (257666), 30469 states have call successors, (30469), 62 states have call predecessors, (30469), 69 states have return successors, (38125), 30578 states have call predecessors, (38125), 30466 states have call successors, (38125) [2025-02-05 15:49:17,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191468 states to 191468 states and 326260 transitions. [2025-02-05 15:49:17,343 INFO L78 Accepts]: Start accepts. Automaton has 191468 states and 326260 transitions. Word has length 130 [2025-02-05 15:49:17,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:49:17,344 INFO L471 AbstractCegarLoop]: Abstraction has 191468 states and 326260 transitions. [2025-02-05 15:49:17,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.416666666666667) internal successors, (89), 12 states have internal predecessors, (89), 6 states have call successors, (15), 3 states have call predecessors, (15), 4 states have return successors, (13), 6 states have call predecessors, (13), 6 states have call successors, (13) [2025-02-05 15:49:17,345 INFO L276 IsEmpty]: Start isEmpty. Operand 191468 states and 326260 transitions. [2025-02-05 15:49:17,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-02-05 15:49:17,419 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:49:17,420 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:49:17,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 15:49:17,420 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:49:17,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:49:17,420 INFO L85 PathProgramCache]: Analyzing trace with hash 962793296, now seen corresponding path program 1 times [2025-02-05 15:49:17,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:49:17,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925123502] [2025-02-05 15:49:17,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:49:17,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:49:17,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-02-05 15:49:17,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-02-05 15:49:17,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:49:17,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:49:17,491 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:49:17,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:49:17,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925123502] [2025-02-05 15:49:17,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925123502] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:49:17,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:49:17,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:49:17,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846867376] [2025-02-05 15:49:17,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:49:17,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:49:17,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:49:17,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:49:17,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:49:17,494 INFO L87 Difference]: Start difference. First operand 191468 states and 326260 transitions. Second operand has 5 states, 4 states have (on average 22.5) internal successors, (90), 5 states have internal predecessors, (90), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-02-05 15:49:21,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:49:21,062 INFO L93 Difference]: Finished difference Result 191877 states and 326826 transitions. [2025-02-05 15:49:21,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:49:21,063 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 22.5) internal successors, (90), 5 states have internal predecessors, (90), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 131 [2025-02-05 15:49:21,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:49:21,787 INFO L225 Difference]: With dead ends: 191877 [2025-02-05 15:49:21,787 INFO L226 Difference]: Without dead ends: 191411 [2025-02-05 15:49:21,872 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:49:21,874 INFO L435 NwaCegarLoop]: 529 mSDtfsCounter, 2 mSDsluCounter, 1576 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2105 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:49:21,874 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2105 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:49:22,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191411 states.