./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec1_product12.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/email_spec1_product12.cil.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2f43e7267ed715243a41104ad5703ed473575064952f167333067630dfd5e9da --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 03:50:38,499 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 03:50:38,548 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 03:50:38,555 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 03:50:38,555 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 03:50:38,574 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 03:50:38,575 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 03:50:38,575 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 03:50:38,575 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 03:50:38,575 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 03:50:38,575 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 03:50:38,575 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 03:50:38,576 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 03:50:38,576 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 03:50:38,576 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 03:50:38,576 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 03:50:38,576 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 03:50:38,576 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 03:50:38,577 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 03:50:38,577 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 03:50:38,577 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 03:50:38,577 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 03:50:38,577 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 03:50:38,577 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 03:50:38,577 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 03:50:38,578 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 03:50:38,578 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 03:50:38,578 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 03:50:38,578 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 03:50:38,578 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:50:38,578 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:50:38,578 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:50:38,578 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:50:38,578 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 03:50:38,579 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:50:38,579 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:50:38,579 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:50:38,579 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:50:38,579 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 03:50:38,579 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 03:50:38,579 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 03:50:38,579 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 03:50:38,579 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 03:50:38,579 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 03:50:38,579 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 03:50:38,580 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 03:50:38,580 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 03:50:38,580 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 03:50:38,580 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2f43e7267ed715243a41104ad5703ed473575064952f167333067630dfd5e9da [2025-01-09 03:50:38,783 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 03:50:38,791 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 03:50:38,792 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 03:50:38,793 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 03:50:38,793 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 03:50:38,795 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec1_product12.cil.c [2025-01-09 03:50:39,938 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/24d9dc8fb/590d626f185146ac918d156ff7476518/FLAGb5adfdf01 [2025-01-09 03:50:40,245 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 03:50:40,245 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec1_product12.cil.c [2025-01-09 03:50:40,268 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/24d9dc8fb/590d626f185146ac918d156ff7476518/FLAGb5adfdf01 [2025-01-09 03:50:40,489 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/24d9dc8fb/590d626f185146ac918d156ff7476518 [2025-01-09 03:50:40,490 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 03:50:40,491 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 03:50:40,492 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 03:50:40,492 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 03:50:40,495 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 03:50:40,495 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:50:40" (1/1) ... [2025-01-09 03:50:40,496 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11369eca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:50:40, skipping insertion in model container [2025-01-09 03:50:40,496 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:50:40" (1/1) ... [2025-01-09 03:50:40,533 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 03:50:40,856 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec1_product12.cil.c[58861,58874] [2025-01-09 03:50:40,881 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:50:40,895 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 03:50:40,904 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [48] [2025-01-09 03:50:40,906 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [269] [2025-01-09 03:50:40,906 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [318] [2025-01-09 03:50:40,906 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [598] [2025-01-09 03:50:40,906 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [1671] [2025-01-09 03:50:40,906 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [1906] [2025-01-09 03:50:40,906 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [2312] [2025-01-09 03:50:40,906 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [2329] [2025-01-09 03:50:40,906 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [2695] [2025-01-09 03:50:40,906 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [2704] [2025-01-09 03:50:40,906 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"AddressBookEncrypt_spec.i","") [2808] [2025-01-09 03:50:40,964 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec1_product12.cil.c[58861,58874] [2025-01-09 03:50:40,967 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:50:40,989 INFO L204 MainTranslator]: Completed translation [2025-01-09 03:50:40,991 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:50:40 WrapperNode [2025-01-09 03:50:40,991 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 03:50:40,991 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 03:50:40,992 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 03:50:40,992 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 03:50:40,995 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:50:40" (1/1) ... [2025-01-09 03:50:41,012 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:50:40" (1/1) ... [2025-01-09 03:50:41,041 INFO L138 Inliner]: procedures = 122, calls = 174, calls flagged for inlining = 50, calls inlined = 40, statements flattened = 823 [2025-01-09 03:50:41,041 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 03:50:41,042 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 03:50:41,042 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 03:50:41,042 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 03:50:41,049 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:50:40" (1/1) ... [2025-01-09 03:50:41,049 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:50:40" (1/1) ... [2025-01-09 03:50:41,052 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:50:40" (1/1) ... [2025-01-09 03:50:41,071 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-01-09 03:50:41,072 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:50:40" (1/1) ... [2025-01-09 03:50:41,072 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:50:40" (1/1) ... [2025-01-09 03:50:41,081 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:50:40" (1/1) ... [2025-01-09 03:50:41,082 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:50:40" (1/1) ... [2025-01-09 03:50:41,089 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:50:40" (1/1) ... [2025-01-09 03:50:41,091 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:50:40" (1/1) ... [2025-01-09 03:50:41,096 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:50:40" (1/1) ... [2025-01-09 03:50:41,101 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 03:50:41,105 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 03:50:41,105 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 03:50:41,105 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 03:50:41,106 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:50:40" (1/1) ... [2025-01-09 03:50:41,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:50:41,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:50:41,134 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 03:50:41,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 03:50:41,151 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2025-01-09 03:50:41,152 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2025-01-09 03:50:41,152 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2025-01-09 03:50:41,152 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2025-01-09 03:50:41,152 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-01-09 03:50:41,152 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-01-09 03:50:41,152 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-01-09 03:50:41,152 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-01-09 03:50:41,152 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-01-09 03:50:41,152 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-01-09 03:50:41,153 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2025-01-09 03:50:41,154 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2025-01-09 03:50:41,154 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-01-09 03:50:41,154 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-01-09 03:50:41,154 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-01-09 03:50:41,154 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-01-09 03:50:41,155 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 03:50:41,156 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-01-09 03:50:41,156 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-01-09 03:50:41,156 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-01-09 03:50:41,156 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-01-09 03:50:41,156 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-01-09 03:50:41,156 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-01-09 03:50:41,156 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-01-09 03:50:41,156 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-01-09 03:50:41,156 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2025-01-09 03:50:41,156 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2025-01-09 03:50:41,156 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-01-09 03:50:41,156 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-01-09 03:50:41,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 03:50:41,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 03:50:41,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 03:50:41,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 03:50:41,157 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-01-09 03:50:41,157 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-01-09 03:50:41,157 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 03:50:41,157 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 03:50:41,311 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 03:50:41,313 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 03:50:41,845 INFO L? ?]: Removed 336 outVars from TransFormulas that were not future-live. [2025-01-09 03:50:41,845 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 03:50:41,861 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 03:50:41,861 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 03:50:41,861 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:50:41 BoogieIcfgContainer [2025-01-09 03:50:41,861 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 03:50:41,863 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 03:50:41,863 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 03:50:41,868 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 03:50:41,868 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:50:40" (1/3) ... [2025-01-09 03:50:41,868 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a621f78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:50:41, skipping insertion in model container [2025-01-09 03:50:41,868 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:50:40" (2/3) ... [2025-01-09 03:50:41,868 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a621f78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:50:41, skipping insertion in model container [2025-01-09 03:50:41,868 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:50:41" (3/3) ... [2025-01-09 03:50:41,869 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec1_product12.cil.c [2025-01-09 03:50:41,881 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 03:50:41,883 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec1_product12.cil.c that has 16 procedures, 260 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 03:50:41,931 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 03:50:41,940 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;@29460e7d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 03:50:41,940 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 03:50:41,945 INFO L276 IsEmpty]: Start isEmpty. Operand has 260 states, 204 states have (on average 1.553921568627451) internal successors, (317), 208 states have internal predecessors, (317), 39 states have call successors, (39), 15 states have call predecessors, (39), 15 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-01-09 03:50:41,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-01-09 03:50:41,957 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:50:41,957 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:50:41,958 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:50:41,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:50:41,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1361624827, now seen corresponding path program 1 times [2025-01-09 03:50:41,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:50:41,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761282900] [2025-01-09 03:50:41,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:50:41,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:50:42,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-01-09 03:50:42,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-01-09 03:50:42,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:50:42,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:50:42,464 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-09 03:50:42,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:50:42,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761282900] [2025-01-09 03:50:42,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761282900] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:50:42,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1447660240] [2025-01-09 03:50:42,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:50:42,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:50:42,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:50:42,470 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:50:42,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 03:50:42,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-01-09 03:50:42,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-01-09 03:50:42,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:50:42,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:50:42,701 INFO L256 TraceCheckSpWp]: Trace formula consists of 871 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 03:50:42,708 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:50:42,738 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-01-09 03:50:42,739 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:50:42,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1447660240] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:50:42,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:50:42,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-01-09 03:50:42,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639532825] [2025-01-09 03:50:42,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:50:42,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:50:42,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:50:42,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:50:42,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:50:42,761 INFO L87 Difference]: Start difference. First operand has 260 states, 204 states have (on average 1.553921568627451) internal successors, (317), 208 states have internal predecessors, (317), 39 states have call successors, (39), 15 states have call predecessors, (39), 15 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 03:50:42,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:50:42,800 INFO L93 Difference]: Finished difference Result 374 states and 558 transitions. [2025-01-09 03:50:42,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:50:42,802 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 86 [2025-01-09 03:50:42,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:50:42,808 INFO L225 Difference]: With dead ends: 374 [2025-01-09 03:50:42,809 INFO L226 Difference]: Without dead ends: 255 [2025-01-09 03:50:42,811 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:50:42,813 INFO L435 NwaCegarLoop]: 390 mSDtfsCounter, 1 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 777 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:50:42,813 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 777 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:50:42,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2025-01-09 03:50:42,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 254. [2025-01-09 03:50:42,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 199 states have (on average 1.5477386934673367) internal successors, (308), 202 states have internal predecessors, (308), 39 states have call successors, (39), 15 states have call predecessors, (39), 15 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 03:50:42,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 385 transitions. [2025-01-09 03:50:42,861 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 385 transitions. Word has length 86 [2025-01-09 03:50:42,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:50:42,862 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 385 transitions. [2025-01-09 03:50:42,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 03:50:42,864 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 385 transitions. [2025-01-09 03:50:42,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-01-09 03:50:42,868 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:50:42,869 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:50:42,876 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 03:50:43,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 03:50:43,070 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:50:43,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:50:43,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1538969165, now seen corresponding path program 1 times [2025-01-09 03:50:43,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:50:43,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152796743] [2025-01-09 03:50:43,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:50:43,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:50:43,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-01-09 03:50:43,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-01-09 03:50:43,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:50:43,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:50:43,249 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-01-09 03:50:43,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:50:43,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152796743] [2025-01-09 03:50:43,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152796743] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:50:43,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1953996763] [2025-01-09 03:50:43,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:50:43,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:50:43,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:50:43,253 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:50:43,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 03:50:43,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-01-09 03:50:43,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-01-09 03:50:43,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:50:43,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:50:43,475 INFO L256 TraceCheckSpWp]: Trace formula consists of 882 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 03:50:43,479 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:50:43,496 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-01-09 03:50:43,500 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:50:43,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1953996763] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:50:43,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:50:43,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-01-09 03:50:43,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867395565] [2025-01-09 03:50:43,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:50:43,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:50:43,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:50:43,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:50:43,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:50:43,502 INFO L87 Difference]: Start difference. First operand 254 states and 385 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 03:50:43,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:50:43,541 INFO L93 Difference]: Finished difference Result 533 states and 821 transitions. [2025-01-09 03:50:43,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:50:43,542 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 91 [2025-01-09 03:50:43,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:50:43,544 INFO L225 Difference]: With dead ends: 533 [2025-01-09 03:50:43,544 INFO L226 Difference]: Without dead ends: 305 [2025-01-09 03:50:43,545 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:50:43,546 INFO L435 NwaCegarLoop]: 398 mSDtfsCounter, 99 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 735 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-01-09 03:50:43,546 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 735 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:50:43,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2025-01-09 03:50:43,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 297. [2025-01-09 03:50:43,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 231 states have (on average 1.5627705627705628) internal successors, (361), 234 states have internal predecessors, (361), 50 states have call successors, (50), 15 states have call predecessors, (50), 15 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2025-01-09 03:50:43,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 460 transitions. [2025-01-09 03:50:43,567 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 460 transitions. Word has length 91 [2025-01-09 03:50:43,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:50:43,567 INFO L471 AbstractCegarLoop]: Abstraction has 297 states and 460 transitions. [2025-01-09 03:50:43,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 03:50:43,568 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 460 transitions. [2025-01-09 03:50:43,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-01-09 03:50:43,570 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:50:43,570 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:50:43,578 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 03:50:43,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:50:43,771 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:50:43,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:50:43,772 INFO L85 PathProgramCache]: Analyzing trace with hash 181032618, now seen corresponding path program 1 times [2025-01-09 03:50:43,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:50:43,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393368391] [2025-01-09 03:50:43,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:50:43,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:50:43,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-09 03:50:43,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-09 03:50:43,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:50:43,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:50:43,945 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-01-09 03:50:43,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:50:43,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393368391] [2025-01-09 03:50:43,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393368391] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:50:43,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [504928394] [2025-01-09 03:50:43,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:50:43,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:50:43,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:50:43,949 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:50:43,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 03:50:44,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-09 03:50:44,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-09 03:50:44,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:50:44,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:50:44,164 INFO L256 TraceCheckSpWp]: Trace formula consists of 887 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 03:50:44,168 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:50:44,212 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-09 03:50:44,214 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:50:44,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [504928394] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:50:44,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:50:44,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-01-09 03:50:44,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361234875] [2025-01-09 03:50:44,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:50:44,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:50:44,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:50:44,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:50:44,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:50:44,216 INFO L87 Difference]: Start difference. First operand 297 states and 460 transitions. Second operand has 5 states, 4 states have (on average 16.0) internal successors, (64), 5 states have internal predecessors, (64), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2025-01-09 03:50:44,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:50:44,268 INFO L93 Difference]: Finished difference Result 585 states and 910 transitions. [2025-01-09 03:50:44,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:50:44,268 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.0) internal successors, (64), 5 states have internal predecessors, (64), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 92 [2025-01-09 03:50:44,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:50:44,272 INFO L225 Difference]: With dead ends: 585 [2025-01-09 03:50:44,273 INFO L226 Difference]: Without dead ends: 299 [2025-01-09 03:50:44,274 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 90 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-01-09 03:50:44,275 INFO L435 NwaCegarLoop]: 376 mSDtfsCounter, 2 mSDsluCounter, 1117 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1493 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-01-09 03:50:44,276 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1493 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:50:44,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2025-01-09 03:50:44,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2025-01-09 03:50:44,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 232 states have (on average 1.5603448275862069) internal successors, (362), 236 states have internal predecessors, (362), 50 states have call successors, (50), 15 states have call predecessors, (50), 16 states have return successors, (51), 49 states have call predecessors, (51), 49 states have call successors, (51) [2025-01-09 03:50:44,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 463 transitions. [2025-01-09 03:50:44,301 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 463 transitions. Word has length 92 [2025-01-09 03:50:44,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:50:44,302 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 463 transitions. [2025-01-09 03:50:44,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.0) internal successors, (64), 5 states have internal predecessors, (64), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2025-01-09 03:50:44,302 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 463 transitions. [2025-01-09 03:50:44,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-01-09 03:50:44,304 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:50:44,304 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:50:44,311 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 03:50:44,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:50:44,505 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:50:44,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:50:44,506 INFO L85 PathProgramCache]: Analyzing trace with hash -230095422, now seen corresponding path program 1 times [2025-01-09 03:50:44,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:50:44,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062571417] [2025-01-09 03:50:44,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:50:44,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:50:44,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-09 03:50:44,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-09 03:50:44,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:50:44,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:50:44,676 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-01-09 03:50:44,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:50:44,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062571417] [2025-01-09 03:50:44,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062571417] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:50:44,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [625498489] [2025-01-09 03:50:44,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:50:44,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:50:44,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:50:44,682 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:50:44,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 03:50:44,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-09 03:50:44,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-09 03:50:44,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:50:44,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:50:44,868 INFO L256 TraceCheckSpWp]: Trace formula consists of 888 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 03:50:44,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:50:44,906 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-09 03:50:44,906 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:50:44,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [625498489] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:50:44,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:50:44,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-01-09 03:50:44,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791230932] [2025-01-09 03:50:44,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:50:44,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:50:44,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:50:44,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:50:44,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-01-09 03:50:44,908 INFO L87 Difference]: Start difference. First operand 299 states and 463 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-01-09 03:50:44,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:50:44,970 INFO L93 Difference]: Finished difference Result 587 states and 915 transitions. [2025-01-09 03:50:44,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:50:44,971 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 93 [2025-01-09 03:50:44,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:50:44,973 INFO L225 Difference]: With dead ends: 587 [2025-01-09 03:50:44,974 INFO L226 Difference]: Without dead ends: 301 [2025-01-09 03:50:44,975 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 91 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-01-09 03:50:44,976 INFO L435 NwaCegarLoop]: 374 mSDtfsCounter, 2 mSDsluCounter, 1105 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1479 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-01-09 03:50:44,976 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1479 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:50:44,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2025-01-09 03:50:44,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 301. [2025-01-09 03:50:44,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 233 states have (on average 1.55793991416309) internal successors, (363), 238 states have internal predecessors, (363), 50 states have call successors, (50), 15 states have call predecessors, (50), 17 states have return successors, (56), 49 states have call predecessors, (56), 49 states have call successors, (56) [2025-01-09 03:50:44,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 469 transitions. [2025-01-09 03:50:44,997 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 469 transitions. Word has length 93 [2025-01-09 03:50:44,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:50:44,998 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 469 transitions. [2025-01-09 03:50:44,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-01-09 03:50:44,998 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 469 transitions. [2025-01-09 03:50:45,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-01-09 03:50:45,000 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:50:45,000 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:50:45,007 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 03:50:45,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:50:45,201 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:50:45,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:50:45,201 INFO L85 PathProgramCache]: Analyzing trace with hash -394949981, now seen corresponding path program 1 times [2025-01-09 03:50:45,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:50:45,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448819268] [2025-01-09 03:50:45,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:50:45,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:50:45,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-09 03:50:45,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-09 03:50:45,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:50:45,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:50:45,317 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-01-09 03:50:45,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:50:45,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448819268] [2025-01-09 03:50:45,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448819268] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:50:45,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:50:45,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:50:45,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77867934] [2025-01-09 03:50:45,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:50:45,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:50:45,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:50:45,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:50:45,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:50:45,320 INFO L87 Difference]: Start difference. First operand 301 states and 469 transitions. Second operand has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2025-01-09 03:50:45,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:50:45,362 INFO L93 Difference]: Finished difference Result 579 states and 906 transitions. [2025-01-09 03:50:45,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:50:45,365 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 94 [2025-01-09 03:50:45,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:50:45,367 INFO L225 Difference]: With dead ends: 579 [2025-01-09 03:50:45,368 INFO L226 Difference]: Without dead ends: 301 [2025-01-09 03:50:45,369 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-01-09 03:50:45,369 INFO L435 NwaCegarLoop]: 377 mSDtfsCounter, 2 mSDsluCounter, 1120 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1497 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-01-09 03:50:45,370 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1497 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:50:45,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2025-01-09 03:50:45,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 301. [2025-01-09 03:50:45,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 233 states have (on average 1.55793991416309) internal successors, (363), 238 states have internal predecessors, (363), 50 states have call successors, (50), 15 states have call predecessors, (50), 17 states have return successors, (55), 49 states have call predecessors, (55), 49 states have call successors, (55) [2025-01-09 03:50:45,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 468 transitions. [2025-01-09 03:50:45,386 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 468 transitions. Word has length 94 [2025-01-09 03:50:45,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:50:45,386 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 468 transitions. [2025-01-09 03:50:45,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2025-01-09 03:50:45,387 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 468 transitions. [2025-01-09 03:50:45,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-01-09 03:50:45,388 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:50:45,388 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:50:45,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 03:50:45,389 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:50:45,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:50:45,389 INFO L85 PathProgramCache]: Analyzing trace with hash 861592861, now seen corresponding path program 2 times [2025-01-09 03:50:45,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:50:45,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710473232] [2025-01-09 03:50:45,389 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 03:50:45,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:50:45,403 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 95 statements into 2 equivalence classes. [2025-01-09 03:50:45,421 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 95 of 95 statements. [2025-01-09 03:50:45,421 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 03:50:45,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:50:45,501 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 03:50:45,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:50:45,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710473232] [2025-01-09 03:50:45,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710473232] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:50:45,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:50:45,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:50:45,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942047197] [2025-01-09 03:50:45,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:50:45,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:50:45,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:50:45,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:50:45,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:50:45,503 INFO L87 Difference]: Start difference. First operand 301 states and 468 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-01-09 03:50:45,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:50:45,550 INFO L93 Difference]: Finished difference Result 577 states and 901 transitions. [2025-01-09 03:50:45,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:50:45,550 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 95 [2025-01-09 03:50:45,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:50:45,552 INFO L225 Difference]: With dead ends: 577 [2025-01-09 03:50:45,553 INFO L226 Difference]: Without dead ends: 301 [2025-01-09 03:50:45,554 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-01-09 03:50:45,555 INFO L435 NwaCegarLoop]: 375 mSDtfsCounter, 2 mSDsluCounter, 1108 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1483 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-01-09 03:50:45,556 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1483 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:50:45,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2025-01-09 03:50:45,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 301. [2025-01-09 03:50:45,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 233 states have (on average 1.55793991416309) internal successors, (363), 238 states have internal predecessors, (363), 50 states have call successors, (50), 15 states have call predecessors, (50), 17 states have return successors, (54), 49 states have call predecessors, (54), 49 states have call successors, (54) [2025-01-09 03:50:45,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 467 transitions. [2025-01-09 03:50:45,568 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 467 transitions. Word has length 95 [2025-01-09 03:50:45,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:50:45,570 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 467 transitions. [2025-01-09 03:50:45,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-01-09 03:50:45,570 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 467 transitions. [2025-01-09 03:50:45,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-01-09 03:50:45,571 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:50:45,571 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] [2025-01-09 03:50:45,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 03:50:45,571 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:50:45,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:50:45,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1507582944, now seen corresponding path program 3 times [2025-01-09 03:50:45,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:50:45,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799667666] [2025-01-09 03:50:45,572 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 03:50:45,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:50:45,590 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 96 statements into 3 equivalence classes. [2025-01-09 03:50:45,616 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 84 of 96 statements. [2025-01-09 03:50:45,616 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-09 03:50:45,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:50:45,687 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 03:50:45,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:50:45,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799667666] [2025-01-09 03:50:45,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799667666] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:50:45,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:50:45,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:50:45,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737297403] [2025-01-09 03:50:45,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:50:45,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:50:45,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:50:45,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:50:45,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:50:45,689 INFO L87 Difference]: Start difference. First operand 301 states and 467 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-01-09 03:50:45,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:50:45,734 INFO L93 Difference]: Finished difference Result 579 states and 907 transitions. [2025-01-09 03:50:45,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:50:45,735 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 96 [2025-01-09 03:50:45,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:50:45,738 INFO L225 Difference]: With dead ends: 579 [2025-01-09 03:50:45,739 INFO L226 Difference]: Without dead ends: 303 [2025-01-09 03:50:45,739 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-01-09 03:50:45,740 INFO L435 NwaCegarLoop]: 378 mSDtfsCounter, 1 mSDsluCounter, 1116 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1494 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-01-09 03:50:45,740 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1494 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:50:45,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2025-01-09 03:50:45,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 303. [2025-01-09 03:50:45,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 234 states have (on average 1.5555555555555556) internal successors, (364), 240 states have internal predecessors, (364), 50 states have call successors, (50), 15 states have call predecessors, (50), 18 states have return successors, (59), 49 states have call predecessors, (59), 49 states have call successors, (59) [2025-01-09 03:50:45,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 473 transitions. [2025-01-09 03:50:45,755 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 473 transitions. Word has length 96 [2025-01-09 03:50:45,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:50:45,755 INFO L471 AbstractCegarLoop]: Abstraction has 303 states and 473 transitions. [2025-01-09 03:50:45,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-01-09 03:50:45,755 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 473 transitions. [2025-01-09 03:50:45,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-01-09 03:50:45,756 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:50:45,756 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:50:45,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 03:50:45,757 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:50:45,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:50:45,757 INFO L85 PathProgramCache]: Analyzing trace with hash 252458648, now seen corresponding path program 1 times [2025-01-09 03:50:45,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:50:45,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61706180] [2025-01-09 03:50:45,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:50:45,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:50:45,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-09 03:50:45,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-09 03:50:45,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:50:45,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:50:45,868 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 03:50:45,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:50:45,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61706180] [2025-01-09 03:50:45,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61706180] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:50:45,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:50:45,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:50:45,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795456125] [2025-01-09 03:50:45,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:50:45,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:50:45,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:50:45,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:50:45,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:50:45,870 INFO L87 Difference]: Start difference. First operand 303 states and 473 transitions. Second operand has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2025-01-09 03:50:45,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:50:45,904 INFO L93 Difference]: Finished difference Result 585 states and 917 transitions. [2025-01-09 03:50:45,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:50:45,904 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 97 [2025-01-09 03:50:45,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:50:45,906 INFO L225 Difference]: With dead ends: 585 [2025-01-09 03:50:45,906 INFO L226 Difference]: Without dead ends: 305 [2025-01-09 03:50:45,907 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-01-09 03:50:45,907 INFO L435 NwaCegarLoop]: 378 mSDtfsCounter, 1 mSDsluCounter, 1122 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1500 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-01-09 03:50:45,908 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1500 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:50:45,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2025-01-09 03:50:45,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 305. [2025-01-09 03:50:45,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 235 states have (on average 1.553191489361702) internal successors, (365), 242 states have internal predecessors, (365), 50 states have call successors, (50), 15 states have call predecessors, (50), 19 states have return successors, (61), 49 states have call predecessors, (61), 49 states have call successors, (61) [2025-01-09 03:50:45,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 476 transitions. [2025-01-09 03:50:45,924 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 476 transitions. Word has length 97 [2025-01-09 03:50:45,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:50:45,924 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 476 transitions. [2025-01-09 03:50:45,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2025-01-09 03:50:45,924 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 476 transitions. [2025-01-09 03:50:45,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-01-09 03:50:45,926 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:50:45,926 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:50:45,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 03:50:45,926 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:50:45,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:50:45,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1463990279, now seen corresponding path program 1 times [2025-01-09 03:50:45,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:50:45,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122484385] [2025-01-09 03:50:45,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:50:45,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:50:45,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 03:50:45,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 03:50:45,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:50:45,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:50:46,054 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:50:46,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:50:46,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122484385] [2025-01-09 03:50:46,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122484385] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:50:46,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [417541532] [2025-01-09 03:50:46,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:50:46,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:50:46,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:50:46,057 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:50:46,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 03:50:46,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 03:50:46,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 03:50:46,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:50:46,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:50:46,252 INFO L256 TraceCheckSpWp]: Trace formula consists of 893 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 03:50:46,254 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:50:46,274 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:50:46,275 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:50:46,334 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:50:46,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [417541532] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:50:46,334 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 03:50:46,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-01-09 03:50:46,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374800766] [2025-01-09 03:50:46,334 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 03:50:46,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 03:50:46,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:50:46,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 03:50:46,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:50:46,335 INFO L87 Difference]: Start difference. First operand 305 states and 476 transitions. Second operand has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 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-01-09 03:50:46,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:50:46,453 INFO L93 Difference]: Finished difference Result 732 states and 1187 transitions. [2025-01-09 03:50:46,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:50:46,453 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 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 98 [2025-01-09 03:50:46,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:50:46,457 INFO L225 Difference]: With dead ends: 732 [2025-01-09 03:50:46,457 INFO L226 Difference]: Without dead ends: 626 [2025-01-09 03:50:46,458 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:50:46,458 INFO L435 NwaCegarLoop]: 421 mSDtfsCounter, 469 mSDsluCounter, 983 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 514 SdHoareTripleChecker+Valid, 1404 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:50:46,458 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [514 Valid, 1404 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:50:46,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2025-01-09 03:50:46,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 602. [2025-01-09 03:50:46,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 602 states, 468 states have (on average 1.6175213675213675) internal successors, (757), 475 states have internal predecessors, (757), 114 states have call successors, (114), 15 states have call predecessors, (114), 19 states have return successors, (135), 113 states have call predecessors, (135), 113 states have call successors, (135) [2025-01-09 03:50:46,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 1006 transitions. [2025-01-09 03:50:46,493 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 1006 transitions. Word has length 98 [2025-01-09 03:50:46,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:50:46,493 INFO L471 AbstractCegarLoop]: Abstraction has 602 states and 1006 transitions. [2025-01-09 03:50:46,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 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-01-09 03:50:46,494 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 1006 transitions. [2025-01-09 03:50:46,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-01-09 03:50:46,496 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:50:46,496 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:50:46,504 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-09 03:50:46,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:50:46,697 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:50:46,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:50:46,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1869184625, now seen corresponding path program 1 times [2025-01-09 03:50:46,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:50:46,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823703469] [2025-01-09 03:50:46,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:50:46,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:50:46,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 03:50:46,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 03:50:46,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:50:46,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:50:46,741 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:50:46,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:50:46,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823703469] [2025-01-09 03:50:46,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823703469] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:50:46,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:50:46,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:50:46,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486465347] [2025-01-09 03:50:46,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:50:46,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:50:46,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:50:46,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:50:46,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:50:46,742 INFO L87 Difference]: Start difference. First operand 602 states and 1006 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 03:50:46,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:50:46,765 INFO L93 Difference]: Finished difference Result 1439 states and 2439 transitions. [2025-01-09 03:50:46,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:50:46,765 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 105 [2025-01-09 03:50:46,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:50:46,769 INFO L225 Difference]: With dead ends: 1439 [2025-01-09 03:50:46,769 INFO L226 Difference]: Without dead ends: 903 [2025-01-09 03:50:46,771 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:50:46,771 INFO L435 NwaCegarLoop]: 404 mSDtfsCounter, 97 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 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-01-09 03:50:46,771 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 785 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:50:46,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2025-01-09 03:50:46,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 895. [2025-01-09 03:50:46,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 895 states, 697 states have (on average 1.6284074605451937) internal successors, (1135), 704 states have internal predecessors, (1135), 178 states have call successors, (178), 15 states have call predecessors, (178), 19 states have return successors, (209), 177 states have call predecessors, (209), 177 states have call successors, (209) [2025-01-09 03:50:46,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 1522 transitions. [2025-01-09 03:50:46,801 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 1522 transitions. Word has length 105 [2025-01-09 03:50:46,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:50:46,802 INFO L471 AbstractCegarLoop]: Abstraction has 895 states and 1522 transitions. [2025-01-09 03:50:46,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 03:50:46,802 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1522 transitions. [2025-01-09 03:50:46,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-01-09 03:50:46,805 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:50:46,805 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:50:46,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 03:50:46,806 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:50:46,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:50:46,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1116479265, now seen corresponding path program 1 times [2025-01-09 03:50:46,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:50:46,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573483415] [2025-01-09 03:50:46,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:50:46,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:50:46,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-01-09 03:50:46,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-01-09 03:50:46,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:50:46,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:50:46,849 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:50:46,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:50:46,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573483415] [2025-01-09 03:50:46,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573483415] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:50:46,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:50:46,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:50:46,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986551149] [2025-01-09 03:50:46,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:50:46,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:50:46,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:50:46,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:50:46,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:50:46,851 INFO L87 Difference]: Start difference. First operand 895 states and 1522 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 03:50:46,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:50:46,884 INFO L93 Difference]: Finished difference Result 2137 states and 3651 transitions. [2025-01-09 03:50:46,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:50:46,884 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 106 [2025-01-09 03:50:46,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:50:46,891 INFO L225 Difference]: With dead ends: 2137 [2025-01-09 03:50:46,891 INFO L226 Difference]: Without dead ends: 1359 [2025-01-09 03:50:46,893 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:50:46,894 INFO L435 NwaCegarLoop]: 385 mSDtfsCounter, 95 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 762 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-01-09 03:50:46,894 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 762 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:50:46,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1359 states. [2025-01-09 03:50:46,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1359 to 1351. [2025-01-09 03:50:46,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1351 states, 1058 states have (on average 1.6351606805293006) internal successors, (1730), 1065 states have internal predecessors, (1730), 273 states have call successors, (273), 15 states have call predecessors, (273), 19 states have return successors, (304), 272 states have call predecessors, (304), 272 states have call successors, (304) [2025-01-09 03:50:46,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1351 states to 1351 states and 2307 transitions. [2025-01-09 03:50:46,963 INFO L78 Accepts]: Start accepts. Automaton has 1351 states and 2307 transitions. Word has length 106 [2025-01-09 03:50:46,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:50:46,964 INFO L471 AbstractCegarLoop]: Abstraction has 1351 states and 2307 transitions. [2025-01-09 03:50:46,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 03:50:46,964 INFO L276 IsEmpty]: Start isEmpty. Operand 1351 states and 2307 transitions. [2025-01-09 03:50:46,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-01-09 03:50:46,969 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:50:46,970 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:50:46,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 03:50:46,970 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:50:46,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:50:46,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1351966931, now seen corresponding path program 1 times [2025-01-09 03:50:46,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:50:46,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447909234] [2025-01-09 03:50:46,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:50:46,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:50:46,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-09 03:50:46,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-09 03:50:46,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:50:46,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:50:47,018 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:50:47,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:50:47,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447909234] [2025-01-09 03:50:47,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447909234] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:50:47,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:50:47,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:50:47,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369953950] [2025-01-09 03:50:47,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:50:47,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:50:47,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:50:47,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:50:47,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:50:47,019 INFO L87 Difference]: Start difference. First operand 1351 states and 2307 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 03:50:47,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:50:47,076 INFO L93 Difference]: Finished difference Result 3156 states and 5430 transitions. [2025-01-09 03:50:47,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:50:47,076 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 107 [2025-01-09 03:50:47,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:50:47,087 INFO L225 Difference]: With dead ends: 3156 [2025-01-09 03:50:47,088 INFO L226 Difference]: Without dead ends: 2043 [2025-01-09 03:50:47,093 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:50:47,093 INFO L435 NwaCegarLoop]: 383 mSDtfsCounter, 93 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 757 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-01-09 03:50:47,094 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 757 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:50:47,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2043 states. [2025-01-09 03:50:47,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2043 to 2035. [2025-01-09 03:50:47,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2035 states, 1619 states have (on average 1.641136504014824) internal successors, (2657), 1626 states have internal predecessors, (2657), 396 states have call successors, (396), 15 states have call predecessors, (396), 19 states have return successors, (443), 395 states have call predecessors, (443), 395 states have call successors, (443) [2025-01-09 03:50:47,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2035 states to 2035 states and 3496 transitions. [2025-01-09 03:50:47,191 INFO L78 Accepts]: Start accepts. Automaton has 2035 states and 3496 transitions. Word has length 107 [2025-01-09 03:50:47,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:50:47,191 INFO L471 AbstractCegarLoop]: Abstraction has 2035 states and 3496 transitions. [2025-01-09 03:50:47,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 03:50:47,192 INFO L276 IsEmpty]: Start isEmpty. Operand 2035 states and 3496 transitions. [2025-01-09 03:50:47,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-01-09 03:50:47,198 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:50:47,198 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:50:47,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 03:50:47,199 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:50:47,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:50:47,199 INFO L85 PathProgramCache]: Analyzing trace with hash -629432160, now seen corresponding path program 1 times [2025-01-09 03:50:47,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:50:47,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643525051] [2025-01-09 03:50:47,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:50:47,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:50:47,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 03:50:47,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 03:50:47,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:50:47,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:50:47,243 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:50:47,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:50:47,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643525051] [2025-01-09 03:50:47,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643525051] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:50:47,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:50:47,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:50:47,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069214241] [2025-01-09 03:50:47,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:50:47,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:50:47,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:50:47,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:50:47,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:50:47,245 INFO L87 Difference]: Start difference. First operand 2035 states and 3496 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 03:50:47,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:50:47,322 INFO L93 Difference]: Finished difference Result 4729 states and 8181 transitions. [2025-01-09 03:50:47,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:50:47,322 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 108 [2025-01-09 03:50:47,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:50:47,354 INFO L225 Difference]: With dead ends: 4729 [2025-01-09 03:50:47,354 INFO L226 Difference]: Without dead ends: 3129 [2025-01-09 03:50:47,358 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:50:47,359 INFO L435 NwaCegarLoop]: 383 mSDtfsCounter, 91 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 757 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-01-09 03:50:47,359 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 757 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:50:47,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3129 states. [2025-01-09 03:50:47,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3129 to 3121. [2025-01-09 03:50:47,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3121 states, 2526 states have (on average 1.644893111638955) internal successors, (4155), 2533 states have internal predecessors, (4155), 575 states have call successors, (575), 15 states have call predecessors, (575), 19 states have return successors, (648), 574 states have call predecessors, (648), 574 states have call successors, (648) [2025-01-09 03:50:47,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 5378 transitions. [2025-01-09 03:50:47,539 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 5378 transitions. Word has length 108 [2025-01-09 03:50:47,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:50:47,539 INFO L471 AbstractCegarLoop]: Abstraction has 3121 states and 5378 transitions. [2025-01-09 03:50:47,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 03:50:47,539 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 5378 transitions. [2025-01-09 03:50:47,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-01-09 03:50:47,548 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:50:47,548 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:50:47,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 03:50:47,549 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:50:47,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:50:47,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1613572849, now seen corresponding path program 1 times [2025-01-09 03:50:47,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:50:47,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968137050] [2025-01-09 03:50:47,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:50:47,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:50:47,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 03:50:47,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 03:50:47,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:50:47,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:50:47,604 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:50:47,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:50:47,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968137050] [2025-01-09 03:50:47,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968137050] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:50:47,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:50:47,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:50:47,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222630575] [2025-01-09 03:50:47,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:50:47,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:50:47,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:50:47,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:50:47,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:50:47,606 INFO L87 Difference]: Start difference. First operand 3121 states and 5378 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 03:50:47,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:50:47,733 INFO L93 Difference]: Finished difference Result 7570 states and 13103 transitions. [2025-01-09 03:50:47,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:50:47,733 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 109 [2025-01-09 03:50:47,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:50:47,757 INFO L225 Difference]: With dead ends: 7570 [2025-01-09 03:50:47,757 INFO L226 Difference]: Without dead ends: 5105 [2025-01-09 03:50:47,765 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:50:47,765 INFO L435 NwaCegarLoop]: 401 mSDtfsCounter, 89 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 783 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-01-09 03:50:47,766 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 783 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:50:47,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5105 states. [2025-01-09 03:50:47,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5105 to 5097. [2025-01-09 03:50:47,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5097 states, 4126 states have (on average 1.6364517692680562) internal successors, (6752), 4133 states have internal predecessors, (6752), 951 states have call successors, (951), 15 states have call predecessors, (951), 19 states have return successors, (1068), 950 states have call predecessors, (1068), 950 states have call successors, (1068) [2025-01-09 03:50:47,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5097 states to 5097 states and 8771 transitions. [2025-01-09 03:50:47,993 INFO L78 Accepts]: Start accepts. Automaton has 5097 states and 8771 transitions. Word has length 109 [2025-01-09 03:50:47,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:50:47,994 INFO L471 AbstractCegarLoop]: Abstraction has 5097 states and 8771 transitions. [2025-01-09 03:50:47,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 03:50:47,994 INFO L276 IsEmpty]: Start isEmpty. Operand 5097 states and 8771 transitions. [2025-01-09 03:50:48,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 03:50:48,005 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:50:48,005 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:50:48,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 03:50:48,006 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:50:48,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:50:48,006 INFO L85 PathProgramCache]: Analyzing trace with hash 391598300, now seen corresponding path program 1 times [2025-01-09 03:50:48,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:50:48,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029232448] [2025-01-09 03:50:48,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:50:48,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:50:48,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 03:50:48,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 03:50:48,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:50:48,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:50:48,047 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:50:48,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:50:48,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029232448] [2025-01-09 03:50:48,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029232448] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:50:48,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:50:48,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:50:48,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947648956] [2025-01-09 03:50:48,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:50:48,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:50:48,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:50:48,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:50:48,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:50:48,049 INFO L87 Difference]: Start difference. First operand 5097 states and 8771 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 03:50:48,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:50:48,235 INFO L93 Difference]: Finished difference Result 12579 states and 21768 transitions. [2025-01-09 03:50:48,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:50:48,236 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 110 [2025-01-09 03:50:48,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:50:48,279 INFO L225 Difference]: With dead ends: 12579 [2025-01-09 03:50:48,280 INFO L226 Difference]: Without dead ends: 8499 [2025-01-09 03:50:48,293 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:50:48,294 INFO L435 NwaCegarLoop]: 383 mSDtfsCounter, 87 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 760 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-01-09 03:50:48,294 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 760 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:50:48,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8499 states. [2025-01-09 03:50:48,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8499 to 8491. [2025-01-09 03:50:48,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8491 states, 6914 states have (on average 1.6332079838009834) internal successors, (11292), 6921 states have internal predecessors, (11292), 1557 states have call successors, (1557), 15 states have call predecessors, (1557), 19 states have return successors, (1752), 1556 states have call predecessors, (1752), 1556 states have call successors, (1752) [2025-01-09 03:50:48,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8491 states to 8491 states and 14601 transitions. [2025-01-09 03:50:48,706 INFO L78 Accepts]: Start accepts. Automaton has 8491 states and 14601 transitions. Word has length 110 [2025-01-09 03:50:48,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:50:48,707 INFO L471 AbstractCegarLoop]: Abstraction has 8491 states and 14601 transitions. [2025-01-09 03:50:48,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 03:50:48,707 INFO L276 IsEmpty]: Start isEmpty. Operand 8491 states and 14601 transitions. [2025-01-09 03:50:48,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-01-09 03:50:48,723 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:50:48,724 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:50:48,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 03:50:48,724 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:50:48,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:50:48,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1977266863, now seen corresponding path program 1 times [2025-01-09 03:50:48,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:50:48,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736163500] [2025-01-09 03:50:48,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:50:48,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:50:48,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 03:50:48,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 03:50:48,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:50:48,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:50:48,775 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:50:48,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:50:48,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736163500] [2025-01-09 03:50:48,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736163500] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:50:48,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:50:48,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:50:48,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808489503] [2025-01-09 03:50:48,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:50:48,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:50:48,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:50:48,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:50:48,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:50:48,777 INFO L87 Difference]: Start difference. First operand 8491 states and 14601 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 03:50:49,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:50:49,076 INFO L93 Difference]: Finished difference Result 22000 states and 37955 transitions. [2025-01-09 03:50:49,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:50:49,077 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 111 [2025-01-09 03:50:49,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:50:49,136 INFO L225 Difference]: With dead ends: 22000 [2025-01-09 03:50:49,136 INFO L226 Difference]: Without dead ends: 14926 [2025-01-09 03:50:49,165 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:50:49,166 INFO L435 NwaCegarLoop]: 391 mSDtfsCounter, 85 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 771 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-01-09 03:50:49,166 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 771 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:50:49,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14926 states. [2025-01-09 03:50:49,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14926 to 14918. [2025-01-09 03:50:49,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14918 states, 12138 states have (on average 1.6223430548690063) internal successors, (19692), 12145 states have internal predecessors, (19692), 2760 states have call successors, (2760), 15 states have call predecessors, (2760), 19 states have return successors, (3099), 2759 states have call predecessors, (3099), 2759 states have call successors, (3099) [2025-01-09 03:50:49,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14918 states to 14918 states and 25551 transitions. [2025-01-09 03:50:49,743 INFO L78 Accepts]: Start accepts. Automaton has 14918 states and 25551 transitions. Word has length 111 [2025-01-09 03:50:49,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:50:49,744 INFO L471 AbstractCegarLoop]: Abstraction has 14918 states and 25551 transitions. [2025-01-09 03:50:49,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 03:50:49,744 INFO L276 IsEmpty]: Start isEmpty. Operand 14918 states and 25551 transitions. [2025-01-09 03:50:49,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-01-09 03:50:49,764 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:50:49,764 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:50:49,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 03:50:49,764 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:50:49,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:50:49,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1835590331, now seen corresponding path program 1 times [2025-01-09 03:50:49,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:50:49,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501861585] [2025-01-09 03:50:49,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:50:49,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:50:49,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 03:50:49,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 03:50:49,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:50:49,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:50:49,810 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:50:49,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:50:49,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501861585] [2025-01-09 03:50:49,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501861585] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:50:49,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:50:49,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:50:49,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188063013] [2025-01-09 03:50:49,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:50:49,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:50:49,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:50:49,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:50:49,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:50:49,812 INFO L87 Difference]: Start difference. First operand 14918 states and 25551 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 03:50:50,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:50:50,502 INFO L93 Difference]: Finished difference Result 39516 states and 67958 transitions. [2025-01-09 03:50:50,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:50:50,503 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 112 [2025-01-09 03:50:50,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:50:50,628 INFO L225 Difference]: With dead ends: 39516 [2025-01-09 03:50:50,628 INFO L226 Difference]: Without dead ends: 26593 [2025-01-09 03:50:50,690 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:50:50,691 INFO L435 NwaCegarLoop]: 383 mSDtfsCounter, 83 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 760 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-01-09 03:50:50,691 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 760 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:50:50,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26593 states. [2025-01-09 03:50:51,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26593 to 26585. [2025-01-09 03:50:51,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26585 states, 21766 states have (on average 1.61706330974915) internal successors, (35197), 21773 states have internal predecessors, (35197), 4799 states have call successors, (4799), 15 states have call predecessors, (4799), 19 states have return successors, (5412), 4798 states have call predecessors, (5412), 4798 states have call successors, (5412) [2025-01-09 03:50:51,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26585 states to 26585 states and 45408 transitions. [2025-01-09 03:50:51,690 INFO L78 Accepts]: Start accepts. Automaton has 26585 states and 45408 transitions. Word has length 112 [2025-01-09 03:50:51,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:50:51,690 INFO L471 AbstractCegarLoop]: Abstraction has 26585 states and 45408 transitions. [2025-01-09 03:50:51,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 03:50:51,690 INFO L276 IsEmpty]: Start isEmpty. Operand 26585 states and 45408 transitions. [2025-01-09 03:50:51,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-01-09 03:50:51,711 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:50:51,711 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:50:51,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 03:50:51,711 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:50:51,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:50:51,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1439989261, now seen corresponding path program 1 times [2025-01-09 03:50:51,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:50:51,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23327066] [2025-01-09 03:50:51,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:50:51,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:50:51,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-01-09 03:50:51,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-01-09 03:50:51,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:50:51,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:50:51,841 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:50:51,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:50:51,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23327066] [2025-01-09 03:50:51,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23327066] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:50:51,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:50:51,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:50:51,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302142779] [2025-01-09 03:50:51,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:50:51,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:50:51,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:50:51,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:50:51,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:50:51,843 INFO L87 Difference]: Start difference. First operand 26585 states and 45408 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 03:50:52,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:50:52,605 INFO L93 Difference]: Finished difference Result 72468 states and 124190 transitions. [2025-01-09 03:50:52,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:50:52,606 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 113 [2025-01-09 03:50:52,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:50:52,807 INFO L225 Difference]: With dead ends: 72468 [2025-01-09 03:50:52,807 INFO L226 Difference]: Without dead ends: 48573 [2025-01-09 03:50:52,889 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:50:52,890 INFO L435 NwaCegarLoop]: 385 mSDtfsCounter, 81 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 762 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-01-09 03:50:52,890 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 762 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:50:52,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48573 states. [2025-01-09 03:50:54,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48573 to 48565. [2025-01-09 03:50:54,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48565 states, 40031 states have (on average 1.6104768804176763) internal successors, (64469), 40038 states have internal predecessors, (64469), 8514 states have call successors, (8514), 15 states have call predecessors, (8514), 19 states have return successors, (9659), 8513 states have call predecessors, (9659), 8513 states have call successors, (9659) [2025-01-09 03:50:54,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48565 states to 48565 states and 82642 transitions. [2025-01-09 03:50:54,923 INFO L78 Accepts]: Start accepts. Automaton has 48565 states and 82642 transitions. Word has length 113 [2025-01-09 03:50:54,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:50:54,923 INFO L471 AbstractCegarLoop]: Abstraction has 48565 states and 82642 transitions. [2025-01-09 03:50:54,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 03:50:54,923 INFO L276 IsEmpty]: Start isEmpty. Operand 48565 states and 82642 transitions. [2025-01-09 03:50:54,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-01-09 03:50:54,945 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:50:54,945 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:50:54,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 03:50:54,945 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:50:54,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:50:54,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1423447397, now seen corresponding path program 1 times [2025-01-09 03:50:54,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:50:54,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120180410] [2025-01-09 03:50:54,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:50:54,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:50:54,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-01-09 03:50:54,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-01-09 03:50:54,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:50:54,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:50:54,996 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:50:54,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:50:54,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120180410] [2025-01-09 03:50:54,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120180410] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:50:54,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:50:54,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:50:54,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618163674] [2025-01-09 03:50:54,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:50:54,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:50:54,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:50:54,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:50:54,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:50:54,999 INFO L87 Difference]: Start difference. First operand 48565 states and 82642 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 03:50:56,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:50:56,345 INFO L93 Difference]: Finished difference Result 90435 states and 154233 transitions. [2025-01-09 03:50:56,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:50:56,345 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 114 [2025-01-09 03:50:56,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:50:56,756 INFO L225 Difference]: With dead ends: 90435 [2025-01-09 03:50:56,756 INFO L226 Difference]: Without dead ends: 90329 [2025-01-09 03:50:56,810 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:50:56,810 INFO L435 NwaCegarLoop]: 392 mSDtfsCounter, 76 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 774 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:50:56,810 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 774 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:50:56,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90329 states. [2025-01-09 03:50:59,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90329 to 90321. [2025-01-09 03:51:00,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90321 states, 74988 states have (on average 1.6024830639568999) internal successors, (120167), 74995 states have internal predecessors, (120167), 15313 states have call successors, (15313), 15 states have call predecessors, (15313), 19 states have return successors, (17504), 15312 states have call predecessors, (17504), 15312 states have call successors, (17504) [2025-01-09 03:51:00,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90321 states to 90321 states and 152984 transitions. [2025-01-09 03:51:00,337 INFO L78 Accepts]: Start accepts. Automaton has 90321 states and 152984 transitions. Word has length 114 [2025-01-09 03:51:00,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:51:00,337 INFO L471 AbstractCegarLoop]: Abstraction has 90321 states and 152984 transitions. [2025-01-09 03:51:00,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 03:51:00,337 INFO L276 IsEmpty]: Start isEmpty. Operand 90321 states and 152984 transitions. [2025-01-09 03:51:00,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-01-09 03:51:00,356 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:51:00,356 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:51:00,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 03:51:00,357 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:51:00,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:51:00,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1239220398, now seen corresponding path program 1 times [2025-01-09 03:51:00,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:51:00,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033721038] [2025-01-09 03:51:00,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:51:00,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:51:00,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-01-09 03:51:00,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-01-09 03:51:00,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:51:00,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:51:00,552 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:51:00,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:51:00,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033721038] [2025-01-09 03:51:00,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033721038] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:51:00,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:51:00,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 03:51:00,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143200932] [2025-01-09 03:51:00,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:51:00,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 03:51:00,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:51:00,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 03:51:00,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-01-09 03:51:00,554 INFO L87 Difference]: Start difference. First operand 90321 states and 152984 transitions. Second operand has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 9 states have internal predecessors, (80), 5 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2025-01-09 03:51:05,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:51:05,026 INFO L93 Difference]: Finished difference Result 179995 states and 310361 transitions. [2025-01-09 03:51:05,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 03:51:05,027 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 9 states have internal predecessors, (80), 5 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 115 [2025-01-09 03:51:05,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:51:05,943 INFO L225 Difference]: With dead ends: 179995 [2025-01-09 03:51:05,943 INFO L226 Difference]: Without dead ends: 179897 [2025-01-09 03:51:06,028 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=98, Invalid=364, Unknown=0, NotChecked=0, Total=462 [2025-01-09 03:51:06,028 INFO L435 NwaCegarLoop]: 470 mSDtfsCounter, 968 mSDsluCounter, 3525 mSDsCounter, 0 mSdLazyCounter, 698 mSolverCounterSat, 235 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 968 SdHoareTripleChecker+Valid, 3995 SdHoareTripleChecker+Invalid, 933 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 235 IncrementalHoareTripleChecker+Valid, 698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 03:51:06,029 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [968 Valid, 3995 Invalid, 933 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [235 Valid, 698 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 03:51:06,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179897 states. [2025-01-09 03:51:12,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179897 to 179869. [2025-01-09 03:51:12,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179869 states, 149416 states have (on average 1.603375809819564) internal successors, (239570), 149318 states have internal predecessors, (239570), 30409 states have call successors, (30409), 38 states have call predecessors, (30409), 43 states have return successors, (38058), 30518 states have call predecessors, (38058), 30406 states have call successors, (38058) [2025-01-09 03:51:13,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179869 states to 179869 states and 308037 transitions. [2025-01-09 03:51:13,762 INFO L78 Accepts]: Start accepts. Automaton has 179869 states and 308037 transitions. Word has length 115 [2025-01-09 03:51:13,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:51:13,763 INFO L471 AbstractCegarLoop]: Abstraction has 179869 states and 308037 transitions. [2025-01-09 03:51:13,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 9 states have internal predecessors, (80), 5 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2025-01-09 03:51:13,763 INFO L276 IsEmpty]: Start isEmpty. Operand 179869 states and 308037 transitions. [2025-01-09 03:51:13,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-01-09 03:51:13,805 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:51:13,805 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:51:13,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 03:51:13,806 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:51:13,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:51:13,806 INFO L85 PathProgramCache]: Analyzing trace with hash -502625625, now seen corresponding path program 1 times [2025-01-09 03:51:13,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:51:13,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822023467] [2025-01-09 03:51:13,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:51:13,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:51:13,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-09 03:51:13,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-09 03:51:13,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:51:13,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:51:13,941 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:51:13,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:51:13,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822023467] [2025-01-09 03:51:13,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822023467] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:51:13,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:51:13,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 03:51:13,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720496765] [2025-01-09 03:51:13,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:51:13,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 03:51:13,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:51:13,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 03:51:13,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:51:13,943 INFO L87 Difference]: Start difference. First operand 179869 states and 308037 transitions. Second operand has 8 states, 8 states have (on average 10.125) internal successors, (81), 6 states have internal predecessors, (81), 4 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2025-01-09 03:51:17,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:51:17,701 INFO L93 Difference]: Finished difference Result 180313 states and 308685 transitions. [2025-01-09 03:51:17,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 03:51:17,702 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 6 states have internal predecessors, (81), 4 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 116 [2025-01-09 03:51:17,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:51:18,463 INFO L225 Difference]: With dead ends: 180313 [2025-01-09 03:51:18,463 INFO L226 Difference]: Without dead ends: 179937 [2025-01-09 03:51:18,548 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2025-01-09 03:51:18,548 INFO L435 NwaCegarLoop]: 359 mSDtfsCounter, 479 mSDsluCounter, 1768 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 480 SdHoareTripleChecker+Valid, 2127 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:51:18,549 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [480 Valid, 2127 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:51:18,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179937 states.