./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec1_product33.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/email_spec1_product33.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 00f3978296386b105e45bba586b0df56f2d34b783492fc63d6fdcb596a8910f4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 14:21:44,764 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 14:21:44,822 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 14:21:44,826 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 14:21:44,826 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 14:21:44,838 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 14:21:44,839 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 14:21:44,839 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 14:21:44,839 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 14:21:44,839 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 14:21:44,839 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 14:21:44,839 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 14:21:44,839 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 14:21:44,839 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 14:21:44,840 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 14:21:44,840 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 14:21:44,840 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 14:21:44,840 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 14:21:44,840 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 14:21:44,840 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 14:21:44,840 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 14:21:44,840 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 14:21:44,840 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 14:21:44,840 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 14:21:44,840 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 14:21:44,840 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 14:21:44,840 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 14:21:44,840 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 14:21:44,840 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 14:21:44,840 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 14:21:44,840 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 14:21:44,840 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 14:21:44,841 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:21:44,841 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 14:21:44,841 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 14:21:44,841 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 14:21:44,841 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 14:21:44,841 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 14:21:44,841 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 14:21:44,841 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 14:21:44,841 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 14:21:44,841 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 14:21:44,841 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 14:21:44,841 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 00f3978296386b105e45bba586b0df56f2d34b783492fc63d6fdcb596a8910f4 [2025-03-03 14:21:45,031 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 14:21:45,038 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 14:21:45,040 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 14:21:45,043 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 14:21:45,043 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 14:21:45,045 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec1_product33.cil.c [2025-03-03 14:21:46,148 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc953bb25/34645d8e850c44cca11bbb0cc0f1f513/FLAG6f3a53ba1 [2025-03-03 14:21:46,461 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 14:21:46,462 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec1_product33.cil.c [2025-03-03 14:21:46,481 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc953bb25/34645d8e850c44cca11bbb0cc0f1f513/FLAG6f3a53ba1 [2025-03-03 14:21:46,723 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc953bb25/34645d8e850c44cca11bbb0cc0f1f513 [2025-03-03 14:21:46,725 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 14:21:46,726 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 14:21:46,727 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 14:21:46,727 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 14:21:46,730 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 14:21:46,731 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:21:46" (1/1) ... [2025-03-03 14:21:46,732 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f809624 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:21:46, skipping insertion in model container [2025-03-03 14:21:46,732 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:21:46" (1/1) ... [2025-03-03 14:21:46,773 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 14:21:46,887 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec1_product33.cil.c[1542,1555] [2025-03-03 14:21:47,156 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:21:47,166 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 14:21:47,171 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [48] [2025-03-03 14:21:47,172 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [57] [2025-03-03 14:21:47,172 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [75] [2025-03-03 14:21:47,172 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [234] [2025-03-03 14:21:47,172 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [600] [2025-03-03 14:21:47,173 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [829] [2025-03-03 14:21:47,173 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [867] [2025-03-03 14:21:47,173 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"AddressBookEncrypt_spec.i","") [1275] [2025-03-03 14:21:47,173 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [1303] [2025-03-03 14:21:47,173 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [2376] [2025-03-03 14:21:47,173 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [2661] [2025-03-03 14:21:47,175 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec1_product33.cil.c[1542,1555] [2025-03-03 14:21:47,265 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:21:47,286 INFO L204 MainTranslator]: Completed translation [2025-03-03 14:21:47,287 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:21:47 WrapperNode [2025-03-03 14:21:47,287 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 14:21:47,287 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 14:21:47,288 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 14:21:47,288 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 14:21:47,292 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:21:47" (1/1) ... [2025-03-03 14:21:47,307 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:21:47" (1/1) ... [2025-03-03 14:21:47,340 INFO L138 Inliner]: procedures = 134, calls = 212, calls flagged for inlining = 65, calls inlined = 60, statements flattened = 1076 [2025-03-03 14:21:47,340 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 14:21:47,341 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 14:21:47,341 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 14:21:47,341 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 14:21:47,347 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:21:47" (1/1) ... [2025-03-03 14:21:47,347 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:21:47" (1/1) ... [2025-03-03 14:21:47,352 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:21:47" (1/1) ... [2025-03-03 14:21:47,374 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 4, 4, 4]. 29 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 4, 4, 4]. The 0 writes are split as follows [0, 0, 0, 0]. [2025-03-03 14:21:47,375 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:21:47" (1/1) ... [2025-03-03 14:21:47,375 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:21:47" (1/1) ... [2025-03-03 14:21:47,387 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:21:47" (1/1) ... [2025-03-03 14:21:47,390 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:21:47" (1/1) ... [2025-03-03 14:21:47,394 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:21:47" (1/1) ... [2025-03-03 14:21:47,397 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:21:47" (1/1) ... [2025-03-03 14:21:47,403 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 14:21:47,403 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 14:21:47,403 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 14:21:47,403 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 14:21:47,404 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:21:47" (1/1) ... [2025-03-03 14:21:47,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:21:47,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:21:47,444 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 14:21:47,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 14:21:47,463 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2025-03-03 14:21:47,463 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2025-03-03 14:21:47,463 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2025-03-03 14:21:47,463 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2025-03-03 14:21:47,463 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2025-03-03 14:21:47,464 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2025-03-03 14:21:47,464 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-03-03 14:21:47,464 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-03-03 14:21:47,464 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-03-03 14:21:47,464 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-03-03 14:21:47,464 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2025-03-03 14:21:47,464 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2025-03-03 14:21:47,464 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-03-03 14:21:47,464 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-03-03 14:21:47,464 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2025-03-03 14:21:47,464 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2025-03-03 14:21:47,464 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2025-03-03 14:21:47,464 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2025-03-03 14:21:47,464 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-03-03 14:21:47,464 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-03-03 14:21:47,464 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-03-03 14:21:47,464 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-03-03 14:21:47,465 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2025-03-03 14:21:47,465 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2025-03-03 14:21:47,466 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-03-03 14:21:47,467 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-03-03 14:21:47,467 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 14:21:47,467 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2025-03-03 14:21:47,467 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2025-03-03 14:21:47,467 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2025-03-03 14:21:47,467 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2025-03-03 14:21:47,467 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-03-03 14:21:47,467 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-03-03 14:21:47,467 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-03-03 14:21:47,468 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-03-03 14:21:47,468 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-03-03 14:21:47,468 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-03-03 14:21:47,468 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2025-03-03 14:21:47,468 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2025-03-03 14:21:47,468 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-03-03 14:21:47,468 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-03-03 14:21:47,468 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2025-03-03 14:21:47,468 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2025-03-03 14:21:47,468 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-03-03 14:21:47,468 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-03-03 14:21:47,469 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-03-03 14:21:47,469 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-03-03 14:21:47,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 14:21:47,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 14:21:47,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-03 14:21:47,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-03 14:21:47,469 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-03-03 14:21:47,469 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-03-03 14:21:47,469 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 14:21:47,469 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 14:21:47,612 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 14:21:47,614 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 14:21:47,906 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2306-1: getClientForwardReceiver_#res#1 := getClientForwardReceiver_~retValue_acc~30#1; [2025-03-03 14:21:47,906 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1871-1: getClientAutoResponse_#res#1 := getClientAutoResponse_~retValue_acc~23#1; [2025-03-03 14:21:47,906 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2353-1: getClientId_#res#1 := getClientId_~retValue_acc~31#1; [2025-03-03 14:21:47,906 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3039-1: isVerified_#res#1 := isVerified_~retValue_acc~43#1; [2025-03-03 14:21:47,906 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2702-1: getEmailId_#res#1 := getEmailId_~retValue_acc~34#1; [2025-03-03 14:21:47,913 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2965: #res := ~retValue_acc~41; [2025-03-03 14:21:47,921 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1166: #res := ~retValue_acc~14; [2025-03-03 14:21:47,947 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2010: #res#1 := ~retValue_acc~26#1; [2025-03-03 14:21:47,947 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1965-1: getClientKeyringSize_#res#1 := getClientKeyringSize_~retValue_acc~25#1; [2025-03-03 14:21:47,964 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2234: #res := ~retValue_acc~29; [2025-03-03 14:21:47,970 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1918: #res := ~retValue_acc~24; [2025-03-03 14:21:47,977 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L231-1: createEmail_#res#1 := createEmail_~retValue_acc~4#1; [2025-03-03 14:21:47,985 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2891: #res := ~retValue_acc~39; [2025-03-03 14:21:47,993 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2928: #res := ~retValue_acc~40; [2025-03-03 14:21:47,998 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3002: #res := ~retValue_acc~42; [2025-03-03 14:21:48,014 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2776: #res := ~retValue_acc~36; [2025-03-03 14:21:48,207 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L864-1: valid_product_#res#1 := valid_product_~retValue_acc~9#1; [2025-03-03 14:21:48,207 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1123-1: is_queue_empty_#res#1 := is_queue_empty_~retValue_acc~11#1; [2025-03-03 14:21:48,207 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2180-1: getClientKeyringPublicKey_#res#1 := getClientKeyringPublicKey_~retValue_acc~28#1; [2025-03-03 14:21:48,207 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2073-1: getClientKeyringUser_#res#1 := getClientKeyringUser_~retValue_acc~27#1; [2025-03-03 14:21:48,207 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1132-1: get_queued_client_#res#1 := get_queued_client_~retValue_acc~12#1; [2025-03-03 14:21:48,207 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1141-1: get_queued_email_#res#1 := get_queued_email_~retValue_acc~13#1; [2025-03-03 14:21:48,212 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2739: #res := ~retValue_acc~35; [2025-03-03 14:21:48,220 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L207: #res#1 := ~retValue_acc~2#1; [2025-03-03 14:21:48,220 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L187-1: isReadable__wrappee__Keys_#res#1 := isReadable__wrappee__Keys_~retValue_acc~1#1; [2025-03-03 14:21:48,374 INFO L? ?]: Removed 500 outVars from TransFormulas that were not future-live. [2025-03-03 14:21:48,374 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 14:21:48,391 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 14:21:48,393 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 14:21:48,394 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:21:48 BoogieIcfgContainer [2025-03-03 14:21:48,394 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 14:21:48,395 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 14:21:48,396 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 14:21:48,399 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 14:21:48,399 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 02:21:46" (1/3) ... [2025-03-03 14:21:48,399 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57f5ef52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:21:48, skipping insertion in model container [2025-03-03 14:21:48,400 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:21:47" (2/3) ... [2025-03-03 14:21:48,400 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57f5ef52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:21:48, skipping insertion in model container [2025-03-03 14:21:48,401 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:21:48" (3/3) ... [2025-03-03 14:21:48,401 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec1_product33.cil.c [2025-03-03 14:21:48,412 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 14:21:48,416 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec1_product33.cil.c that has 25 procedures, 387 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 14:21:48,468 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 14:21:48,476 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;@29deacb4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 14:21:48,476 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 14:21:48,480 INFO L276 IsEmpty]: Start isEmpty. Operand has 387 states, 298 states have (on average 1.5) internal successors, (447), 302 states have internal predecessors, (447), 63 states have call successors, (63), 24 states have call predecessors, (63), 24 states have return successors, (63), 63 states have call predecessors, (63), 63 states have call successors, (63) [2025-03-03 14:21:48,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-03 14:21:48,489 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:21:48,490 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:21:48,490 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:21:48,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:21:48,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1044997078, now seen corresponding path program 1 times [2025-03-03 14:21:48,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:21:48,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442419510] [2025-03-03 14:21:48,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:21:48,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:21:48,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-03 14:21:48,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-03 14:21:48,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:21:48,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:21:49,020 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-03 14:21:49,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:21:49,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442419510] [2025-03-03 14:21:49,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442419510] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:21:49,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1264834767] [2025-03-03 14:21:49,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:21:49,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:21:49,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:21:49,024 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:21:49,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 14:21:49,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-03 14:21:49,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-03 14:21:49,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:21:49,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:21:49,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 1016 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 14:21:49,291 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:21:49,302 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-03 14:21:49,302 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:21:49,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1264834767] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:21:49,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:21:49,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 5 [2025-03-03 14:21:49,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737878851] [2025-03-03 14:21:49,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:21:49,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 14:21:49,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:21:49,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 14:21:49,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:21:49,322 INFO L87 Difference]: Start difference. First operand has 387 states, 298 states have (on average 1.5) internal successors, (447), 302 states have internal predecessors, (447), 63 states have call successors, (63), 24 states have call predecessors, (63), 24 states have return successors, (63), 63 states have call predecessors, (63), 63 states have call successors, (63) Second operand has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:21:49,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:21:49,371 INFO L93 Difference]: Finished difference Result 616 states and 894 transitions. [2025-03-03 14:21:49,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 14:21:49,373 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 101 [2025-03-03 14:21:49,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:21:49,381 INFO L225 Difference]: With dead ends: 616 [2025-03-03 14:21:49,383 INFO L226 Difference]: Without dead ends: 380 [2025-03-03 14:21:49,389 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:21:49,390 INFO L435 NwaCegarLoop]: 570 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:21:49,391 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 570 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:21:49,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2025-03-03 14:21:49,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 380. [2025-03-03 14:21:49,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 292 states have (on average 1.4965753424657535) internal successors, (437), 295 states have internal predecessors, (437), 63 states have call successors, (63), 24 states have call predecessors, (63), 24 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2025-03-03 14:21:49,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 562 transitions. [2025-03-03 14:21:49,445 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 562 transitions. Word has length 101 [2025-03-03 14:21:49,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:21:49,446 INFO L471 AbstractCegarLoop]: Abstraction has 380 states and 562 transitions. [2025-03-03 14:21:49,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:21:49,446 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 562 transitions. [2025-03-03 14:21:49,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-03 14:21:49,450 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:21:49,450 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:21:49,458 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 14:21:49,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 14:21:49,651 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:21:49,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:21:49,652 INFO L85 PathProgramCache]: Analyzing trace with hash 203638110, now seen corresponding path program 1 times [2025-03-03 14:21:49,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:21:49,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110878438] [2025-03-03 14:21:49,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:21:49,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:21:49,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-03 14:21:49,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-03 14:21:49,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:21:49,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:21:49,910 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-03 14:21:49,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:21:49,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110878438] [2025-03-03 14:21:49,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110878438] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:21:49,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [441860972] [2025-03-03 14:21:49,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:21:49,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:21:49,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:21:49,914 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:21:49,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 14:21:50,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-03 14:21:50,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-03 14:21:50,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:21:50,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:21:50,179 INFO L256 TraceCheckSpWp]: Trace formula consists of 1017 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 14:21:50,184 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:21:50,215 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-03 14:21:50,217 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:21:50,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [441860972] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:21:50,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:21:50,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 14:21:50,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504336678] [2025-03-03 14:21:50,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:21:50,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:21:50,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:21:50,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:21:50,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:21:50,221 INFO L87 Difference]: Start difference. First operand 380 states and 562 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:21:50,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:21:50,265 INFO L93 Difference]: Finished difference Result 605 states and 875 transitions. [2025-03-03 14:21:50,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:21:50,265 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 102 [2025-03-03 14:21:50,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:21:50,272 INFO L225 Difference]: With dead ends: 605 [2025-03-03 14:21:50,272 INFO L226 Difference]: Without dead ends: 382 [2025-03-03 14:21:50,273 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:21:50,273 INFO L435 NwaCegarLoop]: 561 mSDtfsCounter, 0 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1120 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:21:50,273 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1120 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:21:50,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2025-03-03 14:21:50,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2025-03-03 14:21:50,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 294 states have (on average 1.4931972789115646) internal successors, (439), 297 states have internal predecessors, (439), 63 states have call successors, (63), 24 states have call predecessors, (63), 24 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2025-03-03 14:21:50,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 564 transitions. [2025-03-03 14:21:50,300 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 564 transitions. Word has length 102 [2025-03-03 14:21:50,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:21:50,301 INFO L471 AbstractCegarLoop]: Abstraction has 382 states and 564 transitions. [2025-03-03 14:21:50,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:21:50,302 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 564 transitions. [2025-03-03 14:21:50,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-03 14:21:50,306 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:21:50,307 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:21:50,314 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 14:21:50,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-03 14:21:50,511 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:21:50,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:21:50,512 INFO L85 PathProgramCache]: Analyzing trace with hash -138899526, now seen corresponding path program 1 times [2025-03-03 14:21:50,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:21:50,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985244567] [2025-03-03 14:21:50,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:21:50,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:21:50,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-03 14:21:50,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-03 14:21:50,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:21:50,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:21:50,703 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-03 14:21:50,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:21:50,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985244567] [2025-03-03 14:21:50,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985244567] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:21:50,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [751318894] [2025-03-03 14:21:50,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:21:50,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:21:50,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:21:50,706 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:21:50,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 14:21:50,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-03 14:21:50,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-03 14:21:50,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:21:50,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:21:50,963 INFO L256 TraceCheckSpWp]: Trace formula consists of 1042 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:21:50,971 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:21:50,989 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-03 14:21:50,989 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:21:50,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [751318894] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:21:50,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:21:50,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 14:21:50,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798765943] [2025-03-03 14:21:50,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:21:50,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:21:50,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:21:50,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:21:50,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:21:50,993 INFO L87 Difference]: Start difference. First operand 382 states and 564 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:21:51,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:21:51,047 INFO L93 Difference]: Finished difference Result 798 states and 1194 transitions. [2025-03-03 14:21:51,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:21:51,050 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 110 [2025-03-03 14:21:51,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:21:51,053 INFO L225 Difference]: With dead ends: 798 [2025-03-03 14:21:51,054 INFO L226 Difference]: Without dead ends: 443 [2025-03-03 14:21:51,055 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:21:51,056 INFO L435 NwaCegarLoop]: 565 mSDtfsCounter, 115 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 1078 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:21:51,056 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 1078 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:21:51,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2025-03-03 14:21:51,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 435. [2025-03-03 14:21:51,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 435 states, 336 states have (on average 1.5119047619047619) internal successors, (508), 339 states have internal predecessors, (508), 74 states have call successors, (74), 24 states have call predecessors, (74), 24 states have return successors, (73), 73 states have call predecessors, (73), 73 states have call successors, (73) [2025-03-03 14:21:51,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 655 transitions. [2025-03-03 14:21:51,078 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 655 transitions. Word has length 110 [2025-03-03 14:21:51,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:21:51,078 INFO L471 AbstractCegarLoop]: Abstraction has 435 states and 655 transitions. [2025-03-03 14:21:51,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:21:51,078 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 655 transitions. [2025-03-03 14:21:51,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-03 14:21:51,080 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:21:51,080 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:21:51,088 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 14:21:51,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:21:51,282 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:21:51,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:21:51,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1722534860, now seen corresponding path program 1 times [2025-03-03 14:21:51,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:21:51,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192375773] [2025-03-03 14:21:51,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:21:51,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:21:51,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-03 14:21:51,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-03 14:21:51,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:21:51,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:21:51,430 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-03 14:21:51,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:21:51,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192375773] [2025-03-03 14:21:51,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192375773] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:21:51,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1965460502] [2025-03-03 14:21:51,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:21:51,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:21:51,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:21:51,433 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:21:51,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 14:21:51,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-03 14:21:51,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-03 14:21:51,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:21:51,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:21:51,660 INFO L256 TraceCheckSpWp]: Trace formula consists of 1047 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 14:21:51,664 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:21:51,715 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-03 14:21:51,716 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:21:51,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1965460502] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:21:51,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:21:51,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-03-03 14:21:51,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504807821] [2025-03-03 14:21:51,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:21:51,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:21:51,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:21:51,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:21:51,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:21:51,717 INFO L87 Difference]: Start difference. First operand 435 states and 655 transitions. Second operand has 5 states, 4 states have (on average 19.0) internal successors, (76), 5 states have internal predecessors, (76), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 14:21:51,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:21:51,772 INFO L93 Difference]: Finished difference Result 861 states and 1300 transitions. [2025-03-03 14:21:51,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:21:51,772 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.0) internal successors, (76), 5 states have internal predecessors, (76), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 111 [2025-03-03 14:21:51,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:21:51,775 INFO L225 Difference]: With dead ends: 861 [2025-03-03 14:21:51,775 INFO L226 Difference]: Without dead ends: 437 [2025-03-03 14:21:51,776 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:21:51,777 INFO L435 NwaCegarLoop]: 554 mSDtfsCounter, 2 mSDsluCounter, 1651 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2205 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:21:51,777 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2205 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:21:51,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2025-03-03 14:21:51,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 437. [2025-03-03 14:21:51,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 337 states have (on average 1.510385756676558) internal successors, (509), 341 states have internal predecessors, (509), 74 states have call successors, (74), 24 states have call predecessors, (74), 25 states have return successors, (75), 73 states have call predecessors, (75), 73 states have call successors, (75) [2025-03-03 14:21:51,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 658 transitions. [2025-03-03 14:21:51,798 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 658 transitions. Word has length 111 [2025-03-03 14:21:51,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:21:51,798 INFO L471 AbstractCegarLoop]: Abstraction has 437 states and 658 transitions. [2025-03-03 14:21:51,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.0) internal successors, (76), 5 states have internal predecessors, (76), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 14:21:51,798 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 658 transitions. [2025-03-03 14:21:51,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-03 14:21:51,800 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:21:51,800 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:21:51,808 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 14:21:52,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:21:52,001 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:21:52,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:21:52,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1805816082, now seen corresponding path program 1 times [2025-03-03 14:21:52,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:21:52,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575896962] [2025-03-03 14:21:52,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:21:52,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:21:52,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 14:21:52,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 14:21:52,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:21:52,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:21:52,166 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-03 14:21:52,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:21:52,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575896962] [2025-03-03 14:21:52,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575896962] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:21:52,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2097077874] [2025-03-03 14:21:52,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:21:52,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:21:52,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:21:52,169 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:21:52,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 14:21:52,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 14:21:52,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 14:21:52,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:21:52,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:21:52,449 INFO L256 TraceCheckSpWp]: Trace formula consists of 1048 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 14:21:52,452 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:21:52,489 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-03 14:21:52,489 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:21:52,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2097077874] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:21:52,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:21:52,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-03-03 14:21:52,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313336910] [2025-03-03 14:21:52,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:21:52,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:21:52,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:21:52,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:21:52,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:21:52,494 INFO L87 Difference]: Start difference. First operand 437 states and 658 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 14:21:52,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:21:52,568 INFO L93 Difference]: Finished difference Result 863 states and 1305 transitions. [2025-03-03 14:21:52,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:21:52,568 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 112 [2025-03-03 14:21:52,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:21:52,572 INFO L225 Difference]: With dead ends: 863 [2025-03-03 14:21:52,572 INFO L226 Difference]: Without dead ends: 439 [2025-03-03 14:21:52,573 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:21:52,574 INFO L435 NwaCegarLoop]: 552 mSDtfsCounter, 2 mSDsluCounter, 1639 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2191 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:21:52,574 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2191 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:21:52,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2025-03-03 14:21:52,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 439. [2025-03-03 14:21:52,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 338 states have (on average 1.5088757396449703) internal successors, (510), 343 states have internal predecessors, (510), 74 states have call successors, (74), 24 states have call predecessors, (74), 26 states have return successors, (80), 73 states have call predecessors, (80), 73 states have call successors, (80) [2025-03-03 14:21:52,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 664 transitions. [2025-03-03 14:21:52,593 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 664 transitions. Word has length 112 [2025-03-03 14:21:52,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:21:52,593 INFO L471 AbstractCegarLoop]: Abstraction has 439 states and 664 transitions. [2025-03-03 14:21:52,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 14:21:52,594 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 664 transitions. [2025-03-03 14:21:52,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-03 14:21:52,596 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:21:52,596 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:21:52,608 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-03 14:21:52,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:21:52,797 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:21:52,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:21:52,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1885631402, now seen corresponding path program 1 times [2025-03-03 14:21:52,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:21:52,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18097781] [2025-03-03 14:21:52,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:21:52,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:21:52,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-03 14:21:52,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-03 14:21:52,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:21:52,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:21:52,923 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-03 14:21:52,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:21:52,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18097781] [2025-03-03 14:21:52,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18097781] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:21:52,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:21:52,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:21:52,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247934696] [2025-03-03 14:21:52,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:21:52,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:21:52,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:21:52,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:21:52,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:21:52,925 INFO L87 Difference]: Start difference. First operand 439 states and 664 transitions. Second operand has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 states have internal predecessors, (74), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 14:21:52,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:21:52,966 INFO L93 Difference]: Finished difference Result 855 states and 1296 transitions. [2025-03-03 14:21:52,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:21:52,966 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 states have internal predecessors, (74), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 113 [2025-03-03 14:21:52,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:21:52,969 INFO L225 Difference]: With dead ends: 855 [2025-03-03 14:21:52,970 INFO L226 Difference]: Without dead ends: 439 [2025-03-03 14:21:52,971 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:21:52,973 INFO L435 NwaCegarLoop]: 555 mSDtfsCounter, 2 mSDsluCounter, 1654 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2209 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:21:52,973 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2209 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:21:52,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2025-03-03 14:21:52,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 439. [2025-03-03 14:21:52,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 338 states have (on average 1.5088757396449703) internal successors, (510), 343 states have internal predecessors, (510), 74 states have call successors, (74), 24 states have call predecessors, (74), 26 states have return successors, (79), 73 states have call predecessors, (79), 73 states have call successors, (79) [2025-03-03 14:21:52,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 663 transitions. [2025-03-03 14:21:52,995 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 663 transitions. Word has length 113 [2025-03-03 14:21:52,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:21:52,995 INFO L471 AbstractCegarLoop]: Abstraction has 439 states and 663 transitions. [2025-03-03 14:21:52,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 states have internal predecessors, (74), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 14:21:52,995 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 663 transitions. [2025-03-03 14:21:52,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-03 14:21:52,997 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:21:52,997 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:21:52,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 14:21:52,997 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:21:52,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:21:52,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1198447598, now seen corresponding path program 2 times [2025-03-03 14:21:52,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:21:52,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43164991] [2025-03-03 14:21:52,998 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 14:21:52,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:21:53,013 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 114 statements into 2 equivalence classes. [2025-03-03 14:21:53,026 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 114 of 114 statements. [2025-03-03 14:21:53,026 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 14:21:53,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:21:53,107 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-03 14:21:53,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:21:53,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43164991] [2025-03-03 14:21:53,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43164991] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:21:53,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:21:53,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:21:53,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543610371] [2025-03-03 14:21:53,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:21:53,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:21:53,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:21:53,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:21:53,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:21:53,108 INFO L87 Difference]: Start difference. First operand 439 states and 663 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 14:21:53,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:21:53,150 INFO L93 Difference]: Finished difference Result 853 states and 1291 transitions. [2025-03-03 14:21:53,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:21:53,151 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 114 [2025-03-03 14:21:53,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:21:53,153 INFO L225 Difference]: With dead ends: 853 [2025-03-03 14:21:53,153 INFO L226 Difference]: Without dead ends: 439 [2025-03-03 14:21:53,155 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:21:53,155 INFO L435 NwaCegarLoop]: 553 mSDtfsCounter, 2 mSDsluCounter, 1642 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2195 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:21:53,155 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2195 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:21:53,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2025-03-03 14:21:53,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 439. [2025-03-03 14:21:53,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 338 states have (on average 1.5088757396449703) internal successors, (510), 343 states have internal predecessors, (510), 74 states have call successors, (74), 24 states have call predecessors, (74), 26 states have return successors, (78), 73 states have call predecessors, (78), 73 states have call successors, (78) [2025-03-03 14:21:53,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 662 transitions. [2025-03-03 14:21:53,168 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 662 transitions. Word has length 114 [2025-03-03 14:21:53,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:21:53,168 INFO L471 AbstractCegarLoop]: Abstraction has 439 states and 662 transitions. [2025-03-03 14:21:53,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 14:21:53,169 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 662 transitions. [2025-03-03 14:21:53,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-03 14:21:53,170 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:21:53,170 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:21:53,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 14:21:53,170 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:21:53,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:21:53,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1962704652, now seen corresponding path program 3 times [2025-03-03 14:21:53,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:21:53,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81215385] [2025-03-03 14:21:53,171 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 14:21:53,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:21:53,200 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 115 statements into 3 equivalence classes. [2025-03-03 14:21:53,208 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 103 of 115 statements. [2025-03-03 14:21:53,208 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-03 14:21:53,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:21:53,271 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-03 14:21:53,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:21:53,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81215385] [2025-03-03 14:21:53,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81215385] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:21:53,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:21:53,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:21:53,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024899039] [2025-03-03 14:21:53,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:21:53,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:21:53,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:21:53,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:21:53,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:21:53,273 INFO L87 Difference]: Start difference. First operand 439 states and 662 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 14:21:53,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:21:53,317 INFO L93 Difference]: Finished difference Result 855 states and 1297 transitions. [2025-03-03 14:21:53,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:21:53,318 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 115 [2025-03-03 14:21:53,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:21:53,320 INFO L225 Difference]: With dead ends: 855 [2025-03-03 14:21:53,320 INFO L226 Difference]: Without dead ends: 441 [2025-03-03 14:21:53,321 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:21:53,322 INFO L435 NwaCegarLoop]: 556 mSDtfsCounter, 1 mSDsluCounter, 1650 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2206 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:21:53,322 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2206 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:21:53,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2025-03-03 14:21:53,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 441. [2025-03-03 14:21:53,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 339 states have (on average 1.5073746312684366) internal successors, (511), 345 states have internal predecessors, (511), 74 states have call successors, (74), 24 states have call predecessors, (74), 27 states have return successors, (83), 73 states have call predecessors, (83), 73 states have call successors, (83) [2025-03-03 14:21:53,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 668 transitions. [2025-03-03 14:21:53,339 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 668 transitions. Word has length 115 [2025-03-03 14:21:53,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:21:53,339 INFO L471 AbstractCegarLoop]: Abstraction has 441 states and 668 transitions. [2025-03-03 14:21:53,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 14:21:53,339 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 668 transitions. [2025-03-03 14:21:53,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-03 14:21:53,342 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:21:53,342 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:21:53,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 14:21:53,342 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:21:53,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:21:53,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1957874575, now seen corresponding path program 1 times [2025-03-03 14:21:53,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:21:53,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536116764] [2025-03-03 14:21:53,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:21:53,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:21:53,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-03 14:21:53,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-03 14:21:53,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:21:53,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:21:53,440 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-03 14:21:53,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:21:53,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536116764] [2025-03-03 14:21:53,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536116764] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:21:53,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:21:53,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:21:53,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91862063] [2025-03-03 14:21:53,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:21:53,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:21:53,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:21:53,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:21:53,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:21:53,442 INFO L87 Difference]: Start difference. First operand 441 states and 668 transitions. Second operand has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 14:21:53,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:21:53,476 INFO L93 Difference]: Finished difference Result 861 states and 1307 transitions. [2025-03-03 14:21:53,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:21:53,476 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 116 [2025-03-03 14:21:53,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:21:53,478 INFO L225 Difference]: With dead ends: 861 [2025-03-03 14:21:53,478 INFO L226 Difference]: Without dead ends: 443 [2025-03-03 14:21:53,480 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:21:53,480 INFO L435 NwaCegarLoop]: 556 mSDtfsCounter, 1 mSDsluCounter, 1656 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2212 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:21:53,480 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2212 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:21:53,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2025-03-03 14:21:53,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 443. [2025-03-03 14:21:53,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 340 states have (on average 1.5058823529411764) internal successors, (512), 347 states have internal predecessors, (512), 74 states have call successors, (74), 24 states have call predecessors, (74), 28 states have return successors, (85), 73 states have call predecessors, (85), 73 states have call successors, (85) [2025-03-03 14:21:53,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 671 transitions. [2025-03-03 14:21:53,494 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 671 transitions. Word has length 116 [2025-03-03 14:21:53,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:21:53,495 INFO L471 AbstractCegarLoop]: Abstraction has 443 states and 671 transitions. [2025-03-03 14:21:53,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 14:21:53,495 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 671 transitions. [2025-03-03 14:21:53,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-03 14:21:53,496 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:21:53,496 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:21:53,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 14:21:53,497 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:21:53,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:21:53,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1837156496, now seen corresponding path program 1 times [2025-03-03 14:21:53,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:21:53,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460115012] [2025-03-03 14:21:53,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:21:53,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:21:53,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-03 14:21:53,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-03 14:21:53,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:21:53,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:21:53,639 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-03 14:21:53,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:21:53,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460115012] [2025-03-03 14:21:53,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460115012] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:21:53,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [633695165] [2025-03-03 14:21:53,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:21:53,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:21:53,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:21:53,642 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:21:53,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 14:21:53,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-03 14:21:53,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-03 14:21:53,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:21:53,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:21:53,895 INFO L256 TraceCheckSpWp]: Trace formula consists of 1053 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:21:53,899 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:21:53,930 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:21:53,930 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:21:54,023 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:21:54,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [633695165] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:21:54,023 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:21:54,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 11 [2025-03-03 14:21:54,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714631966] [2025-03-03 14:21:54,023 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:21:54,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 14:21:54,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:21:54,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 14:21:54,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:21:54,025 INFO L87 Difference]: Start difference. First operand 443 states and 671 transitions. Second operand has 11 states, 10 states have (on average 12.8) internal successors, (128), 11 states have internal predecessors, (128), 4 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) [2025-03-03 14:21:54,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:21:54,594 INFO L93 Difference]: Finished difference Result 1231 states and 1947 transitions. [2025-03-03 14:21:54,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 14:21:54,594 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 12.8) internal successors, (128), 11 states have internal predecessors, (128), 4 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) Word has length 117 [2025-03-03 14:21:54,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:21:54,599 INFO L225 Difference]: With dead ends: 1231 [2025-03-03 14:21:54,599 INFO L226 Difference]: Without dead ends: 817 [2025-03-03 14:21:54,602 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=400, Unknown=0, NotChecked=0, Total=506 [2025-03-03 14:21:54,602 INFO L435 NwaCegarLoop]: 556 mSDtfsCounter, 1238 mSDsluCounter, 3839 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1238 SdHoareTripleChecker+Valid, 4395 SdHoareTripleChecker+Invalid, 621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 14:21:54,602 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1238 Valid, 4395 Invalid, 621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 526 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 14:21:54,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 817 states. [2025-03-03 14:21:54,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 817 to 793. [2025-03-03 14:21:54,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 793 states, 626 states have (on average 1.5654952076677315) internal successors, (980), 632 states have internal predecessors, (980), 138 states have call successors, (138), 25 states have call predecessors, (138), 28 states have return successors, (159), 137 states have call predecessors, (159), 137 states have call successors, (159) [2025-03-03 14:21:54,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 1277 transitions. [2025-03-03 14:21:54,638 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 1277 transitions. Word has length 117 [2025-03-03 14:21:54,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:21:54,639 INFO L471 AbstractCegarLoop]: Abstraction has 793 states and 1277 transitions. [2025-03-03 14:21:54,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 12.8) internal successors, (128), 11 states have internal predecessors, (128), 4 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) [2025-03-03 14:21:54,639 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 1277 transitions. [2025-03-03 14:21:54,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-03 14:21:54,642 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:21:54,642 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:21:54,650 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-03 14:21:54,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:21:54,843 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:21:54,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:21:54,844 INFO L85 PathProgramCache]: Analyzing trace with hash 471241055, now seen corresponding path program 1 times [2025-03-03 14:21:54,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:21:54,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564517879] [2025-03-03 14:21:54,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:21:54,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:21:54,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-03 14:21:54,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-03 14:21:54,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:21:54,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:21:54,903 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:21:54,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:21:54,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564517879] [2025-03-03 14:21:54,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564517879] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:21:54,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:21:54,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:21:54,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979173477] [2025-03-03 14:21:54,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:21:54,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:21:54,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:21:54,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:21:54,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:21:54,905 INFO L87 Difference]: Start difference. First operand 793 states and 1277 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:21:54,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:21:54,939 INFO L93 Difference]: Finished difference Result 1836 states and 3007 transitions. [2025-03-03 14:21:54,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:21:54,939 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 120 [2025-03-03 14:21:54,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:21:54,945 INFO L225 Difference]: With dead ends: 1836 [2025-03-03 14:21:54,945 INFO L226 Difference]: Without dead ends: 1121 [2025-03-03 14:21:54,947 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:21:54,948 INFO L435 NwaCegarLoop]: 582 mSDtfsCounter, 112 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 1136 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:21:54,948 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 1136 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:21:54,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1121 states. [2025-03-03 14:21:54,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1121 to 1113. [2025-03-03 14:21:54,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1113 states, 882 states have (on average 1.5873015873015872) internal successors, (1400), 888 states have internal predecessors, (1400), 202 states have call successors, (202), 25 states have call predecessors, (202), 28 states have return successors, (233), 201 states have call predecessors, (233), 201 states have call successors, (233) [2025-03-03 14:21:54,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1113 states to 1113 states and 1835 transitions. [2025-03-03 14:21:54,989 INFO L78 Accepts]: Start accepts. Automaton has 1113 states and 1835 transitions. Word has length 120 [2025-03-03 14:21:54,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:21:54,990 INFO L471 AbstractCegarLoop]: Abstraction has 1113 states and 1835 transitions. [2025-03-03 14:21:54,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:21:54,990 INFO L276 IsEmpty]: Start isEmpty. Operand 1113 states and 1835 transitions. [2025-03-03 14:21:54,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-03 14:21:54,994 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:21:54,994 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:21:54,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 14:21:54,994 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:21:54,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:21:54,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1771648536, now seen corresponding path program 1 times [2025-03-03 14:21:54,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:21:54,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884591599] [2025-03-03 14:21:54,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:21:54,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:21:55,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-03 14:21:55,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-03 14:21:55,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:21:55,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:21:55,042 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:21:55,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:21:55,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884591599] [2025-03-03 14:21:55,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884591599] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:21:55,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:21:55,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:21:55,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664166964] [2025-03-03 14:21:55,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:21:55,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:21:55,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:21:55,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:21:55,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:21:55,043 INFO L87 Difference]: Start difference. First operand 1113 states and 1835 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:21:55,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:21:55,125 INFO L93 Difference]: Finished difference Result 2630 states and 4364 transitions. [2025-03-03 14:21:55,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:21:55,126 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 121 [2025-03-03 14:21:55,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:21:55,135 INFO L225 Difference]: With dead ends: 2630 [2025-03-03 14:21:55,135 INFO L226 Difference]: Without dead ends: 1646 [2025-03-03 14:21:55,139 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:21:55,139 INFO L435 NwaCegarLoop]: 562 mSDtfsCounter, 110 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 1116 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:21:55,139 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 1116 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:21:55,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1646 states. [2025-03-03 14:21:55,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1646 to 1638. [2025-03-03 14:21:55,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1638 states, 1312 states have (on average 1.5990853658536586) internal successors, (2098), 1318 states have internal predecessors, (2098), 297 states have call successors, (297), 25 states have call predecessors, (297), 28 states have return successors, (328), 296 states have call predecessors, (328), 296 states have call successors, (328) [2025-03-03 14:21:55,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1638 states to 1638 states and 2723 transitions. [2025-03-03 14:21:55,211 INFO L78 Accepts]: Start accepts. Automaton has 1638 states and 2723 transitions. Word has length 121 [2025-03-03 14:21:55,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:21:55,211 INFO L471 AbstractCegarLoop]: Abstraction has 1638 states and 2723 transitions. [2025-03-03 14:21:55,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:21:55,211 INFO L276 IsEmpty]: Start isEmpty. Operand 1638 states and 2723 transitions. [2025-03-03 14:21:55,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-03 14:21:55,218 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:21:55,219 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:21:55,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 14:21:55,219 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:21:55,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:21:55,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1446708256, now seen corresponding path program 1 times [2025-03-03 14:21:55,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:21:55,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805102205] [2025-03-03 14:21:55,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:21:55,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:21:55,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-03 14:21:55,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-03 14:21:55,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:21:55,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:21:55,271 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:21:55,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:21:55,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805102205] [2025-03-03 14:21:55,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805102205] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:21:55,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:21:55,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:21:55,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137938463] [2025-03-03 14:21:55,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:21:55,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:21:55,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:21:55,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:21:55,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:21:55,273 INFO L87 Difference]: Start difference. First operand 1638 states and 2723 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:21:55,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:21:55,340 INFO L93 Difference]: Finished difference Result 3819 states and 6398 transitions. [2025-03-03 14:21:55,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:21:55,341 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 122 [2025-03-03 14:21:55,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:21:55,354 INFO L225 Difference]: With dead ends: 3819 [2025-03-03 14:21:55,354 INFO L226 Difference]: Without dead ends: 2442 [2025-03-03 14:21:55,359 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:21:55,360 INFO L435 NwaCegarLoop]: 560 mSDtfsCounter, 108 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 1111 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:21:55,360 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 1111 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:21:55,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2442 states. [2025-03-03 14:21:55,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2442 to 2434. [2025-03-03 14:21:55,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2434 states, 1985 states have (on average 1.6080604534005039) internal successors, (3192), 1991 states have internal predecessors, (3192), 420 states have call successors, (420), 25 states have call predecessors, (420), 28 states have return successors, (467), 419 states have call predecessors, (467), 419 states have call successors, (467) [2025-03-03 14:21:55,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2434 states to 2434 states and 4079 transitions. [2025-03-03 14:21:55,464 INFO L78 Accepts]: Start accepts. Automaton has 2434 states and 4079 transitions. Word has length 122 [2025-03-03 14:21:55,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:21:55,464 INFO L471 AbstractCegarLoop]: Abstraction has 2434 states and 4079 transitions. [2025-03-03 14:21:55,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:21:55,464 INFO L276 IsEmpty]: Start isEmpty. Operand 2434 states and 4079 transitions. [2025-03-03 14:21:55,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-03 14:21:55,473 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:21:55,473 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:21:55,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 14:21:55,473 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:21:55,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:21:55,473 INFO L85 PathProgramCache]: Analyzing trace with hash 355241463, now seen corresponding path program 1 times [2025-03-03 14:21:55,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:21:55,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420741078] [2025-03-03 14:21:55,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:21:55,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:21:55,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-03 14:21:55,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-03 14:21:55,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:21:55,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:21:55,520 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:21:55,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:21:55,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420741078] [2025-03-03 14:21:55,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420741078] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:21:55,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:21:55,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:21:55,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693666141] [2025-03-03 14:21:55,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:21:55,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:21:55,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:21:55,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:21:55,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:21:55,522 INFO L87 Difference]: Start difference. First operand 2434 states and 4079 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:21:55,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:21:55,625 INFO L93 Difference]: Finished difference Result 5672 states and 9570 transitions. [2025-03-03 14:21:55,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:21:55,626 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 123 [2025-03-03 14:21:55,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:21:55,642 INFO L225 Difference]: With dead ends: 5672 [2025-03-03 14:21:55,642 INFO L226 Difference]: Without dead ends: 3714 [2025-03-03 14:21:55,649 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:21:55,650 INFO L435 NwaCegarLoop]: 560 mSDtfsCounter, 106 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 1111 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:21:55,650 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 1111 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:21:55,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3714 states. [2025-03-03 14:21:55,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3714 to 3706. [2025-03-03 14:21:55,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3706 states, 3078 states have (on average 1.6140350877192982) internal successors, (4968), 3084 states have internal predecessors, (4968), 599 states have call successors, (599), 25 states have call predecessors, (599), 28 states have return successors, (672), 598 states have call predecessors, (672), 598 states have call successors, (672) [2025-03-03 14:21:55,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3706 states to 3706 states and 6239 transitions. [2025-03-03 14:21:55,815 INFO L78 Accepts]: Start accepts. Automaton has 3706 states and 6239 transitions. Word has length 123 [2025-03-03 14:21:55,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:21:55,816 INFO L471 AbstractCegarLoop]: Abstraction has 3706 states and 6239 transitions. [2025-03-03 14:21:55,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:21:55,816 INFO L276 IsEmpty]: Start isEmpty. Operand 3706 states and 6239 transitions. [2025-03-03 14:21:55,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-03 14:21:55,828 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:21:55,828 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:21:55,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 14:21:55,828 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:21:55,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:21:55,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1703811393, now seen corresponding path program 1 times [2025-03-03 14:21:55,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:21:55,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787195036] [2025-03-03 14:21:55,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:21:55,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:21:55,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-03 14:21:55,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-03 14:21:55,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:21:55,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:21:55,880 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:21:55,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:21:55,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787195036] [2025-03-03 14:21:55,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787195036] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:21:55,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:21:55,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:21:55,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143152968] [2025-03-03 14:21:55,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:21:55,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:21:55,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:21:55,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:21:55,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:21:55,881 INFO L87 Difference]: Start difference. First operand 3706 states and 6239 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:21:56,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:21:56,046 INFO L93 Difference]: Finished difference Result 8719 states and 14778 transitions. [2025-03-03 14:21:56,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:21:56,046 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 124 [2025-03-03 14:21:56,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:21:56,077 INFO L225 Difference]: With dead ends: 8719 [2025-03-03 14:21:56,077 INFO L226 Difference]: Without dead ends: 5816 [2025-03-03 14:21:56,088 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:21:56,088 INFO L435 NwaCegarLoop]: 579 mSDtfsCounter, 104 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 1129 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:21:56,088 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 1129 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:21:56,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5816 states. [2025-03-03 14:21:56,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5816 to 5808. [2025-03-03 14:21:56,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5808 states, 4804 states have (on average 1.6101165695253956) internal successors, (7735), 4810 states have internal predecessors, (7735), 975 states have call successors, (975), 25 states have call predecessors, (975), 28 states have return successors, (1092), 974 states have call predecessors, (1092), 974 states have call successors, (1092) [2025-03-03 14:21:56,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5808 states to 5808 states and 9802 transitions. [2025-03-03 14:21:56,331 INFO L78 Accepts]: Start accepts. Automaton has 5808 states and 9802 transitions. Word has length 124 [2025-03-03 14:21:56,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:21:56,331 INFO L471 AbstractCegarLoop]: Abstraction has 5808 states and 9802 transitions. [2025-03-03 14:21:56,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:21:56,331 INFO L276 IsEmpty]: Start isEmpty. Operand 5808 states and 9802 transitions. [2025-03-03 14:21:56,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-03 14:21:56,382 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:21:56,382 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:21:56,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 14:21:56,382 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:21:56,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:21:56,383 INFO L85 PathProgramCache]: Analyzing trace with hash 748941270, now seen corresponding path program 1 times [2025-03-03 14:21:56,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:21:56,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069906460] [2025-03-03 14:21:56,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:21:56,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:21:56,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-03 14:21:56,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-03 14:21:56,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:21:56,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:21:56,434 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:21:56,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:21:56,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069906460] [2025-03-03 14:21:56,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069906460] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:21:56,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:21:56,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:21:56,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435902739] [2025-03-03 14:21:56,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:21:56,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:21:56,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:21:56,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:21:56,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:21:56,435 INFO L87 Difference]: Start difference. First operand 5808 states and 9802 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:21:56,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:21:56,700 INFO L93 Difference]: Finished difference Result 14231 states and 24175 transitions. [2025-03-03 14:21:56,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:21:56,701 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 125 [2025-03-03 14:21:56,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:21:56,753 INFO L225 Difference]: With dead ends: 14231 [2025-03-03 14:21:56,753 INFO L226 Difference]: Without dead ends: 9622 [2025-03-03 14:21:56,772 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:21:56,773 INFO L435 NwaCegarLoop]: 560 mSDtfsCounter, 102 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 1114 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:21:56,773 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 1114 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:21:56,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9622 states. [2025-03-03 14:21:57,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9622 to 9614. [2025-03-03 14:21:57,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9614 states, 8004 states have (on average 1.6094452773613193) internal successors, (12882), 8010 states have internal predecessors, (12882), 1581 states have call successors, (1581), 25 states have call predecessors, (1581), 28 states have return successors, (1776), 1580 states have call predecessors, (1776), 1580 states have call successors, (1776) [2025-03-03 14:21:57,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9614 states to 9614 states and 16239 transitions. [2025-03-03 14:21:57,173 INFO L78 Accepts]: Start accepts. Automaton has 9614 states and 16239 transitions. Word has length 125 [2025-03-03 14:21:57,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:21:57,173 INFO L471 AbstractCegarLoop]: Abstraction has 9614 states and 16239 transitions. [2025-03-03 14:21:57,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:21:57,174 INFO L276 IsEmpty]: Start isEmpty. Operand 9614 states and 16239 transitions. [2025-03-03 14:21:57,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-03 14:21:57,193 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:21:57,193 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:21:57,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 14:21:57,194 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:21:57,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:21:57,194 INFO L85 PathProgramCache]: Analyzing trace with hash -914782078, now seen corresponding path program 1 times [2025-03-03 14:21:57,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:21:57,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634503832] [2025-03-03 14:21:57,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:21:57,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:21:57,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-03 14:21:57,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-03 14:21:57,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:21:57,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:21:57,234 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:21:57,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:21:57,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634503832] [2025-03-03 14:21:57,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634503832] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:21:57,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:21:57,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:21:57,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801012791] [2025-03-03 14:21:57,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:21:57,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:21:57,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:21:57,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:21:57,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:21:57,235 INFO L87 Difference]: Start difference. First operand 9614 states and 16239 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:21:57,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:21:57,557 INFO L93 Difference]: Finished difference Result 24738 states and 41973 transitions. [2025-03-03 14:21:57,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:21:57,557 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 126 [2025-03-03 14:21:57,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:21:57,621 INFO L225 Difference]: With dead ends: 24738 [2025-03-03 14:21:57,621 INFO L226 Difference]: Without dead ends: 16798 [2025-03-03 14:21:57,653 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:21:57,654 INFO L435 NwaCegarLoop]: 580 mSDtfsCounter, 100 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 1139 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:21:57,654 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 1139 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:21:57,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16798 states. [2025-03-03 14:21:58,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16798 to 16790. [2025-03-03 14:21:58,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16790 states, 13977 states have (on average 1.6019889818988338) internal successors, (22391), 13983 states have internal predecessors, (22391), 2784 states have call successors, (2784), 25 states have call predecessors, (2784), 28 states have return successors, (3123), 2783 states have call predecessors, (3123), 2783 states have call successors, (3123) [2025-03-03 14:21:58,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16790 states to 16790 states and 28298 transitions. [2025-03-03 14:21:58,401 INFO L78 Accepts]: Start accepts. Automaton has 16790 states and 28298 transitions. Word has length 126 [2025-03-03 14:21:58,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:21:58,401 INFO L471 AbstractCegarLoop]: Abstraction has 16790 states and 28298 transitions. [2025-03-03 14:21:58,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:21:58,401 INFO L276 IsEmpty]: Start isEmpty. Operand 16790 states and 28298 transitions. [2025-03-03 14:21:58,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-03 14:21:58,431 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:21:58,431 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:21:58,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 14:21:58,431 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:21:58,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:21:58,432 INFO L85 PathProgramCache]: Analyzing trace with hash 240419381, now seen corresponding path program 1 times [2025-03-03 14:21:58,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:21:58,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003181936] [2025-03-03 14:21:58,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:21:58,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:21:58,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-03 14:21:58,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-03 14:21:58,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:21:58,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:21:58,491 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:21:58,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:21:58,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003181936] [2025-03-03 14:21:58,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003181936] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:21:58,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:21:58,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:21:58,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525153356] [2025-03-03 14:21:58,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:21:58,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:21:58,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:21:58,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:21:58,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:21:58,493 INFO L87 Difference]: Start difference. First operand 16790 states and 28298 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:21:59,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:21:59,299 INFO L93 Difference]: Finished difference Result 44319 states and 75051 transitions. [2025-03-03 14:21:59,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:21:59,300 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 127 [2025-03-03 14:21:59,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:21:59,411 INFO L225 Difference]: With dead ends: 44319 [2025-03-03 14:21:59,411 INFO L226 Difference]: Without dead ends: 29872 [2025-03-03 14:21:59,444 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:21:59,445 INFO L435 NwaCegarLoop]: 560 mSDtfsCounter, 98 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 1114 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:21:59,445 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 1114 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:21:59,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29872 states. [2025-03-03 14:22:00,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29872 to 29864. [2025-03-03 14:22:00,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29864 states, 25012 states have (on average 1.5987525987525988) internal successors, (39988), 25018 states have internal predecessors, (39988), 4823 states have call successors, (4823), 25 states have call predecessors, (4823), 28 states have return successors, (5436), 4822 states have call predecessors, (5436), 4822 states have call successors, (5436) [2025-03-03 14:22:00,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29864 states to 29864 states and 50247 transitions. [2025-03-03 14:22:00,445 INFO L78 Accepts]: Start accepts. Automaton has 29864 states and 50247 transitions. Word has length 127 [2025-03-03 14:22:00,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:00,445 INFO L471 AbstractCegarLoop]: Abstraction has 29864 states and 50247 transitions. [2025-03-03 14:22:00,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:22:00,446 INFO L276 IsEmpty]: Start isEmpty. Operand 29864 states and 50247 transitions. [2025-03-03 14:22:00,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-03 14:22:00,474 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:00,474 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:00,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 14:22:00,475 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:00,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:00,476 INFO L85 PathProgramCache]: Analyzing trace with hash -140096349, now seen corresponding path program 1 times [2025-03-03 14:22:00,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:00,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185473054] [2025-03-03 14:22:00,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:00,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:00,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-03 14:22:00,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-03 14:22:00,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:00,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:00,526 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:22:00,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:00,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185473054] [2025-03-03 14:22:00,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185473054] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:00,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:00,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:22:00,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399011075] [2025-03-03 14:22:00,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:00,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:22:00,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:00,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:22:00,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:00,527 INFO L87 Difference]: Start difference. First operand 29864 states and 50247 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:22:01,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:01,612 INFO L93 Difference]: Finished difference Result 81276 states and 137263 transitions. [2025-03-03 14:22:01,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:22:01,612 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 128 [2025-03-03 14:22:01,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:01,856 INFO L225 Difference]: With dead ends: 81276 [2025-03-03 14:22:01,856 INFO L226 Difference]: Without dead ends: 54558 [2025-03-03 14:22:01,931 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:01,932 INFO L435 NwaCegarLoop]: 561 mSDtfsCounter, 96 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 1115 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:01,932 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 1115 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:01,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54558 states. [2025-03-03 14:22:03,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54558 to 54550. [2025-03-03 14:22:03,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54550 states, 45983 states have (on average 1.5939803840549769) internal successors, (73296), 45989 states have internal predecessors, (73296), 8538 states have call successors, (8538), 25 states have call predecessors, (8538), 28 states have return successors, (9683), 8537 states have call predecessors, (9683), 8537 states have call successors, (9683) [2025-03-03 14:22:03,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54550 states to 54550 states and 91517 transitions. [2025-03-03 14:22:03,868 INFO L78 Accepts]: Start accepts. Automaton has 54550 states and 91517 transitions. Word has length 128 [2025-03-03 14:22:03,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:03,868 INFO L471 AbstractCegarLoop]: Abstraction has 54550 states and 91517 transitions. [2025-03-03 14:22:03,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:22:03,869 INFO L276 IsEmpty]: Start isEmpty. Operand 54550 states and 91517 transitions. [2025-03-03 14:22:03,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-03 14:22:03,898 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:03,898 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:03,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 14:22:03,899 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:03,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:03,899 INFO L85 PathProgramCache]: Analyzing trace with hash 593613812, now seen corresponding path program 1 times [2025-03-03 14:22:03,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:03,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409663094] [2025-03-03 14:22:03,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:03,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:03,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-03 14:22:03,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-03 14:22:03,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:03,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:03,948 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:22:03,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:03,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409663094] [2025-03-03 14:22:03,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409663094] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:03,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:03,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:22:03,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565746340] [2025-03-03 14:22:03,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:03,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:22:03,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:03,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:22:03,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:03,950 INFO L87 Difference]: Start difference. First operand 54550 states and 91517 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:22:05,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:05,378 INFO L93 Difference]: Finished difference Result 101822 states and 171170 transitions. [2025-03-03 14:22:05,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:22:05,378 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 129 [2025-03-03 14:22:05,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:06,039 INFO L225 Difference]: With dead ends: 101822 [2025-03-03 14:22:06,039 INFO L226 Difference]: Without dead ends: 101599 [2025-03-03 14:22:06,072 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:06,075 INFO L435 NwaCegarLoop]: 562 mSDtfsCounter, 91 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1120 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:06,075 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1120 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:06,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101599 states. [2025-03-03 14:22:08,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101599 to 101591. [2025-03-03 14:22:09,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101591 states, 86225 states have (on average 1.5876369962307915) internal successors, (136894), 86231 states have internal predecessors, (136894), 15337 states have call successors, (15337), 25 states have call predecessors, (15337), 28 states have return successors, (17528), 15336 states have call predecessors, (17528), 15336 states have call successors, (17528) [2025-03-03 14:22:09,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101591 states to 101591 states and 169759 transitions. [2025-03-03 14:22:09,342 INFO L78 Accepts]: Start accepts. Automaton has 101591 states and 169759 transitions. Word has length 129 [2025-03-03 14:22:09,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:09,342 INFO L471 AbstractCegarLoop]: Abstraction has 101591 states and 169759 transitions. [2025-03-03 14:22:09,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:22:09,343 INFO L276 IsEmpty]: Start isEmpty. Operand 101591 states and 169759 transitions. [2025-03-03 14:22:09,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-03 14:22:09,377 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:09,377 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:09,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 14:22:09,378 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:09,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:09,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1936371972, now seen corresponding path program 1 times [2025-03-03 14:22:09,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:09,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696825185] [2025-03-03 14:22:09,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:09,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:09,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-03 14:22:09,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-03 14:22:09,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:09,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:09,632 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:22:09,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:09,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696825185] [2025-03-03 14:22:09,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696825185] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:09,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:09,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-03 14:22:09,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46456572] [2025-03-03 14:22:09,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:09,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 14:22:09,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:09,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 14:22:09,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2025-03-03 14:22:09,634 INFO L87 Difference]: Start difference. First operand 101591 states and 169759 transitions. Second operand has 14 states, 12 states have (on average 7.416666666666667) internal successors, (89), 12 states have internal predecessors, (89), 6 states have call successors, (15), 3 states have call predecessors, (15), 4 states have return successors, (13), 6 states have call predecessors, (13), 6 states have call successors, (13) [2025-03-03 14:22:14,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:14,836 INFO L93 Difference]: Finished difference Result 202754 states and 344243 transitions. [2025-03-03 14:22:14,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-03 14:22:14,839 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.416666666666667) internal successors, (89), 12 states have internal predecessors, (89), 6 states have call successors, (15), 3 states have call predecessors, (15), 4 states have return successors, (13), 6 states have call predecessors, (13), 6 states have call successors, (13) Word has length 130 [2025-03-03 14:22:14,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:15,907 INFO L225 Difference]: With dead ends: 202754 [2025-03-03 14:22:15,908 INFO L226 Difference]: Without dead ends: 202537 [2025-03-03 14:22:16,000 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=159, Invalid=833, Unknown=0, NotChecked=0, Total=992 [2025-03-03 14:22:16,001 INFO L435 NwaCegarLoop]: 649 mSDtfsCounter, 1782 mSDsluCounter, 6883 mSDsCounter, 0 mSdLazyCounter, 1646 mSolverCounterSat, 599 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1782 SdHoareTripleChecker+Valid, 7532 SdHoareTripleChecker+Invalid, 2245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 599 IncrementalHoareTripleChecker+Valid, 1646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:16,001 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1782 Valid, 7532 Invalid, 2245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [599 Valid, 1646 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 14:22:16,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202537 states. [2025-03-03 14:22:22,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202537 to 202347. [2025-03-03 14:22:22,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202347 states, 171793 states have (on average 1.5884116349327388) internal successors, (272878), 171697 states have internal predecessors, (272878), 30481 states have call successors, (30481), 65 states have call predecessors, (30481), 72 states have return successors, (38139), 30590 states have call predecessors, (38139), 30478 states have call successors, (38139) [2025-03-03 14:22:23,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202347 states to 202347 states and 341498 transitions. [2025-03-03 14:22:23,335 INFO L78 Accepts]: Start accepts. Automaton has 202347 states and 341498 transitions. Word has length 130 [2025-03-03 14:22:23,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:23,335 INFO L471 AbstractCegarLoop]: Abstraction has 202347 states and 341498 transitions. [2025-03-03 14:22:23,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.416666666666667) internal successors, (89), 12 states have internal predecessors, (89), 6 states have call successors, (15), 3 states have call predecessors, (15), 4 states have return successors, (13), 6 states have call predecessors, (13), 6 states have call successors, (13) [2025-03-03 14:22:23,336 INFO L276 IsEmpty]: Start isEmpty. Operand 202347 states and 341498 transitions. [2025-03-03 14:22:23,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-03 14:22:23,397 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:23,398 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:23,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 14:22:23,398 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:23,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:23,399 INFO L85 PathProgramCache]: Analyzing trace with hash 194305295, now seen corresponding path program 1 times [2025-03-03 14:22:23,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:23,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151361613] [2025-03-03 14:22:23,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:23,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:23,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-03 14:22:23,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-03 14:22:23,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:23,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:23,604 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-03 14:22:23,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:23,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151361613] [2025-03-03 14:22:23,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151361613] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:22:23,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [657847169] [2025-03-03 14:22:23,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:23,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:22:23,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:22:23,606 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:22:23,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-03 14:22:23,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-03 14:22:23,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-03 14:22:23,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:23,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:23,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 1091 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-03 14:22:23,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:22:23,981 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-03 14:22:23,981 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:22:24,192 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-03 14:22:24,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [657847169] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:22:24,192 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:22:24,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2025-03-03 14:22:24,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912285689] [2025-03-03 14:22:24,192 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:22:24,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-03 14:22:24,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:24,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-03 14:22:24,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=391, Unknown=0, NotChecked=0, Total=462 [2025-03-03 14:22:24,194 INFO L87 Difference]: Start difference. First operand 202347 states and 341498 transitions. Second operand has 22 states, 22 states have (on average 9.727272727272727) internal successors, (214), 19 states have internal predecessors, (214), 5 states have call successors, (37), 8 states have call predecessors, (37), 12 states have return successors, (33), 8 states have call predecessors, (33), 5 states have call successors, (33)