./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec6_product12.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/email_spec6_product12.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 6a023004d1923934c700fbd43377f50b99f9b3dcadd2a9eb1f89b20b18aa1436 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 05:34:44,843 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 05:34:44,896 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 05:34:44,900 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 05:34:44,900 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 05:34:44,917 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 05:34:44,918 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 05:34:44,918 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 05:34:44,920 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 05:34:44,920 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 05:34:44,920 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 05:34:44,920 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 05:34:44,920 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 05:34:44,920 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 05:34:44,920 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 05:34:44,920 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 05:34:44,920 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 05:34:44,920 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 05:34:44,921 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 05:34:44,921 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 05:34:44,921 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 05:34:44,921 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 05:34:44,921 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 05:34:44,921 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 05:34:44,921 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 05:34:44,921 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 05:34:44,921 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 05:34:44,921 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 05:34:44,921 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 05:34:44,921 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 05:34:44,921 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 05:34:44,921 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 05:34:44,921 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:34:44,921 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 05:34:44,921 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 05:34:44,922 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 05:34:44,922 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 05:34:44,922 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 05:34:44,922 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 05:34:44,922 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 05:34:44,922 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 05:34:44,922 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 05:34:44,922 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 05:34:44,922 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/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 -> 6a023004d1923934c700fbd43377f50b99f9b3dcadd2a9eb1f89b20b18aa1436 [2025-03-08 05:34:45,403 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 05:34:45,411 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 05:34:45,414 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 05:34:45,415 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 05:34:45,415 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 05:34:45,416 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec6_product12.cil.c [2025-03-08 05:34:46,634 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0d193b69/884bbab5807946bb8b1a8114c45895a5/FLAG700b02498 [2025-03-08 05:34:46,959 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 05:34:46,960 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec6_product12.cil.c [2025-03-08 05:34:46,973 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0d193b69/884bbab5807946bb8b1a8114c45895a5/FLAG700b02498 [2025-03-08 05:34:46,985 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0d193b69/884bbab5807946bb8b1a8114c45895a5 [2025-03-08 05:34:46,988 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 05:34:46,990 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 05:34:46,991 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 05:34:46,991 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 05:34:46,994 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 05:34:46,994 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:34:46" (1/1) ... [2025-03-08 05:34:46,995 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48535641 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:34:46, skipping insertion in model container [2025-03-08 05:34:46,995 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:34:46" (1/1) ... [2025-03-08 05:34:47,037 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 05:34:47,397 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec6_product12.cil.c[52000,52013] [2025-03-08 05:34:47,423 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:34:47,437 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 05:34:47,443 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [48] [2025-03-08 05:34:47,444 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [97] [2025-03-08 05:34:47,444 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [210] [2025-03-08 05:34:47,444 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [576] [2025-03-08 05:34:47,444 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [864] [2025-03-08 05:34:47,444 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [1937] [2025-03-08 05:34:47,444 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [2342] [2025-03-08 05:34:47,444 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [2351] [2025-03-08 05:34:47,444 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EncryptDecrypt_spec.i","") [2583] [2025-03-08 05:34:47,444 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [2629] [2025-03-08 05:34:47,444 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [2646] [2025-03-08 05:34:47,515 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec6_product12.cil.c[52000,52013] [2025-03-08 05:34:47,526 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:34:47,549 INFO L204 MainTranslator]: Completed translation [2025-03-08 05:34:47,550 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:34:47 WrapperNode [2025-03-08 05:34:47,550 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 05:34:47,551 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 05:34:47,551 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 05:34:47,551 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 05:34:47,556 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:34:47" (1/1) ... [2025-03-08 05:34:47,570 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:34:47" (1/1) ... [2025-03-08 05:34:47,593 INFO L138 Inliner]: procedures = 123, calls = 179, calls flagged for inlining = 49, calls inlined = 39, statements flattened = 808 [2025-03-08 05:34:47,594 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 05:34:47,594 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 05:34:47,594 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 05:34:47,594 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 05:34:47,601 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:34:47" (1/1) ... [2025-03-08 05:34:47,601 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:34:47" (1/1) ... [2025-03-08 05:34:47,605 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:34:47" (1/1) ... [2025-03-08 05:34:47,622 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-03-08 05:34:47,622 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:34:47" (1/1) ... [2025-03-08 05:34:47,622 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:34:47" (1/1) ... [2025-03-08 05:34:47,637 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:34:47" (1/1) ... [2025-03-08 05:34:47,639 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:34:47" (1/1) ... [2025-03-08 05:34:47,640 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:34:47" (1/1) ... [2025-03-08 05:34:47,642 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:34:47" (1/1) ... [2025-03-08 05:34:47,645 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 05:34:47,649 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 05:34:47,649 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 05:34:47,649 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 05:34:47,650 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:34:47" (1/1) ... [2025-03-08 05:34:47,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:34:47,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:34:47,678 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 05:34:47,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 05:34:47,700 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2025-03-08 05:34:47,700 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2025-03-08 05:34:47,700 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2025-03-08 05:34:47,700 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2025-03-08 05:34:47,700 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2025-03-08 05:34:47,700 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2025-03-08 05:34:47,700 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-03-08 05:34:47,700 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-03-08 05:34:47,701 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-03-08 05:34:47,701 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-03-08 05:34:47,701 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-03-08 05:34:47,701 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-03-08 05:34:47,701 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2025-03-08 05:34:47,701 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2025-03-08 05:34:47,701 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-03-08 05:34:47,701 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-03-08 05:34:47,701 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-03-08 05:34:47,701 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-03-08 05:34:47,701 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 05:34:47,701 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2025-03-08 05:34:47,701 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2025-03-08 05:34:47,701 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-03-08 05:34:47,701 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-03-08 05:34:47,701 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-03-08 05:34:47,701 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-03-08 05:34:47,701 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-03-08 05:34:47,701 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-03-08 05:34:47,701 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-03-08 05:34:47,701 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-03-08 05:34:47,701 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2025-03-08 05:34:47,701 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2025-03-08 05:34:47,701 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-03-08 05:34:47,703 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-03-08 05:34:47,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 05:34:47,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 05:34:47,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 05:34:47,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 05:34:47,703 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-03-08 05:34:47,703 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-03-08 05:34:47,703 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 05:34:47,703 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 05:34:47,857 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 05:34:47,859 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 05:34:48,029 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1914-1: getClientId_#res#1 := getClientId_~retValue_acc~26#1; [2025-03-08 05:34:48,030 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1795-1: findPublicKey_#res#1 := findPublicKey_~retValue_acc~24#1; [2025-03-08 05:34:48,055 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2570: #res := ~retValue_acc~42; [2025-03-08 05:34:48,065 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2060: #res := ~retValue_acc~30; [2025-03-08 05:34:48,095 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1526-1: getClientKeyringSize_#res#1 := getClientKeyringSize_~retValue_acc~20#1; [2025-03-08 05:34:48,096 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1571: #res#1 := ~retValue_acc~21#1; [2025-03-08 05:34:48,103 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1479: #res := ~retValue_acc~19; [2025-03-08 05:34:48,132 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L207-1: createEmail_#res#1 := createEmail_~retValue_acc~5#1; [2025-03-08 05:34:48,169 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2175: #res := ~retValue_acc~33; [2025-03-08 05:34:48,373 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L94-1: valid_product_#res#1 := valid_product_~retValue_acc~1#1; [2025-03-08 05:34:48,373 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1741-1: getClientKeyringPublicKey_#res#1 := getClientKeyringPublicKey_~retValue_acc~23#1; [2025-03-08 05:34:48,373 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1634-1: getClientKeyringUser_#res#1 := getClientKeyringUser_~retValue_acc~22#1; [2025-03-08 05:34:48,373 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2527-1: is_queue_empty_#res#1 := is_queue_empty_~retValue_acc~39#1; [2025-03-08 05:34:48,373 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2536-1: get_queued_client_#res#1 := get_queued_client_~retValue_acc~40#1; [2025-03-08 05:34:48,374 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2545-1: get_queued_email_#res#1 := get_queued_email_~retValue_acc~41#1; [2025-03-08 05:34:48,395 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2212: #res := ~retValue_acc~34; [2025-03-08 05:34:48,479 INFO L? ?]: Removed 334 outVars from TransFormulas that were not future-live. [2025-03-08 05:34:48,479 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 05:34:48,497 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 05:34:48,497 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 05:34:48,498 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:34:48 BoogieIcfgContainer [2025-03-08 05:34:48,498 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 05:34:48,500 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 05:34:48,500 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 05:34:48,503 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 05:34:48,504 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:34:46" (1/3) ... [2025-03-08 05:34:48,504 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4048887b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:34:48, skipping insertion in model container [2025-03-08 05:34:48,504 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:34:47" (2/3) ... [2025-03-08 05:34:48,504 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4048887b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:34:48, skipping insertion in model container [2025-03-08 05:34:48,504 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:34:48" (3/3) ... [2025-03-08 05:34:48,505 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec6_product12.cil.c [2025-03-08 05:34:48,515 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 05:34:48,518 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec6_product12.cil.c that has 18 procedures, 272 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 05:34:48,573 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 05:34:48,580 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;@700e29bb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 05:34:48,580 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 05:34:48,584 INFO L276 IsEmpty]: Start isEmpty. Operand has 272 states, 210 states have (on average 1.5380952380952382) internal successors, (323), 214 states have internal predecessors, (323), 43 states have call successors, (43), 17 states have call predecessors, (43), 17 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2025-03-08 05:34:48,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-08 05:34:48,594 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:34:48,594 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:34:48,595 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:34:48,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:34:48,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1983209000, now seen corresponding path program 1 times [2025-03-08 05:34:48,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:34:48,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621615022] [2025-03-08 05:34:48,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:34:48,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:34:48,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-08 05:34:48,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-08 05:34:48,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:34:48,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:34:49,197 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-08 05:34:49,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:34:49,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621615022] [2025-03-08 05:34:49,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621615022] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:34:49,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1041429155] [2025-03-08 05:34:49,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:34:49,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:34:49,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:34:49,202 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:34:49,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 05:34:49,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-08 05:34:49,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-08 05:34:49,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:34:49,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:34:49,474 INFO L256 TraceCheckSpWp]: Trace formula consists of 987 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 05:34:49,482 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:34:49,520 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-08 05:34:49,521 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:34:49,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1041429155] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:34:49,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:34:49,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-08 05:34:49,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458248574] [2025-03-08 05:34:49,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:34:49,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:34:49,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:34:49,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:34:49,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:34:49,549 INFO L87 Difference]: Start difference. First operand has 272 states, 210 states have (on average 1.5380952380952382) internal successors, (323), 214 states have internal predecessors, (323), 43 states have call successors, (43), 17 states have call predecessors, (43), 17 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:34:49,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:34:49,597 INFO L93 Difference]: Finished difference Result 398 states and 586 transitions. [2025-03-08 05:34:49,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:34:49,600 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 111 [2025-03-08 05:34:49,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:34:49,608 INFO L225 Difference]: With dead ends: 398 [2025-03-08 05:34:49,608 INFO L226 Difference]: Without dead ends: 266 [2025-03-08 05:34:49,611 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 111 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-03-08 05:34:49,613 INFO L435 NwaCegarLoop]: 405 mSDtfsCounter, 0 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 807 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-03-08 05:34:49,615 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 807 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:34:49,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2025-03-08 05:34:49,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2025-03-08 05:34:49,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 205 states have (on average 1.5317073170731708) internal successors, (314), 208 states have internal predecessors, (314), 43 states have call successors, (43), 17 states have call predecessors, (43), 17 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-08 05:34:49,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 399 transitions. [2025-03-08 05:34:49,675 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 399 transitions. Word has length 111 [2025-03-08 05:34:49,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:34:49,675 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 399 transitions. [2025-03-08 05:34:49,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:34:49,676 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 399 transitions. [2025-03-08 05:34:49,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-08 05:34:49,685 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:34:49,686 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:34:49,695 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 05:34:49,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 05:34:49,887 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:34:49,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:34:49,889 INFO L85 PathProgramCache]: Analyzing trace with hash -772481504, now seen corresponding path program 1 times [2025-03-08 05:34:49,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:34:49,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253268983] [2025-03-08 05:34:49,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:34:49,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:34:49,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-08 05:34:49,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-08 05:34:49,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:34:49,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:34:50,136 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-08 05:34:50,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:34:50,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253268983] [2025-03-08 05:34:50,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253268983] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:34:50,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1453867503] [2025-03-08 05:34:50,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:34:50,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:34:50,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:34:50,141 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:34:50,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 05:34:50,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-08 05:34:50,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-08 05:34:50,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:34:50,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:34:50,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 998 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 05:34:50,396 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:34:50,412 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-08 05:34:50,412 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:34:50,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1453867503] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:34:50,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:34:50,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-08 05:34:50,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785437101] [2025-03-08 05:34:50,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:34:50,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:34:50,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:34:50,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:34:50,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:34:50,415 INFO L87 Difference]: Start difference. First operand 266 states and 399 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:34:50,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:34:50,447 INFO L93 Difference]: Finished difference Result 556 states and 848 transitions. [2025-03-08 05:34:50,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:34:50,447 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 115 [2025-03-08 05:34:50,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:34:50,451 INFO L225 Difference]: With dead ends: 556 [2025-03-08 05:34:50,452 INFO L226 Difference]: Without dead ends: 316 [2025-03-08 05:34:50,454 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 115 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-03-08 05:34:50,454 INFO L435 NwaCegarLoop]: 412 mSDtfsCounter, 99 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 763 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-03-08 05:34:50,454 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 763 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:34:50,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2025-03-08 05:34:50,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 308. [2025-03-08 05:34:50,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 236 states have (on average 1.5508474576271187) internal successors, (366), 239 states have internal predecessors, (366), 54 states have call successors, (54), 17 states have call predecessors, (54), 17 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2025-03-08 05:34:50,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 473 transitions. [2025-03-08 05:34:50,475 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 473 transitions. Word has length 115 [2025-03-08 05:34:50,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:34:50,475 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 473 transitions. [2025-03-08 05:34:50,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:34:50,475 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 473 transitions. [2025-03-08 05:34:50,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-08 05:34:50,480 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:34:50,480 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:34:50,488 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 05:34:50,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-08 05:34:50,683 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:34:50,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:34:50,684 INFO L85 PathProgramCache]: Analyzing trace with hash -522553466, now seen corresponding path program 1 times [2025-03-08 05:34:50,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:34:50,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107653641] [2025-03-08 05:34:50,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:34:50,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:34:50,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-08 05:34:50,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-08 05:34:50,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:34:50,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:34:50,882 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-08 05:34:50,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:34:50,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107653641] [2025-03-08 05:34:50,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107653641] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:34:50,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1557992857] [2025-03-08 05:34:50,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:34:50,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:34:50,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:34:50,887 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:34:50,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 05:34:51,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-08 05:34:51,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-08 05:34:51,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:34:51,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:34:51,126 INFO L256 TraceCheckSpWp]: Trace formula consists of 1003 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 05:34:51,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:34:51,192 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-08 05:34:51,193 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:34:51,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1557992857] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:34:51,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:34:51,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-03-08 05:34:51,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947082623] [2025-03-08 05:34:51,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:34:51,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:34:51,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:34:51,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:34:51,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:34:51,196 INFO L87 Difference]: Start difference. First operand 308 states and 473 transitions. Second operand has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 05:34:51,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:34:51,253 INFO L93 Difference]: Finished difference Result 607 states and 936 transitions. [2025-03-08 05:34:51,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:34:51,254 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) Word has length 116 [2025-03-08 05:34:51,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:34:51,256 INFO L225 Difference]: With dead ends: 607 [2025-03-08 05:34:51,257 INFO L226 Difference]: Without dead ends: 310 [2025-03-08 05:34:51,258 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 114 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-03-08 05:34:51,260 INFO L435 NwaCegarLoop]: 390 mSDtfsCounter, 2 mSDsluCounter, 1159 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1549 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-03-08 05:34:51,260 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1549 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:34:51,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2025-03-08 05:34:51,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 310. [2025-03-08 05:34:51,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 237 states have (on average 1.5485232067510548) internal successors, (367), 241 states have internal predecessors, (367), 54 states have call successors, (54), 17 states have call predecessors, (54), 18 states have return successors, (55), 53 states have call predecessors, (55), 53 states have call successors, (55) [2025-03-08 05:34:51,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 476 transitions. [2025-03-08 05:34:51,287 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 476 transitions. Word has length 116 [2025-03-08 05:34:51,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:34:51,287 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 476 transitions. [2025-03-08 05:34:51,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 05:34:51,287 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 476 transitions. [2025-03-08 05:34:51,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-08 05:34:51,292 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:34:51,292 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:34:51,299 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 05:34:51,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:34:51,493 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:34:51,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:34:51,493 INFO L85 PathProgramCache]: Analyzing trace with hash -624045408, now seen corresponding path program 1 times [2025-03-08 05:34:51,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:34:51,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307767444] [2025-03-08 05:34:51,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:34:51,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:34:51,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-08 05:34:51,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-08 05:34:51,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:34:51,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:34:51,658 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-08 05:34:51,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:34:51,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307767444] [2025-03-08 05:34:51,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307767444] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:34:51,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1843349453] [2025-03-08 05:34:51,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:34:51,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:34:51,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:34:51,662 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:34:51,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 05:34:51,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-08 05:34:51,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-08 05:34:51,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:34:51,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:34:51,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 1004 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 05:34:51,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:34:51,923 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-08 05:34:51,923 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:34:51,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1843349453] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:34:51,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:34:51,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-03-08 05:34:51,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056891629] [2025-03-08 05:34:51,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:34:51,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:34:51,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:34:51,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:34:51,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-08 05:34:51,924 INFO L87 Difference]: Start difference. First operand 310 states and 476 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 05:34:51,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:34:51,990 INFO L93 Difference]: Finished difference Result 609 states and 941 transitions. [2025-03-08 05:34:51,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:34:51,991 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 117 [2025-03-08 05:34:51,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:34:51,993 INFO L225 Difference]: With dead ends: 609 [2025-03-08 05:34:51,994 INFO L226 Difference]: Without dead ends: 312 [2025-03-08 05:34:51,995 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 115 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-03-08 05:34:51,996 INFO L435 NwaCegarLoop]: 388 mSDtfsCounter, 2 mSDsluCounter, 1147 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1535 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-03-08 05:34:51,997 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1535 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:34:51,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2025-03-08 05:34:52,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 312. [2025-03-08 05:34:52,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 238 states have (on average 1.546218487394958) internal successors, (368), 243 states have internal predecessors, (368), 54 states have call successors, (54), 17 states have call predecessors, (54), 19 states have return successors, (60), 53 states have call predecessors, (60), 53 states have call successors, (60) [2025-03-08 05:34:52,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 482 transitions. [2025-03-08 05:34:52,012 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 482 transitions. Word has length 117 [2025-03-08 05:34:52,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:34:52,013 INFO L471 AbstractCegarLoop]: Abstraction has 312 states and 482 transitions. [2025-03-08 05:34:52,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 05:34:52,014 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 482 transitions. [2025-03-08 05:34:52,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-08 05:34:52,015 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:34:52,016 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, 1, 1, 1, 1, 1, 1] [2025-03-08 05:34:52,023 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 05:34:52,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:34:52,216 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:34:52,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:34:52,217 INFO L85 PathProgramCache]: Analyzing trace with hash -338857848, now seen corresponding path program 1 times [2025-03-08 05:34:52,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:34:52,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520316609] [2025-03-08 05:34:52,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:34:52,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:34:52,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-08 05:34:52,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-08 05:34:52,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:34:52,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:34:52,355 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-08 05:34:52,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:34:52,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520316609] [2025-03-08 05:34:52,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520316609] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:34:52,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:34:52,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:34:52,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389764280] [2025-03-08 05:34:52,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:34:52,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:34:52,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:34:52,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:34:52,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:34:52,358 INFO L87 Difference]: Start difference. First operand 312 states and 482 transitions. Second operand has 5 states, 4 states have (on average 18.75) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 05:34:52,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:34:52,402 INFO L93 Difference]: Finished difference Result 601 states and 932 transitions. [2025-03-08 05:34:52,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:34:52,403 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 18.75) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) Word has length 118 [2025-03-08 05:34:52,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:34:52,407 INFO L225 Difference]: With dead ends: 601 [2025-03-08 05:34:52,407 INFO L226 Difference]: Without dead ends: 312 [2025-03-08 05:34:52,409 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-03-08 05:34:52,409 INFO L435 NwaCegarLoop]: 391 mSDtfsCounter, 2 mSDsluCounter, 1162 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1553 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-03-08 05:34:52,410 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1553 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:34:52,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2025-03-08 05:34:52,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 312. [2025-03-08 05:34:52,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 238 states have (on average 1.546218487394958) internal successors, (368), 243 states have internal predecessors, (368), 54 states have call successors, (54), 17 states have call predecessors, (54), 19 states have return successors, (59), 53 states have call predecessors, (59), 53 states have call successors, (59) [2025-03-08 05:34:52,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 481 transitions. [2025-03-08 05:34:52,425 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 481 transitions. Word has length 118 [2025-03-08 05:34:52,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:34:52,425 INFO L471 AbstractCegarLoop]: Abstraction has 312 states and 481 transitions. [2025-03-08 05:34:52,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 18.75) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 05:34:52,426 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 481 transitions. [2025-03-08 05:34:52,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-08 05:34:52,430 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:34:52,430 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:34:52,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 05:34:52,431 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:34:52,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:34:52,431 INFO L85 PathProgramCache]: Analyzing trace with hash 728697472, now seen corresponding path program 2 times [2025-03-08 05:34:52,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:34:52,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440628112] [2025-03-08 05:34:52,432 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:34:52,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:34:52,450 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 119 statements into 2 equivalence classes. [2025-03-08 05:34:52,482 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 119 of 119 statements. [2025-03-08 05:34:52,482 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 05:34:52,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:34:52,578 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-08 05:34:52,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:34:52,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440628112] [2025-03-08 05:34:52,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440628112] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:34:52,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:34:52,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:34:52,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600048049] [2025-03-08 05:34:52,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:34:52,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:34:52,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:34:52,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:34:52,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:34:52,581 INFO L87 Difference]: Start difference. First operand 312 states and 481 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, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 05:34:52,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:34:52,627 INFO L93 Difference]: Finished difference Result 599 states and 927 transitions. [2025-03-08 05:34:52,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:34:52,628 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, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 119 [2025-03-08 05:34:52,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:34:52,631 INFO L225 Difference]: With dead ends: 599 [2025-03-08 05:34:52,631 INFO L226 Difference]: Without dead ends: 312 [2025-03-08 05:34:52,632 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-03-08 05:34:52,633 INFO L435 NwaCegarLoop]: 389 mSDtfsCounter, 2 mSDsluCounter, 1150 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1539 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-03-08 05:34:52,633 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1539 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:34:52,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2025-03-08 05:34:52,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 312. [2025-03-08 05:34:52,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 238 states have (on average 1.546218487394958) internal successors, (368), 243 states have internal predecessors, (368), 54 states have call successors, (54), 17 states have call predecessors, (54), 19 states have return successors, (58), 53 states have call predecessors, (58), 53 states have call successors, (58) [2025-03-08 05:34:52,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 480 transitions. [2025-03-08 05:34:52,647 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 480 transitions. Word has length 119 [2025-03-08 05:34:52,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:34:52,647 INFO L471 AbstractCegarLoop]: Abstraction has 312 states and 480 transitions. [2025-03-08 05:34:52,647 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, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 05:34:52,647 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 480 transitions. [2025-03-08 05:34:52,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-08 05:34:52,650 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:34:52,650 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:34:52,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 05:34:52,650 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:34:52,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:34:52,651 INFO L85 PathProgramCache]: Analyzing trace with hash -496541562, now seen corresponding path program 3 times [2025-03-08 05:34:52,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:34:52,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409437847] [2025-03-08 05:34:52,651 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 05:34:52,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:34:52,669 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 120 statements into 3 equivalence classes. [2025-03-08 05:34:52,678 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 108 of 120 statements. [2025-03-08 05:34:52,678 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-08 05:34:52,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:34:52,805 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-08 05:34:52,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:34:52,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409437847] [2025-03-08 05:34:52,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409437847] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:34:52,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:34:52,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:34:52,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849027797] [2025-03-08 05:34:52,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:34:52,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:34:52,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:34:52,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:34:52,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:34:52,807 INFO L87 Difference]: Start difference. First operand 312 states and 480 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 4 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 05:34:53,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:34:53,050 INFO L93 Difference]: Finished difference Result 707 states and 1026 transitions. [2025-03-08 05:34:53,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 05:34:53,051 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 4 states have call predecessors, (14), 3 states have call successors, (14) Word has length 120 [2025-03-08 05:34:53,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:34:53,054 INFO L225 Difference]: With dead ends: 707 [2025-03-08 05:34:53,054 INFO L226 Difference]: Without dead ends: 597 [2025-03-08 05:34:53,055 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-03-08 05:34:53,057 INFO L435 NwaCegarLoop]: 575 mSDtfsCounter, 556 mSDsluCounter, 1691 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 559 SdHoareTripleChecker+Valid, 2266 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 05:34:53,057 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [559 Valid, 2266 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 05:34:53,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2025-03-08 05:34:53,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 589. [2025-03-08 05:34:53,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 450 states have (on average 1.491111111111111) internal successors, (671), 462 states have internal predecessors, (671), 90 states have call successors, (90), 41 states have call predecessors, (90), 48 states have return successors, (104), 92 states have call predecessors, (104), 86 states have call successors, (104) [2025-03-08 05:34:53,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 865 transitions. [2025-03-08 05:34:53,092 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 865 transitions. Word has length 120 [2025-03-08 05:34:53,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:34:53,093 INFO L471 AbstractCegarLoop]: Abstraction has 589 states and 865 transitions. [2025-03-08 05:34:53,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 4 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 05:34:53,093 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 865 transitions. [2025-03-08 05:34:53,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-08 05:34:53,095 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:34:53,096 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:34:53,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 05:34:53,096 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:34:53,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:34:53,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1464257971, now seen corresponding path program 1 times [2025-03-08 05:34:53,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:34:53,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076374698] [2025-03-08 05:34:53,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:34:53,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:34:53,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-08 05:34:53,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-08 05:34:53,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:34:53,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:34:53,226 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-08 05:34:53,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:34:53,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076374698] [2025-03-08 05:34:53,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076374698] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:34:53,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:34:53,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:34:53,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948230282] [2025-03-08 05:34:53,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:34:53,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:34:53,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:34:53,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:34:53,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:34:53,228 INFO L87 Difference]: Start difference. First operand 589 states and 865 transitions. Second operand has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 05:34:53,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:34:53,275 INFO L93 Difference]: Finished difference Result 1157 states and 1703 transitions. [2025-03-08 05:34:53,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:34:53,276 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) Word has length 121 [2025-03-08 05:34:53,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:34:53,280 INFO L225 Difference]: With dead ends: 1157 [2025-03-08 05:34:53,280 INFO L226 Difference]: Without dead ends: 591 [2025-03-08 05:34:53,282 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-03-08 05:34:53,282 INFO L435 NwaCegarLoop]: 392 mSDtfsCounter, 1 mSDsluCounter, 1164 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1556 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-03-08 05:34:53,282 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1556 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:34:53,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2025-03-08 05:34:53,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 591. [2025-03-08 05:34:53,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 451 states have (on average 1.4900221729490022) internal successors, (672), 464 states have internal predecessors, (672), 90 states have call successors, (90), 41 states have call predecessors, (90), 49 states have return successors, (106), 92 states have call predecessors, (106), 86 states have call successors, (106) [2025-03-08 05:34:53,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 868 transitions. [2025-03-08 05:34:53,309 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 868 transitions. Word has length 121 [2025-03-08 05:34:53,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:34:53,309 INFO L471 AbstractCegarLoop]: Abstraction has 591 states and 868 transitions. [2025-03-08 05:34:53,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 05:34:53,310 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 868 transitions. [2025-03-08 05:34:53,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-08 05:34:53,311 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:34:53,312 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:34:53,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 05:34:53,312 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:34:53,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:34:53,312 INFO L85 PathProgramCache]: Analyzing trace with hash -402074254, now seen corresponding path program 1 times [2025-03-08 05:34:53,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:34:53,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481067842] [2025-03-08 05:34:53,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:34:53,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:34:53,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-08 05:34:53,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-08 05:34:53,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:34:53,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:34:53,439 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-08 05:34:53,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:34:53,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481067842] [2025-03-08 05:34:53,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481067842] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:34:53,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:34:53,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 05:34:53,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148468950] [2025-03-08 05:34:53,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:34:53,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 05:34:53,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:34:53,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 05:34:53,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:34:53,441 INFO L87 Difference]: Start difference. First operand 591 states and 868 transitions. Second operand has 8 states, 7 states have (on average 11.714285714285714) internal successors, (82), 8 states have internal predecessors, (82), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-03-08 05:34:53,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:34:53,559 INFO L93 Difference]: Finished difference Result 1162 states and 1712 transitions. [2025-03-08 05:34:53,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 05:34:53,560 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 11.714285714285714) internal successors, (82), 8 states have internal predecessors, (82), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) Word has length 122 [2025-03-08 05:34:53,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:34:53,564 INFO L225 Difference]: With dead ends: 1162 [2025-03-08 05:34:53,564 INFO L226 Difference]: Without dead ends: 596 [2025-03-08 05:34:53,566 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-08 05:34:53,566 INFO L435 NwaCegarLoop]: 384 mSDtfsCounter, 5 mSDsluCounter, 2275 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 2659 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:34:53,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 2659 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:34:53,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2025-03-08 05:34:53,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 596. [2025-03-08 05:34:53,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 455 states have (on average 1.487912087912088) internal successors, (677), 468 states have internal predecessors, (677), 90 states have call successors, (90), 42 states have call predecessors, (90), 50 states have return successors, (111), 92 states have call predecessors, (111), 86 states have call successors, (111) [2025-03-08 05:34:53,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 878 transitions. [2025-03-08 05:34:53,589 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 878 transitions. Word has length 122 [2025-03-08 05:34:53,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:34:53,589 INFO L471 AbstractCegarLoop]: Abstraction has 596 states and 878 transitions. [2025-03-08 05:34:53,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 11.714285714285714) internal successors, (82), 8 states have internal predecessors, (82), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-03-08 05:34:53,590 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 878 transitions. [2025-03-08 05:34:53,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-08 05:34:53,591 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:34:53,591 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:34:53,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 05:34:53,591 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:34:53,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:34:53,592 INFO L85 PathProgramCache]: Analyzing trace with hash 2027615953, now seen corresponding path program 1 times [2025-03-08 05:34:53,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:34:53,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637558026] [2025-03-08 05:34:53,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:34:53,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:34:53,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-08 05:34:53,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-08 05:34:53,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:34:53,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:34:53,708 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-08 05:34:53,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:34:53,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637558026] [2025-03-08 05:34:53,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637558026] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:34:53,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [148311169] [2025-03-08 05:34:53,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:34:53,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:34:53,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:34:53,711 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:34:53,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 05:34:53,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-08 05:34:53,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-08 05:34:53,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:34:53,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:34:53,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 1010 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 05:34:53,933 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:34:53,948 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-08 05:34:53,948 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:34:54,036 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-08 05:34:54,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [148311169] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:34:54,036 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:34:54,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-08 05:34:54,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749060167] [2025-03-08 05:34:54,036 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:34:54,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:34:54,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:34:54,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:34:54,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:34:54,038 INFO L87 Difference]: Start difference. First operand 596 states and 878 transitions. Second operand has 7 states, 7 states have (on average 15.0) internal successors, (105), 7 states have internal predecessors, (105), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-08 05:34:54,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:34:54,178 INFO L93 Difference]: Finished difference Result 1362 states and 2047 transitions. [2025-03-08 05:34:54,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:34:54,179 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.0) internal successors, (105), 7 states have internal predecessors, (105), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 123 [2025-03-08 05:34:54,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:34:54,186 INFO L225 Difference]: With dead ends: 1362 [2025-03-08 05:34:54,186 INFO L226 Difference]: Without dead ends: 966 [2025-03-08 05:34:54,188 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 243 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-03-08 05:34:54,188 INFO L435 NwaCegarLoop]: 431 mSDtfsCounter, 471 mSDsluCounter, 1116 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 516 SdHoareTripleChecker+Valid, 1547 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:34:54,189 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [516 Valid, 1547 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:34:54,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966 states. [2025-03-08 05:34:54,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966 to 888. [2025-03-08 05:34:54,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 888 states, 683 states have (on average 1.5578330893118595) internal successors, (1064), 696 states have internal predecessors, (1064), 154 states have call successors, (154), 42 states have call predecessors, (154), 50 states have return successors, (185), 156 states have call predecessors, (185), 150 states have call successors, (185) [2025-03-08 05:34:54,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 1403 transitions. [2025-03-08 05:34:54,230 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 1403 transitions. Word has length 123 [2025-03-08 05:34:54,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:34:54,230 INFO L471 AbstractCegarLoop]: Abstraction has 888 states and 1403 transitions. [2025-03-08 05:34:54,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.0) internal successors, (105), 7 states have internal predecessors, (105), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-08 05:34:54,230 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1403 transitions. [2025-03-08 05:34:54,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-08 05:34:54,234 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:34:54,234 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:34:54,241 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-08 05:34:54,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-08 05:34:54,434 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:34:54,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:34:54,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1042452190, now seen corresponding path program 1 times [2025-03-08 05:34:54,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:34:54,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031225955] [2025-03-08 05:34:54,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:34:54,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:34:54,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-08 05:34:54,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-08 05:34:54,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:34:54,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:34:54,488 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-08 05:34:54,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:34:54,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031225955] [2025-03-08 05:34:54,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031225955] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:34:54,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:34:54,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:34:54,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918304397] [2025-03-08 05:34:54,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:34:54,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:34:54,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:34:54,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:34:54,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:34:54,490 INFO L87 Difference]: Start difference. First operand 888 states and 1403 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, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:34:54,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:34:54,531 INFO L93 Difference]: Finished difference Result 2023 states and 3247 transitions. [2025-03-08 05:34:54,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:34:54,531 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, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 130 [2025-03-08 05:34:54,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:34:54,537 INFO L225 Difference]: With dead ends: 2023 [2025-03-08 05:34:54,537 INFO L226 Difference]: Without dead ends: 1202 [2025-03-08 05:34:54,540 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-03-08 05:34:54,541 INFO L435 NwaCegarLoop]: 407 mSDtfsCounter, 97 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 801 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-03-08 05:34:54,541 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 801 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:34:54,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2025-03-08 05:34:54,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 1176. [2025-03-08 05:34:54,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1176 states, 907 states have (on average 1.5843439911797133) internal successors, (1437), 920 states have internal predecessors, (1437), 218 states have call successors, (218), 42 states have call predecessors, (218), 50 states have return successors, (259), 220 states have call predecessors, (259), 214 states have call successors, (259) [2025-03-08 05:34:54,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1176 states to 1176 states and 1914 transitions. [2025-03-08 05:34:54,610 INFO L78 Accepts]: Start accepts. Automaton has 1176 states and 1914 transitions. Word has length 130 [2025-03-08 05:34:54,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:34:54,610 INFO L471 AbstractCegarLoop]: Abstraction has 1176 states and 1914 transitions. [2025-03-08 05:34:54,610 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, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:34:54,610 INFO L276 IsEmpty]: Start isEmpty. Operand 1176 states and 1914 transitions. [2025-03-08 05:34:54,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-08 05:34:54,615 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:34:54,615 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:34:54,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 05:34:54,615 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:34:54,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:34:54,616 INFO L85 PathProgramCache]: Analyzing trace with hash -2136980731, now seen corresponding path program 1 times [2025-03-08 05:34:54,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:34:54,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968458495] [2025-03-08 05:34:54,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:34:54,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:34:54,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 05:34:54,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 05:34:54,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:34:54,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:34:54,669 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-08 05:34:54,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:34:54,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968458495] [2025-03-08 05:34:54,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968458495] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:34:54,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:34:54,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:34:54,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816916523] [2025-03-08 05:34:54,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:34:54,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:34:54,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:34:54,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:34:54,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:34:54,671 INFO L87 Difference]: Start difference. First operand 1176 states and 1914 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, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:34:54,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:34:54,733 INFO L93 Difference]: Finished difference Result 2710 states and 4448 transitions. [2025-03-08 05:34:54,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:34:54,734 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, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 131 [2025-03-08 05:34:54,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:34:54,743 INFO L225 Difference]: With dead ends: 2710 [2025-03-08 05:34:54,743 INFO L226 Difference]: Without dead ends: 1650 [2025-03-08 05:34:54,747 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-03-08 05:34:54,748 INFO L435 NwaCegarLoop]: 397 mSDtfsCounter, 95 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 788 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-03-08 05:34:54,748 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 788 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:34:54,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1650 states. [2025-03-08 05:34:54,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1650 to 1624. [2025-03-08 05:34:54,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1624 states, 1260 states have (on average 1.6063492063492064) internal successors, (2024), 1273 states have internal predecessors, (2024), 313 states have call successors, (313), 42 states have call predecessors, (313), 50 states have return successors, (354), 315 states have call predecessors, (354), 309 states have call successors, (354) [2025-03-08 05:34:54,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1624 states to 1624 states and 2691 transitions. [2025-03-08 05:34:54,827 INFO L78 Accepts]: Start accepts. Automaton has 1624 states and 2691 transitions. Word has length 131 [2025-03-08 05:34:54,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:34:54,827 INFO L471 AbstractCegarLoop]: Abstraction has 1624 states and 2691 transitions. [2025-03-08 05:34:54,827 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, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:34:54,827 INFO L276 IsEmpty]: Start isEmpty. Operand 1624 states and 2691 transitions. [2025-03-08 05:34:54,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-08 05:34:54,835 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:34:54,835 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:34:54,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 05:34:54,836 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:34:54,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:34:54,836 INFO L85 PathProgramCache]: Analyzing trace with hash 827571713, now seen corresponding path program 1 times [2025-03-08 05:34:54,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:34:54,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651518282] [2025-03-08 05:34:54,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:34:54,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:34:54,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 05:34:54,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 05:34:54,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:34:54,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:34:54,894 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-08 05:34:54,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:34:54,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651518282] [2025-03-08 05:34:54,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651518282] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:34:54,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:34:54,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:34:54,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754577581] [2025-03-08 05:34:54,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:34:54,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:34:54,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:34:54,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:34:54,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:34:54,897 INFO L87 Difference]: Start difference. First operand 1624 states and 2691 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, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:34:54,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:34:54,980 INFO L93 Difference]: Finished difference Result 3711 states and 6209 transitions. [2025-03-08 05:34:54,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:34:54,980 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, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 132 [2025-03-08 05:34:54,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:34:54,994 INFO L225 Difference]: With dead ends: 3711 [2025-03-08 05:34:54,995 INFO L226 Difference]: Without dead ends: 2321 [2025-03-08 05:34:55,001 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-03-08 05:34:55,002 INFO L435 NwaCegarLoop]: 397 mSDtfsCounter, 93 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 785 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-03-08 05:34:55,003 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 785 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:34:55,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2321 states. [2025-03-08 05:34:55,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2321 to 2295. [2025-03-08 05:34:55,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2295 states, 1808 states have (on average 1.625) internal successors, (2938), 1821 states have internal predecessors, (2938), 436 states have call successors, (436), 42 states have call predecessors, (436), 50 states have return successors, (493), 438 states have call predecessors, (493), 432 states have call successors, (493) [2025-03-08 05:34:55,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2295 states to 2295 states and 3867 transitions. [2025-03-08 05:34:55,129 INFO L78 Accepts]: Start accepts. Automaton has 2295 states and 3867 transitions. Word has length 132 [2025-03-08 05:34:55,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:34:55,129 INFO L471 AbstractCegarLoop]: Abstraction has 2295 states and 3867 transitions. [2025-03-08 05:34:55,130 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, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:34:55,130 INFO L276 IsEmpty]: Start isEmpty. Operand 2295 states and 3867 transitions. [2025-03-08 05:34:55,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-08 05:34:55,141 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:34:55,141 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:34:55,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 05:34:55,141 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:34:55,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:34:55,142 INFO L85 PathProgramCache]: Analyzing trace with hash -278927418, now seen corresponding path program 1 times [2025-03-08 05:34:55,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:34:55,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846267157] [2025-03-08 05:34:55,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:34:55,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:34:55,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 05:34:55,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 05:34:55,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:34:55,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:34:55,199 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-08 05:34:55,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:34:55,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846267157] [2025-03-08 05:34:55,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846267157] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:34:55,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:34:55,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:34:55,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677436801] [2025-03-08 05:34:55,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:34:55,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:34:55,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:34:55,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:34:55,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:34:55,201 INFO L87 Difference]: Start difference. First operand 2295 states and 3867 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, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:34:55,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:34:55,293 INFO L93 Difference]: Finished difference Result 5253 states and 8929 transitions. [2025-03-08 05:34:55,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:34:55,294 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, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 133 [2025-03-08 05:34:55,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:34:55,312 INFO L225 Difference]: With dead ends: 5253 [2025-03-08 05:34:55,313 INFO L226 Difference]: Without dead ends: 3385 [2025-03-08 05:34:55,320 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-03-08 05:34:55,320 INFO L435 NwaCegarLoop]: 397 mSDtfsCounter, 91 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 785 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-03-08 05:34:55,321 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 785 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:34:55,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3385 states. [2025-03-08 05:34:55,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3385 to 3359. [2025-03-08 05:34:55,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3359 states, 2693 states have (on average 1.6390642406238396) internal successors, (4414), 2706 states have internal predecessors, (4414), 615 states have call successors, (615), 42 states have call predecessors, (615), 50 states have return successors, (698), 617 states have call predecessors, (698), 611 states have call successors, (698) [2025-03-08 05:34:55,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3359 states to 3359 states and 5727 transitions. [2025-03-08 05:34:55,503 INFO L78 Accepts]: Start accepts. Automaton has 3359 states and 5727 transitions. Word has length 133 [2025-03-08 05:34:55,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:34:55,504 INFO L471 AbstractCegarLoop]: Abstraction has 3359 states and 5727 transitions. [2025-03-08 05:34:55,504 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, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:34:55,504 INFO L276 IsEmpty]: Start isEmpty. Operand 3359 states and 5727 transitions. [2025-03-08 05:34:55,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-08 05:34:55,516 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:34:55,517 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:34:55,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 05:34:55,517 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:34:55,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:34:55,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1180101632, now seen corresponding path program 1 times [2025-03-08 05:34:55,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:34:55,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180674010] [2025-03-08 05:34:55,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:34:55,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:34:55,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-08 05:34:55,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-08 05:34:55,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:34:55,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:34:55,574 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-08 05:34:55,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:34:55,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180674010] [2025-03-08 05:34:55,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180674010] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:34:55,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:34:55,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:34:55,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511271907] [2025-03-08 05:34:55,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:34:55,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:34:55,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:34:55,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:34:55,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:34:55,576 INFO L87 Difference]: Start difference. First operand 3359 states and 5727 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, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:34:55,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:34:55,709 INFO L93 Difference]: Finished difference Result 8038 states and 13795 transitions. [2025-03-08 05:34:55,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:34:55,710 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, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 134 [2025-03-08 05:34:55,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:34:55,739 INFO L225 Difference]: With dead ends: 8038 [2025-03-08 05:34:55,739 INFO L226 Difference]: Without dead ends: 5322 [2025-03-08 05:34:55,751 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-03-08 05:34:55,751 INFO L435 NwaCegarLoop]: 405 mSDtfsCounter, 89 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 799 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-03-08 05:34:55,752 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 799 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:34:55,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5322 states. [2025-03-08 05:34:56,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5322 to 5296. [2025-03-08 05:34:56,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5296 states, 4254 states have (on average 1.6389280677009872) internal successors, (6972), 4267 states have internal predecessors, (6972), 991 states have call successors, (991), 42 states have call predecessors, (991), 50 states have return successors, (1118), 993 states have call predecessors, (1118), 987 states have call successors, (1118) [2025-03-08 05:34:56,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5296 states to 5296 states and 9081 transitions. [2025-03-08 05:34:56,051 INFO L78 Accepts]: Start accepts. Automaton has 5296 states and 9081 transitions. Word has length 134 [2025-03-08 05:34:56,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:34:56,051 INFO L471 AbstractCegarLoop]: Abstraction has 5296 states and 9081 transitions. [2025-03-08 05:34:56,051 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, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:34:56,051 INFO L276 IsEmpty]: Start isEmpty. Operand 5296 states and 9081 transitions. [2025-03-08 05:34:56,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-08 05:34:56,074 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:34:56,074 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:34:56,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 05:34:56,075 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:34:56,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:34:56,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1146111033, now seen corresponding path program 1 times [2025-03-08 05:34:56,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:34:56,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281572268] [2025-03-08 05:34:56,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:34:56,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:34:56,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-08 05:34:56,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-08 05:34:56,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:34:56,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:34:56,130 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-08 05:34:56,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:34:56,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281572268] [2025-03-08 05:34:56,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281572268] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:34:56,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:34:56,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:34:56,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401436926] [2025-03-08 05:34:56,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:34:56,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:34:56,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:34:56,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:34:56,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:34:56,133 INFO L87 Difference]: Start difference. First operand 5296 states and 9081 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:34:56,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:34:56,397 INFO L93 Difference]: Finished difference Result 12942 states and 22355 transitions. [2025-03-08 05:34:56,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:34:56,400 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 135 [2025-03-08 05:34:56,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:34:56,451 INFO L225 Difference]: With dead ends: 12942 [2025-03-08 05:34:56,451 INFO L226 Difference]: Without dead ends: 8644 [2025-03-08 05:34:56,475 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-03-08 05:34:56,476 INFO L435 NwaCegarLoop]: 397 mSDtfsCounter, 87 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 788 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-03-08 05:34:56,476 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 788 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:34:56,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8644 states. [2025-03-08 05:34:56,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8644 to 8618. [2025-03-08 05:34:56,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8618 states, 6970 states have (on average 1.6413199426111909) internal successors, (11440), 6983 states have internal predecessors, (11440), 1597 states have call successors, (1597), 42 states have call predecessors, (1597), 50 states have return successors, (1802), 1599 states have call predecessors, (1802), 1593 states have call successors, (1802) [2025-03-08 05:34:56,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8618 states to 8618 states and 14839 transitions. [2025-03-08 05:34:56,886 INFO L78 Accepts]: Start accepts. Automaton has 8618 states and 14839 transitions. Word has length 135 [2025-03-08 05:34:56,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:34:56,888 INFO L471 AbstractCegarLoop]: Abstraction has 8618 states and 14839 transitions. [2025-03-08 05:34:56,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:34:56,889 INFO L276 IsEmpty]: Start isEmpty. Operand 8618 states and 14839 transitions. [2025-03-08 05:34:56,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-08 05:34:56,916 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:34:56,916 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, 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-03-08 05:34:56,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 05:34:56,916 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:34:56,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:34:56,917 INFO L85 PathProgramCache]: Analyzing trace with hash -373306977, now seen corresponding path program 1 times [2025-03-08 05:34:56,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:34:56,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283895139] [2025-03-08 05:34:56,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:34:56,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:34:56,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-08 05:34:56,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-08 05:34:56,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:34:56,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:34:56,968 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-08 05:34:56,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:34:56,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283895139] [2025-03-08 05:34:56,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283895139] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:34:56,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:34:56,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:34:56,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438885486] [2025-03-08 05:34:56,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:34:56,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:34:56,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:34:56,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:34:56,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:34:56,970 INFO L87 Difference]: Start difference. First operand 8618 states and 14839 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:34:57,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:34:57,322 INFO L93 Difference]: Finished difference Result 22161 states and 38340 transitions. [2025-03-08 05:34:57,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:34:57,327 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 136 [2025-03-08 05:34:57,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:34:57,386 INFO L225 Difference]: With dead ends: 22161 [2025-03-08 05:34:57,387 INFO L226 Difference]: Without dead ends: 14934 [2025-03-08 05:34:57,412 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-03-08 05:34:57,413 INFO L435 NwaCegarLoop]: 407 mSDtfsCounter, 85 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 800 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-03-08 05:34:57,413 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 800 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:34:57,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14934 states. [2025-03-08 05:34:57,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14934 to 14908. [2025-03-08 05:34:58,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14908 states, 12057 states have (on average 1.6341544331093971) internal successors, (19703), 12070 states have internal predecessors, (19703), 2800 states have call successors, (2800), 42 states have call predecessors, (2800), 50 states have return successors, (3149), 2802 states have call predecessors, (3149), 2796 states have call successors, (3149) [2025-03-08 05:34:58,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14908 states to 14908 states and 25652 transitions. [2025-03-08 05:34:58,082 INFO L78 Accepts]: Start accepts. Automaton has 14908 states and 25652 transitions. Word has length 136 [2025-03-08 05:34:58,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:34:58,083 INFO L471 AbstractCegarLoop]: Abstraction has 14908 states and 25652 transitions. [2025-03-08 05:34:58,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:34:58,083 INFO L276 IsEmpty]: Start isEmpty. Operand 14908 states and 25652 transitions. [2025-03-08 05:34:58,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-08 05:34:58,125 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:34:58,125 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, 1, 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-03-08 05:34:58,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 05:34:58,125 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:34:58,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:34:58,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1502771064, now seen corresponding path program 1 times [2025-03-08 05:34:58,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:34:58,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745852899] [2025-03-08 05:34:58,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:34:58,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:34:58,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-08 05:34:58,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-08 05:34:58,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:34:58,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:34:58,253 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-08 05:34:58,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:34:58,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745852899] [2025-03-08 05:34:58,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745852899] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:34:58,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:34:58,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:34:58,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475556637] [2025-03-08 05:34:58,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:34:58,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:34:58,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:34:58,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:34:58,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:34:58,255 INFO L87 Difference]: Start difference. First operand 14908 states and 25652 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:34:59,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:34:59,100 INFO L93 Difference]: Finished difference Result 39282 states and 67948 transitions. [2025-03-08 05:34:59,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:34:59,101 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 137 [2025-03-08 05:34:59,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:34:59,224 INFO L225 Difference]: With dead ends: 39282 [2025-03-08 05:34:59,225 INFO L226 Difference]: Without dead ends: 26335 [2025-03-08 05:34:59,282 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-03-08 05:34:59,282 INFO L435 NwaCegarLoop]: 397 mSDtfsCounter, 83 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 788 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-03-08 05:34:59,283 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 788 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:34:59,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26335 states. [2025-03-08 05:35:00,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26335 to 26309. [2025-03-08 05:35:00,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26309 states, 21419 states have (on average 1.6313553387179607) internal successors, (34942), 21432 states have internal predecessors, (34942), 4839 states have call successors, (4839), 42 states have call predecessors, (4839), 50 states have return successors, (5462), 4841 states have call predecessors, (5462), 4835 states have call successors, (5462) [2025-03-08 05:35:00,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26309 states to 26309 states and 45243 transitions. [2025-03-08 05:35:00,355 INFO L78 Accepts]: Start accepts. Automaton has 26309 states and 45243 transitions. Word has length 137 [2025-03-08 05:35:00,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:35:00,355 INFO L471 AbstractCegarLoop]: Abstraction has 26309 states and 45243 transitions. [2025-03-08 05:35:00,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:35:00,356 INFO L276 IsEmpty]: Start isEmpty. Operand 26309 states and 45243 transitions. [2025-03-08 05:35:00,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-08 05:35:00,405 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:35:00,406 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1] [2025-03-08 05:35:00,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 05:35:00,406 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:35:00,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:35:00,406 INFO L85 PathProgramCache]: Analyzing trace with hash 362725223, now seen corresponding path program 2 times [2025-03-08 05:35:00,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:35:00,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330174544] [2025-03-08 05:35:00,407 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:35:00,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:35:00,424 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 138 statements into 2 equivalence classes. [2025-03-08 05:35:00,429 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 68 of 138 statements. [2025-03-08 05:35:00,430 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 05:35:00,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:35:00,502 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2025-03-08 05:35:00,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:35:00,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330174544] [2025-03-08 05:35:00,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330174544] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:35:00,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:35:00,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 05:35:00,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777339649] [2025-03-08 05:35:00,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:35:00,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 05:35:00,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:35:00,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 05:35:00,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:35:00,505 INFO L87 Difference]: Start difference. First operand 26309 states and 45243 transitions. Second operand has 8 states, 7 states have (on average 11.428571428571429) internal successors, (80), 8 states have internal predecessors, (80), 4 states have call successors, (16), 1 states have call predecessors, (16), 3 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-03-08 05:35:01,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:35:01,015 INFO L93 Difference]: Finished difference Result 26719 states and 45811 transitions. [2025-03-08 05:35:01,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 05:35:01,016 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 11.428571428571429) internal successors, (80), 8 states have internal predecessors, (80), 4 states have call successors, (16), 1 states have call predecessors, (16), 3 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) Word has length 138 [2025-03-08 05:35:01,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:35:01,110 INFO L225 Difference]: With dead ends: 26719 [2025-03-08 05:35:01,111 INFO L226 Difference]: Without dead ends: 26333 [2025-03-08 05:35:01,121 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-08 05:35:01,122 INFO L435 NwaCegarLoop]: 393 mSDtfsCounter, 4 mSDsluCounter, 2327 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 2720 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:35:01,122 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 2720 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:35:01,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26333 states. [2025-03-08 05:35:01,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26333 to 26327. [2025-03-08 05:35:02,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26327 states, 21429 states have (on average 1.631060712119091) internal successors, (34952), 21448 states have internal predecessors, (34952), 4841 states have call successors, (4841), 42 states have call predecessors, (4841), 56 states have return successors, (5474), 4843 states have call predecessors, (5474), 4837 states have call successors, (5474) [2025-03-08 05:35:02,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26327 states to 26327 states and 45267 transitions. [2025-03-08 05:35:02,101 INFO L78 Accepts]: Start accepts. Automaton has 26327 states and 45267 transitions. Word has length 138 [2025-03-08 05:35:02,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:35:02,102 INFO L471 AbstractCegarLoop]: Abstraction has 26327 states and 45267 transitions. [2025-03-08 05:35:02,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 11.428571428571429) internal successors, (80), 8 states have internal predecessors, (80), 4 states have call successors, (16), 1 states have call predecessors, (16), 3 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-03-08 05:35:02,102 INFO L276 IsEmpty]: Start isEmpty. Operand 26327 states and 45267 transitions. [2025-03-08 05:35:02,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-08 05:35:02,146 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:35:02,146 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:35:02,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 05:35:02,147 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:35:02,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:35:02,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1792625102, now seen corresponding path program 1 times [2025-03-08 05:35:02,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:35:02,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688907924] [2025-03-08 05:35:02,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:35:02,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:35:02,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-08 05:35:02,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-08 05:35:02,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:35:02,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:35:02,230 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-03-08 05:35:02,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:35:02,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688907924] [2025-03-08 05:35:02,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688907924] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:35:02,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:35:02,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:35:02,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101563337] [2025-03-08 05:35:02,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:35:02,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:35:02,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:35:02,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:35:02,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:35:02,233 INFO L87 Difference]: Start difference. First operand 26327 states and 45267 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, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:35:03,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:35:03,040 INFO L93 Difference]: Finished difference Result 49816 states and 85790 transitions. [2025-03-08 05:35:03,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:35:03,041 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, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 139 [2025-03-08 05:35:03,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:35:03,170 INFO L225 Difference]: With dead ends: 49816 [2025-03-08 05:35:03,170 INFO L226 Difference]: Without dead ends: 26353 [2025-03-08 05:35:03,245 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-03-08 05:35:03,247 INFO L435 NwaCegarLoop]: 510 mSDtfsCounter, 96 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 919 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-03-08 05:35:03,248 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 919 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:35:03,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26353 states. [2025-03-08 05:35:04,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26353 to 26327. [2025-03-08 05:35:04,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26327 states, 21429 states have (on average 1.618647627047459) internal successors, (34686), 21448 states have internal predecessors, (34686), 4841 states have call successors, (4841), 42 states have call predecessors, (4841), 56 states have return successors, (5474), 4843 states have call predecessors, (5474), 4837 states have call successors, (5474) [2025-03-08 05:35:04,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26327 states to 26327 states and 45001 transitions. [2025-03-08 05:35:04,296 INFO L78 Accepts]: Start accepts. Automaton has 26327 states and 45001 transitions. Word has length 139 [2025-03-08 05:35:04,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:35:04,296 INFO L471 AbstractCegarLoop]: Abstraction has 26327 states and 45001 transitions. [2025-03-08 05:35:04,297 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, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:35:04,297 INFO L276 IsEmpty]: Start isEmpty. Operand 26327 states and 45001 transitions. [2025-03-08 05:35:04,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-08 05:35:04,340 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:35:04,340 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:35:04,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 05:35:04,340 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:35:04,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:35:04,341 INFO L85 PathProgramCache]: Analyzing trace with hash 689221147, now seen corresponding path program 1 times [2025-03-08 05:35:04,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:35:04,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027731601] [2025-03-08 05:35:04,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:35:04,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:35:04,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-08 05:35:04,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-08 05:35:04,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:35:04,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:35:04,393 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-08 05:35:04,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:35:04,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027731601] [2025-03-08 05:35:04,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027731601] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:35:04,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:35:04,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:35:04,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975417442] [2025-03-08 05:35:04,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:35:04,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:35:04,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:35:04,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:35:04,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:35:04,396 INFO L87 Difference]: Start difference. First operand 26327 states and 45001 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:35:05,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:35:05,376 INFO L93 Difference]: Finished difference Result 71490 states and 122668 transitions. [2025-03-08 05:35:05,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:35:05,377 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 139 [2025-03-08 05:35:05,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:35:05,596 INFO L225 Difference]: With dead ends: 71490 [2025-03-08 05:35:05,596 INFO L226 Difference]: Without dead ends: 47810 [2025-03-08 05:35:05,663 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-03-08 05:35:05,665 INFO L435 NwaCegarLoop]: 397 mSDtfsCounter, 81 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 788 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-03-08 05:35:05,665 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 788 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:35:05,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47810 states. [2025-03-08 05:35:07,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47810 to 47784. [2025-03-08 05:35:07,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47784 states, 39171 states have (on average 1.612876873197008) internal successors, (63178), 39190 states have internal predecessors, (63178), 8556 states have call successors, (8556), 42 states have call predecessors, (8556), 56 states have return successors, (9721), 8558 states have call predecessors, (9721), 8552 states have call successors, (9721) [2025-03-08 05:35:07,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47784 states to 47784 states and 81455 transitions. [2025-03-08 05:35:07,489 INFO L78 Accepts]: Start accepts. Automaton has 47784 states and 81455 transitions. Word has length 139 [2025-03-08 05:35:07,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:35:07,490 INFO L471 AbstractCegarLoop]: Abstraction has 47784 states and 81455 transitions. [2025-03-08 05:35:07,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:35:07,490 INFO L276 IsEmpty]: Start isEmpty. Operand 47784 states and 81455 transitions. [2025-03-08 05:35:07,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-08 05:35:07,563 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:35:07,564 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:35:07,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 05:35:07,564 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:35:07,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:35:07,565 INFO L85 PathProgramCache]: Analyzing trace with hash -451957776, now seen corresponding path program 1 times [2025-03-08 05:35:07,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:35:07,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266977239] [2025-03-08 05:35:07,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:35:07,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:35:07,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-08 05:35:07,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-08 05:35:07,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:35:07,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:35:07,637 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-08 05:35:07,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:35:07,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266977239] [2025-03-08 05:35:07,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266977239] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:35:07,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:35:07,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:35:07,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791915249] [2025-03-08 05:35:07,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:35:07,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:35:07,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:35:07,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:35:07,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:35:07,640 INFO L87 Difference]: Start difference. First operand 47784 states and 81455 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:35:09,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:35:09,515 INFO L93 Difference]: Finished difference Result 88947 states and 151945 transitions. [2025-03-08 05:35:09,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:35:09,516 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 140 [2025-03-08 05:35:09,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:35:09,999 INFO L225 Difference]: With dead ends: 88947 [2025-03-08 05:35:10,000 INFO L226 Difference]: Without dead ends: 88533 [2025-03-08 05:35:10,081 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-03-08 05:35:10,085 INFO L435 NwaCegarLoop]: 406 mSDtfsCounter, 76 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 802 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-03-08 05:35:10,086 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 802 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:35:10,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88533 states. [2025-03-08 05:35:13,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88533 to 88507. [2025-03-08 05:35:13,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88507 states, 73095 states have (on average 1.605171352349682) internal successors, (117330), 73114 states have internal predecessors, (117330), 15355 states have call successors, (15355), 42 states have call predecessors, (15355), 56 states have return successors, (17566), 15357 states have call predecessors, (17566), 15351 states have call successors, (17566) [2025-03-08 05:35:13,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88507 states to 88507 states and 150251 transitions. [2025-03-08 05:35:13,947 INFO L78 Accepts]: Start accepts. Automaton has 88507 states and 150251 transitions. Word has length 140 [2025-03-08 05:35:13,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:35:13,947 INFO L471 AbstractCegarLoop]: Abstraction has 88507 states and 150251 transitions. [2025-03-08 05:35:13,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:35:13,947 INFO L276 IsEmpty]: Start isEmpty. Operand 88507 states and 150251 transitions. [2025-03-08 05:35:14,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-08 05:35:14,017 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:35:14,017 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:35:14,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 05:35:14,017 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:35:14,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:35:14,018 INFO L85 PathProgramCache]: Analyzing trace with hash -928675460, now seen corresponding path program 1 times [2025-03-08 05:35:14,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:35:14,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535050479] [2025-03-08 05:35:14,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:35:14,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:35:14,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-08 05:35:14,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-08 05:35:14,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:35:14,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:35:14,499 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-08 05:35:14,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:35:14,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535050479] [2025-03-08 05:35:14,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535050479] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:35:14,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [448793538] [2025-03-08 05:35:14,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:35:14,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:35:14,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:35:14,502 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:35:14,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 05:35:14,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-08 05:35:14,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-08 05:35:14,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:35:14,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:35:14,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 1063 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-08 05:35:14,752 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:35:15,105 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 05:35:15,105 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:35:15,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [448793538] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:35:15,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:35:15,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 20 [2025-03-08 05:35:15,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425920721] [2025-03-08 05:35:15,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:35:15,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 05:35:15,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:35:15,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 05:35:15,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2025-03-08 05:35:15,106 INFO L87 Difference]: Start difference. First operand 88507 states and 150251 transitions. Second operand has 11 states, 11 states have (on average 9.545454545454545) internal successors, (105), 8 states have internal predecessors, (105), 5 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2025-03-08 05:35:18,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:35:18,445 INFO L93 Difference]: Finished difference Result 177032 states and 305822 transitions. [2025-03-08 05:35:18,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 05:35:18,446 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 9.545454545454545) internal successors, (105), 8 states have internal predecessors, (105), 5 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) Word has length 141 [2025-03-08 05:35:18,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:35:19,452 INFO L225 Difference]: With dead ends: 177032 [2025-03-08 05:35:19,452 INFO L226 Difference]: Without dead ends: 176626 [2025-03-08 05:35:19,529 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=627, Unknown=0, NotChecked=0, Total=756 [2025-03-08 05:35:19,529 INFO L435 NwaCegarLoop]: 484 mSDtfsCounter, 629 mSDsluCounter, 3370 mSDsCounter, 0 mSdLazyCounter, 785 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 631 SdHoareTripleChecker+Valid, 3854 SdHoareTripleChecker+Invalid, 859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 785 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 05:35:19,529 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [631 Valid, 3854 Invalid, 859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 785 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 05:35:19,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176626 states.