./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec1_product12.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/email_spec1_product12.cil.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2f43e7267ed715243a41104ad5703ed473575064952f167333067630dfd5e9da --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 15:41:22,490 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 15:41:22,533 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 15:41:22,541 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 15:41:22,541 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 15:41:22,567 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 15:41:22,571 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 15:41:22,571 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 15:41:22,571 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 15:41:22,571 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 15:41:22,571 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 15:41:22,571 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 15:41:22,572 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 15:41:22,572 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 15:41:22,572 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 15:41:22,572 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 15:41:22,572 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 15:41:22,572 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 15:41:22,572 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 15:41:22,572 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 15:41:22,572 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 15:41:22,572 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 15:41:22,572 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 15:41:22,572 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 15:41:22,572 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 15:41:22,572 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 15:41:22,572 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 15:41:22,572 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 15:41:22,573 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 15:41:22,573 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 15:41:22,573 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 15:41:22,573 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 15:41:22,573 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:41:22,573 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 15:41:22,573 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 15:41:22,573 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 15:41:22,573 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 15:41:22,573 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 15:41:22,573 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 15:41:22,573 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 15:41:22,573 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 15:41:22,573 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 15:41:22,573 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 15:41:22,573 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2f43e7267ed715243a41104ad5703ed473575064952f167333067630dfd5e9da [2025-02-05 15:41:22,871 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 15:41:22,877 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 15:41:22,879 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 15:41:22,880 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 15:41:22,880 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 15:41:22,881 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec1_product12.cil.c [2025-02-05 15:41:24,109 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6ad6b3b58/151193750106484bbeb791982af6524f/FLAG82b3a92e1 [2025-02-05 15:41:24,521 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 15:41:24,522 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec1_product12.cil.c [2025-02-05 15:41:24,533 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6ad6b3b58/151193750106484bbeb791982af6524f/FLAG82b3a92e1 [2025-02-05 15:41:24,709 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6ad6b3b58/151193750106484bbeb791982af6524f [2025-02-05 15:41:24,711 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 15:41:24,712 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 15:41:24,714 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 15:41:24,714 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 15:41:24,717 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 15:41:24,718 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:41:24" (1/1) ... [2025-02-05 15:41:24,720 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35153dd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:41:24, skipping insertion in model container [2025-02-05 15:41:24,720 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:41:24" (1/1) ... [2025-02-05 15:41:24,764 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 15:41:25,190 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec1_product12.cil.c[58861,58874] [2025-02-05 15:41:25,207 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:41:25,222 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 15:41:25,228 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [48] [2025-02-05 15:41:25,230 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [269] [2025-02-05 15:41:25,230 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [318] [2025-02-05 15:41:25,230 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [598] [2025-02-05 15:41:25,230 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [1671] [2025-02-05 15:41:25,230 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [1906] [2025-02-05 15:41:25,230 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [2312] [2025-02-05 15:41:25,231 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [2329] [2025-02-05 15:41:25,231 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [2695] [2025-02-05 15:41:25,231 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [2704] [2025-02-05 15:41:25,231 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"AddressBookEncrypt_spec.i","") [2808] [2025-02-05 15:41:25,335 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec1_product12.cil.c[58861,58874] [2025-02-05 15:41:25,342 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:41:25,367 INFO L204 MainTranslator]: Completed translation [2025-02-05 15:41:25,368 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:41:25 WrapperNode [2025-02-05 15:41:25,368 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 15:41:25,369 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 15:41:25,369 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 15:41:25,370 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 15:41:25,374 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:41:25" (1/1) ... [2025-02-05 15:41:25,400 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:41:25" (1/1) ... [2025-02-05 15:41:25,442 INFO L138 Inliner]: procedures = 122, calls = 174, calls flagged for inlining = 50, calls inlined = 40, statements flattened = 823 [2025-02-05 15:41:25,443 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 15:41:25,444 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 15:41:25,444 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 15:41:25,444 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 15:41:25,451 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:41:25" (1/1) ... [2025-02-05 15:41:25,451 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:41:25" (1/1) ... [2025-02-05 15:41:25,455 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:41:25" (1/1) ... [2025-02-05 15:41:25,470 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 4, 4, 4]. 29 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 4, 4, 4]. The 0 writes are split as follows [0, 0, 0, 0]. [2025-02-05 15:41:25,470 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:41:25" (1/1) ... [2025-02-05 15:41:25,470 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:41:25" (1/1) ... [2025-02-05 15:41:25,480 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:41:25" (1/1) ... [2025-02-05 15:41:25,481 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:41:25" (1/1) ... [2025-02-05 15:41:25,483 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:41:25" (1/1) ... [2025-02-05 15:41:25,484 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:41:25" (1/1) ... [2025-02-05 15:41:25,492 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 15:41:25,493 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 15:41:25,493 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 15:41:25,493 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 15:41:25,494 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:41:25" (1/1) ... [2025-02-05 15:41:25,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:41:25,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:41:25,522 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 15:41:25,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 15:41:25,544 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2025-02-05 15:41:25,544 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2025-02-05 15:41:25,544 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2025-02-05 15:41:25,544 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2025-02-05 15:41:25,544 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-02-05 15:41:25,544 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-02-05 15:41:25,544 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-02-05 15:41:25,545 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-02-05 15:41:25,545 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-02-05 15:41:25,545 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-02-05 15:41:25,545 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2025-02-05 15:41:25,545 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2025-02-05 15:41:25,546 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-02-05 15:41:25,546 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-02-05 15:41:25,546 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-02-05 15:41:25,546 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-02-05 15:41:25,546 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 15:41:25,546 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-02-05 15:41:25,546 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-02-05 15:41:25,546 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-02-05 15:41:25,546 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-02-05 15:41:25,546 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-02-05 15:41:25,546 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-02-05 15:41:25,546 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-02-05 15:41:25,546 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-02-05 15:41:25,546 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2025-02-05 15:41:25,546 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2025-02-05 15:41:25,546 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-02-05 15:41:25,546 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-02-05 15:41:25,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 15:41:25,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-05 15:41:25,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-05 15:41:25,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-05 15:41:25,546 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-02-05 15:41:25,546 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-02-05 15:41:25,546 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 15:41:25,547 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 15:41:25,669 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 15:41:25,671 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 15:41:25,795 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1213-1: getClientPrivateKey_#res#1 := getClientPrivateKey_~retValue_acc~12#1; [2025-02-05 15:41:25,795 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1648-1: getClientId_#res#1 := getClientId_~retValue_acc~19#1; [2025-02-05 15:41:25,795 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1529-1: findPublicKey_#res#1 := findPublicKey_~retValue_acc~17#1; [2025-02-05 15:41:25,795 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1893-1: isKeyPairValid_#res#1 := isKeyPairValid_~retValue_acc~24#1; [2025-02-05 15:41:25,810 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2030: #res := ~retValue_acc~28; [2025-02-05 15:41:25,833 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1305: #res#1 := ~retValue_acc~14#1; [2025-02-05 15:41:25,834 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1260-1: getClientKeyringSize_#res#1 := getClientKeyringSize_~retValue_acc~13#1; [2025-02-05 15:41:25,863 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2805-1: createEmail_#res#1 := createEmail_~retValue_acc~43#1; [2025-02-05 15:41:25,874 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2145: #res := ~retValue_acc~31; [2025-02-05 15:41:26,141 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1475-1: getClientKeyringPublicKey_#res#1 := getClientKeyringPublicKey_~retValue_acc~16#1; [2025-02-05 15:41:26,142 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1368-1: getClientKeyringUser_#res#1 := getClientKeyringUser_~retValue_acc~15#1; [2025-02-05 15:41:26,142 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1850-1: is_queue_empty_#res#1 := is_queue_empty_~retValue_acc~21#1; [2025-02-05 15:41:26,142 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1859-1: get_queued_client_#res#1 := get_queued_client_~retValue_acc~22#1; [2025-02-05 15:41:26,142 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L315-1: valid_product_#res#1 := valid_product_~retValue_acc~1#1; [2025-02-05 15:41:26,142 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1868-1: get_queued_email_#res#1 := get_queued_email_~retValue_acc~23#1; [2025-02-05 15:41:26,165 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2182: #res := ~retValue_acc~32; [2025-02-05 15:41:26,258 INFO L? ?]: Removed 336 outVars from TransFormulas that were not future-live. [2025-02-05 15:41:26,258 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 15:41:26,273 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 15:41:26,273 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 15:41:26,274 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:41:26 BoogieIcfgContainer [2025-02-05 15:41:26,274 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 15:41:26,278 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 15:41:26,278 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 15:41:26,283 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 15:41:26,283 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 03:41:24" (1/3) ... [2025-02-05 15:41:26,283 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e5bd404 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:41:26, skipping insertion in model container [2025-02-05 15:41:26,284 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:41:25" (2/3) ... [2025-02-05 15:41:26,284 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e5bd404 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:41:26, skipping insertion in model container [2025-02-05 15:41:26,284 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:41:26" (3/3) ... [2025-02-05 15:41:26,285 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec1_product12.cil.c [2025-02-05 15:41:26,295 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 15:41:26,298 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec1_product12.cil.c that has 16 procedures, 260 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 15:41:26,350 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 15:41:26,360 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;@77d7d46a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 15:41:26,361 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 15:41:26,366 INFO L276 IsEmpty]: Start isEmpty. Operand has 260 states, 204 states have (on average 1.553921568627451) internal successors, (317), 208 states have internal predecessors, (317), 39 states have call successors, (39), 15 states have call predecessors, (39), 15 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-02-05 15:41:26,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-02-05 15:41:26,376 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:41:26,377 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:41:26,377 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:41:26,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:41:26,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1904201954, now seen corresponding path program 1 times [2025-02-05 15:41:26,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:41:26,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593502317] [2025-02-05 15:41:26,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:41:26,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:41:26,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-02-05 15:41:26,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-02-05 15:41:26,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:41:26,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:41:26,878 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-05 15:41:26,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:41:26,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593502317] [2025-02-05 15:41:26,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593502317] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:41:26,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1959569121] [2025-02-05 15:41:26,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:41:26,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:41:26,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:41:26,882 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:41:26,884 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 15:41:26,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-02-05 15:41:27,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-02-05 15:41:27,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:41:27,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:41:27,086 INFO L256 TraceCheckSpWp]: Trace formula consists of 871 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 15:41:27,090 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:41:27,101 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-05 15:41:27,102 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:41:27,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1959569121] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:41:27,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:41:27,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 5 [2025-02-05 15:41:27,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940747545] [2025-02-05 15:41:27,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:41:27,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 15:41:27,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:41:27,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 15:41:27,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:41:27,121 INFO L87 Difference]: Start difference. First operand has 260 states, 204 states have (on average 1.553921568627451) internal successors, (317), 208 states have internal predecessors, (317), 39 states have call successors, (39), 15 states have call predecessors, (39), 15 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 15:41:27,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:41:27,149 INFO L93 Difference]: Finished difference Result 372 states and 554 transitions. [2025-02-05 15:41:27,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 15:41:27,151 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 86 [2025-02-05 15:41:27,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:41:27,158 INFO L225 Difference]: With dead ends: 372 [2025-02-05 15:41:27,158 INFO L226 Difference]: Without dead ends: 253 [2025-02-05 15:41:27,161 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:41:27,163 INFO L435 NwaCegarLoop]: 392 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, 392 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:41:27,163 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:41:27,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2025-02-05 15:41:27,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 253. [2025-02-05 15:41:27,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 198 states have (on average 1.5505050505050506) internal successors, (307), 201 states have internal predecessors, (307), 39 states have call successors, (39), 15 states have call predecessors, (39), 15 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-02-05 15:41:27,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 384 transitions. [2025-02-05 15:41:27,201 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 384 transitions. Word has length 86 [2025-02-05 15:41:27,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:41:27,202 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 384 transitions. [2025-02-05 15:41:27,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 15:41:27,202 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 384 transitions. [2025-02-05 15:41:27,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-02-05 15:41:27,205 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:41:27,206 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] [2025-02-05 15:41:27,215 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 15:41:27,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-05 15:41:27,407 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:41:27,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:41:27,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1951515633, now seen corresponding path program 1 times [2025-02-05 15:41:27,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:41:27,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158507239] [2025-02-05 15:41:27,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:41:27,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:41:27,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-02-05 15:41:27,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-02-05 15:41:27,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:41:27,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:41:27,635 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-05 15:41:27,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:41:27,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158507239] [2025-02-05 15:41:27,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158507239] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:41:27,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1495887460] [2025-02-05 15:41:27,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:41:27,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:41:27,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:41:27,638 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:41:27,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 15:41:27,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-02-05 15:41:27,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-02-05 15:41:27,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:41:27,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:41:27,839 INFO L256 TraceCheckSpWp]: Trace formula consists of 872 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 15:41:27,842 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:41:27,860 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-05 15:41:27,860 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:41:27,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1495887460] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:41:27,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:41:27,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-02-05 15:41:27,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097405062] [2025-02-05 15:41:27,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:41:27,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:41:27,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:41:27,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:41:27,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:41:27,862 INFO L87 Difference]: Start difference. First operand 253 states and 384 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 15:41:27,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:41:27,892 INFO L93 Difference]: Finished difference Result 361 states and 535 transitions. [2025-02-05 15:41:27,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:41:27,892 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 87 [2025-02-05 15:41:27,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:41:27,895 INFO L225 Difference]: With dead ends: 361 [2025-02-05 15:41:27,895 INFO L226 Difference]: Without dead ends: 255 [2025-02-05 15:41:27,896 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:41:27,896 INFO L435 NwaCegarLoop]: 383 mSDtfsCounter, 0 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 764 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:41:27,897 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 764 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:41:27,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2025-02-05 15:41:27,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 255. [2025-02-05 15:41:27,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 200 states have (on average 1.545) internal successors, (309), 203 states have internal predecessors, (309), 39 states have call successors, (39), 15 states have call predecessors, (39), 15 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-02-05 15:41:27,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 386 transitions. [2025-02-05 15:41:27,911 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 386 transitions. Word has length 87 [2025-02-05 15:41:27,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:41:27,911 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 386 transitions. [2025-02-05 15:41:27,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 15:41:27,911 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 386 transitions. [2025-02-05 15:41:27,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-02-05 15:41:27,914 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:41:27,914 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] [2025-02-05 15:41:27,923 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-05 15:41:28,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:41:28,115 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:41:28,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:41:28,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1508330925, now seen corresponding path program 1 times [2025-02-05 15:41:28,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:41:28,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560013596] [2025-02-05 15:41:28,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:41:28,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:41:28,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-05 15:41:28,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-05 15:41:28,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:41:28,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:41:28,277 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-05 15:41:28,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:41:28,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560013596] [2025-02-05 15:41:28,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560013596] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:41:28,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [652924970] [2025-02-05 15:41:28,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:41:28,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:41:28,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:41:28,282 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:41:28,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 15:41:28,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-05 15:41:28,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-05 15:41:28,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:41:28,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:41:28,485 INFO L256 TraceCheckSpWp]: Trace formula consists of 884 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 15:41:28,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:41:28,505 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-05 15:41:28,506 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:41:28,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [652924970] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:41:28,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:41:28,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-02-05 15:41:28,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498228035] [2025-02-05 15:41:28,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:41:28,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:41:28,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:41:28,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:41:28,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:41:28,507 INFO L87 Difference]: Start difference. First operand 255 states and 386 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 15:41:28,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:41:28,529 INFO L93 Difference]: Finished difference Result 534 states and 822 transitions. [2025-02-05 15:41:28,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:41:28,529 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 92 [2025-02-05 15:41:28,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:41:28,532 INFO L225 Difference]: With dead ends: 534 [2025-02-05 15:41:28,532 INFO L226 Difference]: Without dead ends: 306 [2025-02-05 15:41:28,533 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:41:28,533 INFO L435 NwaCegarLoop]: 395 mSDtfsCounter, 99 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 732 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:41:28,534 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 732 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:41:28,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2025-02-05 15:41:28,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 298. [2025-02-05 15:41:28,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 232 states have (on average 1.5603448275862069) internal successors, (362), 235 states have internal predecessors, (362), 50 states have call successors, (50), 15 states have call predecessors, (50), 15 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2025-02-05 15:41:28,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 461 transitions. [2025-02-05 15:41:28,550 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 461 transitions. Word has length 92 [2025-02-05 15:41:28,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:41:28,550 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 461 transitions. [2025-02-05 15:41:28,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 15:41:28,550 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 461 transitions. [2025-02-05 15:41:28,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-02-05 15:41:28,552 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:41:28,553 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] [2025-02-05 15:41:28,560 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-05 15:41:28,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:41:28,754 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:41:28,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:41:28,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1876832340, now seen corresponding path program 1 times [2025-02-05 15:41:28,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:41:28,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409861843] [2025-02-05 15:41:28,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:41:28,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:41:28,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-05 15:41:28,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-05 15:41:28,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:41:28,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:41:28,882 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-05 15:41:28,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:41:28,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409861843] [2025-02-05 15:41:28,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409861843] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:41:28,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1370294328] [2025-02-05 15:41:28,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:41:28,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:41:28,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:41:28,884 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:41:28,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-05 15:41:28,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-05 15:41:29,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-05 15:41:29,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:41:29,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:41:29,085 INFO L256 TraceCheckSpWp]: Trace formula consists of 889 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-05 15:41:29,088 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:41:29,126 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-05 15:41:29,126 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:41:29,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1370294328] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:41:29,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:41:29,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-02-05 15:41:29,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960109902] [2025-02-05 15:41:29,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:41:29,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:41:29,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:41:29,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:41:29,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:41:29,128 INFO L87 Difference]: Start difference. First operand 298 states and 461 transitions. Second operand has 5 states, 4 states have (on average 16.0) internal successors, (64), 5 states have internal predecessors, (64), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2025-02-05 15:41:29,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:41:29,170 INFO L93 Difference]: Finished difference Result 587 states and 912 transitions. [2025-02-05 15:41:29,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:41:29,171 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.0) internal successors, (64), 5 states have internal predecessors, (64), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 93 [2025-02-05 15:41:29,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:41:29,172 INFO L225 Difference]: With dead ends: 587 [2025-02-05 15:41:29,173 INFO L226 Difference]: Without dead ends: 300 [2025-02-05 15:41:29,174 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:41:29,174 INFO L435 NwaCegarLoop]: 376 mSDtfsCounter, 2 mSDsluCounter, 1117 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1493 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:41:29,174 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1493 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:41:29,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2025-02-05 15:41:29,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 300. [2025-02-05 15:41:29,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 233 states have (on average 1.55793991416309) internal successors, (363), 237 states have internal predecessors, (363), 50 states have call successors, (50), 15 states have call predecessors, (50), 16 states have return successors, (51), 49 states have call predecessors, (51), 49 states have call successors, (51) [2025-02-05 15:41:29,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 464 transitions. [2025-02-05 15:41:29,190 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 464 transitions. Word has length 93 [2025-02-05 15:41:29,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:41:29,190 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 464 transitions. [2025-02-05 15:41:29,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.0) internal successors, (64), 5 states have internal predecessors, (64), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2025-02-05 15:41:29,190 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 464 transitions. [2025-02-05 15:41:29,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-05 15:41:29,192 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:41:29,192 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] [2025-02-05 15:41:29,203 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-05 15:41:29,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:41:29,396 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:41:29,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:41:29,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1262005350, now seen corresponding path program 1 times [2025-02-05 15:41:29,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:41:29,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666112214] [2025-02-05 15:41:29,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:41:29,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:41:29,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-05 15:41:29,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-05 15:41:29,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:41:29,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:41:29,527 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-05 15:41:29,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:41:29,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666112214] [2025-02-05 15:41:29,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666112214] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:41:29,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1334328790] [2025-02-05 15:41:29,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:41:29,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:41:29,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:41:29,529 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:41:29,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-05 15:41:29,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-05 15:41:29,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-05 15:41:29,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:41:29,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:41:29,755 INFO L256 TraceCheckSpWp]: Trace formula consists of 890 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 15:41:29,758 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:41:29,791 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-05 15:41:29,791 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:41:29,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1334328790] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:41:29,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:41:29,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-02-05 15:41:29,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302101528] [2025-02-05 15:41:29,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:41:29,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:41:29,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:41:29,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:41:29,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-02-05 15:41:29,793 INFO L87 Difference]: Start difference. First operand 300 states and 464 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-02-05 15:41:29,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:41:29,839 INFO L93 Difference]: Finished difference Result 589 states and 917 transitions. [2025-02-05 15:41:29,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:41:29,840 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 94 [2025-02-05 15:41:29,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:41:29,842 INFO L225 Difference]: With dead ends: 589 [2025-02-05 15:41:29,842 INFO L226 Difference]: Without dead ends: 302 [2025-02-05 15:41:29,843 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-02-05 15:41:29,843 INFO L435 NwaCegarLoop]: 374 mSDtfsCounter, 2 mSDsluCounter, 1105 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1479 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:41:29,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1479 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:41:29,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2025-02-05 15:41:29,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 302. [2025-02-05 15:41:29,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 234 states have (on average 1.5555555555555556) internal successors, (364), 239 states have internal predecessors, (364), 50 states have call successors, (50), 15 states have call predecessors, (50), 17 states have return successors, (56), 49 states have call predecessors, (56), 49 states have call successors, (56) [2025-02-05 15:41:29,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 470 transitions. [2025-02-05 15:41:29,857 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 470 transitions. Word has length 94 [2025-02-05 15:41:29,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:41:29,858 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 470 transitions. [2025-02-05 15:41:29,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-02-05 15:41:29,858 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 470 transitions. [2025-02-05 15:41:29,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-02-05 15:41:29,859 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:41:29,859 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:41:29,869 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-05 15:41:30,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:41:30,065 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:41:30,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:41:30,065 INFO L85 PathProgramCache]: Analyzing trace with hash 563254555, now seen corresponding path program 1 times [2025-02-05 15:41:30,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:41:30,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516146013] [2025-02-05 15:41:30,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:41:30,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:41:30,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-05 15:41:30,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-05 15:41:30,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:41:30,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:41:30,174 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-05 15:41:30,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:41:30,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516146013] [2025-02-05 15:41:30,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516146013] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:41:30,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:41:30,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:41:30,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208674220] [2025-02-05 15:41:30,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:41:30,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:41:30,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:41:30,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:41:30,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:41:30,176 INFO L87 Difference]: Start difference. First operand 302 states and 470 transitions. Second operand has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2025-02-05 15:41:30,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:41:30,222 INFO L93 Difference]: Finished difference Result 581 states and 908 transitions. [2025-02-05 15:41:30,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:41:30,223 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 95 [2025-02-05 15:41:30,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:41:30,229 INFO L225 Difference]: With dead ends: 581 [2025-02-05 15:41:30,229 INFO L226 Difference]: Without dead ends: 302 [2025-02-05 15:41:30,230 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:41:30,230 INFO L435 NwaCegarLoop]: 377 mSDtfsCounter, 2 mSDsluCounter, 1120 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1497 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:41:30,234 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1497 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:41:30,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2025-02-05 15:41:30,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 302. [2025-02-05 15:41:30,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 234 states have (on average 1.5555555555555556) internal successors, (364), 239 states have internal predecessors, (364), 50 states have call successors, (50), 15 states have call predecessors, (50), 17 states have return successors, (55), 49 states have call predecessors, (55), 49 states have call successors, (55) [2025-02-05 15:41:30,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 469 transitions. [2025-02-05 15:41:30,258 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 469 transitions. Word has length 95 [2025-02-05 15:41:30,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:41:30,258 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 469 transitions. [2025-02-05 15:41:30,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2025-02-05 15:41:30,259 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 469 transitions. [2025-02-05 15:41:30,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-05 15:41:30,263 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:41:30,264 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:41:30,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 15:41:30,264 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:41:30,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:41:30,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1146323913, now seen corresponding path program 2 times [2025-02-05 15:41:30,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:41:30,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591454998] [2025-02-05 15:41:30,264 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 15:41:30,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:41:30,290 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 96 statements into 2 equivalence classes. [2025-02-05 15:41:30,312 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 96 of 96 statements. [2025-02-05 15:41:30,312 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 15:41:30,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:41:30,378 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-05 15:41:30,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:41:30,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591454998] [2025-02-05 15:41:30,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591454998] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:41:30,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:41:30,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:41:30,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339852093] [2025-02-05 15:41:30,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:41:30,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:41:30,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:41:30,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:41:30,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:41:30,380 INFO L87 Difference]: Start difference. First operand 302 states and 469 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-02-05 15:41:30,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:41:30,421 INFO L93 Difference]: Finished difference Result 579 states and 903 transitions. [2025-02-05 15:41:30,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:41:30,421 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 96 [2025-02-05 15:41:30,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:41:30,423 INFO L225 Difference]: With dead ends: 579 [2025-02-05 15:41:30,423 INFO L226 Difference]: Without dead ends: 302 [2025-02-05 15:41:30,424 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:41:30,425 INFO L435 NwaCegarLoop]: 375 mSDtfsCounter, 2 mSDsluCounter, 1108 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1483 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:41:30,425 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1483 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:41:30,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2025-02-05 15:41:30,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 302. [2025-02-05 15:41:30,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 234 states have (on average 1.5555555555555556) internal successors, (364), 239 states have internal predecessors, (364), 50 states have call successors, (50), 15 states have call predecessors, (50), 17 states have return successors, (54), 49 states have call predecessors, (54), 49 states have call successors, (54) [2025-02-05 15:41:30,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 468 transitions. [2025-02-05 15:41:30,444 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 468 transitions. Word has length 96 [2025-02-05 15:41:30,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:41:30,444 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 468 transitions. [2025-02-05 15:41:30,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-02-05 15:41:30,445 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 468 transitions. [2025-02-05 15:41:30,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-02-05 15:41:30,447 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:41:30,447 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] [2025-02-05 15:41:30,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 15:41:30,448 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:41:30,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:41:30,448 INFO L85 PathProgramCache]: Analyzing trace with hash 2034024590, now seen corresponding path program 3 times [2025-02-05 15:41:30,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:41:30,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096350110] [2025-02-05 15:41:30,448 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 15:41:30,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:41:30,463 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 97 statements into 3 equivalence classes. [2025-02-05 15:41:30,473 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 85 of 97 statements. [2025-02-05 15:41:30,473 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-05 15:41:30,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:41:30,541 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-05 15:41:30,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:41:30,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096350110] [2025-02-05 15:41:30,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096350110] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:41:30,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:41:30,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:41:30,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331372080] [2025-02-05 15:41:30,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:41:30,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:41:30,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:41:30,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:41:30,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:41:30,542 INFO L87 Difference]: Start difference. First operand 302 states and 468 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-02-05 15:41:30,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:41:30,622 INFO L93 Difference]: Finished difference Result 581 states and 909 transitions. [2025-02-05 15:41:30,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:41:30,623 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 97 [2025-02-05 15:41:30,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:41:30,625 INFO L225 Difference]: With dead ends: 581 [2025-02-05 15:41:30,625 INFO L226 Difference]: Without dead ends: 304 [2025-02-05 15:41:30,626 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:41:30,626 INFO L435 NwaCegarLoop]: 378 mSDtfsCounter, 1 mSDsluCounter, 1116 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1494 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:41:30,626 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1494 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:41:30,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2025-02-05 15:41:30,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 304. [2025-02-05 15:41:30,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 235 states have (on average 1.553191489361702) internal successors, (365), 241 states have internal predecessors, (365), 50 states have call successors, (50), 15 states have call predecessors, (50), 18 states have return successors, (59), 49 states have call predecessors, (59), 49 states have call successors, (59) [2025-02-05 15:41:30,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 474 transitions. [2025-02-05 15:41:30,664 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 474 transitions. Word has length 97 [2025-02-05 15:41:30,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:41:30,668 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 474 transitions. [2025-02-05 15:41:30,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-02-05 15:41:30,669 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 474 transitions. [2025-02-05 15:41:30,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-02-05 15:41:30,670 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:41:30,670 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] [2025-02-05 15:41:30,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 15:41:30,671 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:41:30,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:41:30,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1801668966, now seen corresponding path program 1 times [2025-02-05 15:41:30,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:41:30,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802907106] [2025-02-05 15:41:30,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:41:30,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:41:30,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-05 15:41:30,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-05 15:41:30,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:41:30,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:41:30,761 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-05 15:41:30,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:41:30,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802907106] [2025-02-05 15:41:30,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802907106] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:41:30,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:41:30,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:41:30,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685625056] [2025-02-05 15:41:30,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:41:30,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:41:30,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:41:30,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:41:30,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:41:30,762 INFO L87 Difference]: Start difference. First operand 304 states and 474 transitions. Second operand has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2025-02-05 15:41:30,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:41:30,799 INFO L93 Difference]: Finished difference Result 587 states and 919 transitions. [2025-02-05 15:41:30,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:41:30,799 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 98 [2025-02-05 15:41:30,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:41:30,801 INFO L225 Difference]: With dead ends: 587 [2025-02-05 15:41:30,801 INFO L226 Difference]: Without dead ends: 306 [2025-02-05 15:41:30,802 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:41:30,802 INFO L435 NwaCegarLoop]: 378 mSDtfsCounter, 1 mSDsluCounter, 1122 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1500 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:41:30,802 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1500 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:41:30,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2025-02-05 15:41:30,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 306. [2025-02-05 15:41:30,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 236 states have (on average 1.5508474576271187) internal successors, (366), 243 states have internal predecessors, (366), 50 states have call successors, (50), 15 states have call predecessors, (50), 19 states have return successors, (61), 49 states have call predecessors, (61), 49 states have call successors, (61) [2025-02-05 15:41:30,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 477 transitions. [2025-02-05 15:41:30,813 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 477 transitions. Word has length 98 [2025-02-05 15:41:30,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:41:30,813 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 477 transitions. [2025-02-05 15:41:30,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2025-02-05 15:41:30,814 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 477 transitions. [2025-02-05 15:41:30,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-02-05 15:41:30,815 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:41:30,815 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] [2025-02-05 15:41:30,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 15:41:30,815 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:41:30,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:41:30,815 INFO L85 PathProgramCache]: Analyzing trace with hash 2009048705, now seen corresponding path program 1 times [2025-02-05 15:41:30,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:41:30,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267775183] [2025-02-05 15:41:30,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:41:30,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:41:30,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-05 15:41:30,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-05 15:41:30,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:41:30,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:41:30,889 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:41:30,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:41:30,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267775183] [2025-02-05 15:41:30,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267775183] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:41:30,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1052466351] [2025-02-05 15:41:30,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:41:30,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:41:30,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:41:30,891 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:41:30,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-05 15:41:31,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-05 15:41:31,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-05 15:41:31,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:41:31,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:41:31,086 INFO L256 TraceCheckSpWp]: Trace formula consists of 895 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 15:41:31,088 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:41:31,109 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:41:31,109 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:41:31,164 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:41:31,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1052466351] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:41:31,164 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:41:31,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-05 15:41:31,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240440395] [2025-02-05 15:41:31,165 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:41:31,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 15:41:31,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:41:31,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 15:41:31,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:41:31,166 INFO L87 Difference]: Start difference. First operand 306 states and 477 transitions. Second operand has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:41:31,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:41:31,260 INFO L93 Difference]: Finished difference Result 734 states and 1189 transitions. [2025-02-05 15:41:31,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:41:31,260 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 99 [2025-02-05 15:41:31,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:41:31,263 INFO L225 Difference]: With dead ends: 734 [2025-02-05 15:41:31,264 INFO L226 Difference]: Without dead ends: 628 [2025-02-05 15:41:31,264 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:41:31,265 INFO L435 NwaCegarLoop]: 417 mSDtfsCounter, 379 mSDsluCounter, 1296 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 424 SdHoareTripleChecker+Valid, 1713 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:41:31,265 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [424 Valid, 1713 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:41:31,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2025-02-05 15:41:31,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 604. [2025-02-05 15:41:31,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 604 states, 470 states have (on average 1.6148936170212767) internal successors, (759), 477 states have internal predecessors, (759), 114 states have call successors, (114), 15 states have call predecessors, (114), 19 states have return successors, (135), 113 states have call predecessors, (135), 113 states have call successors, (135) [2025-02-05 15:41:31,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 1008 transitions. [2025-02-05 15:41:31,284 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 1008 transitions. Word has length 99 [2025-02-05 15:41:31,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:41:31,285 INFO L471 AbstractCegarLoop]: Abstraction has 604 states and 1008 transitions. [2025-02-05 15:41:31,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:41:31,285 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 1008 transitions. [2025-02-05 15:41:31,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-02-05 15:41:31,288 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:41:31,288 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:41:31,295 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-05 15:41:31,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-02-05 15:41:31,489 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:41:31,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:41:31,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1184594751, now seen corresponding path program 1 times [2025-02-05 15:41:31,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:41:31,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345726273] [2025-02-05 15:41:31,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:41:31,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:41:31,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-02-05 15:41:31,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-02-05 15:41:31,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:41:31,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:41:31,532 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:41:31,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:41:31,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345726273] [2025-02-05 15:41:31,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345726273] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:41:31,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:41:31,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:41:31,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706997999] [2025-02-05 15:41:31,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:41:31,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:41:31,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:41:31,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:41:31,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:41:31,534 INFO L87 Difference]: Start difference. First operand 604 states and 1008 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 15:41:31,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:41:31,560 INFO L93 Difference]: Finished difference Result 1445 states and 2445 transitions. [2025-02-05 15:41:31,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:41:31,561 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 105 [2025-02-05 15:41:31,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:41:31,566 INFO L225 Difference]: With dead ends: 1445 [2025-02-05 15:41:31,566 INFO L226 Difference]: Without dead ends: 907 [2025-02-05 15:41:31,568 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:41:31,569 INFO L435 NwaCegarLoop]: 399 mSDtfsCounter, 97 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:41:31,569 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 780 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:41:31,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 907 states. [2025-02-05 15:41:31,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 907 to 899. [2025-02-05 15:41:31,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 899 states, 701 states have (on average 1.6248216833095577) internal successors, (1139), 708 states have internal predecessors, (1139), 178 states have call successors, (178), 15 states have call predecessors, (178), 19 states have return successors, (209), 177 states have call predecessors, (209), 177 states have call successors, (209) [2025-02-05 15:41:31,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 899 states and 1526 transitions. [2025-02-05 15:41:31,631 INFO L78 Accepts]: Start accepts. Automaton has 899 states and 1526 transitions. Word has length 105 [2025-02-05 15:41:31,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:41:31,631 INFO L471 AbstractCegarLoop]: Abstraction has 899 states and 1526 transitions. [2025-02-05 15:41:31,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 15:41:31,632 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1526 transitions. [2025-02-05 15:41:31,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-02-05 15:41:31,636 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:41:31,636 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:41:31,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 15:41:31,636 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:41:31,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:41:31,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1022035455, now seen corresponding path program 1 times [2025-02-05 15:41:31,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:41:31,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745295025] [2025-02-05 15:41:31,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:41:31,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:41:31,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-02-05 15:41:31,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-02-05 15:41:31,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:41:31,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:41:31,680 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:41:31,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:41:31,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745295025] [2025-02-05 15:41:31,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745295025] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:41:31,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:41:31,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:41:31,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626257284] [2025-02-05 15:41:31,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:41:31,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:41:31,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:41:31,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:41:31,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:41:31,682 INFO L87 Difference]: Start difference. First operand 899 states and 1526 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 15:41:31,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:41:31,721 INFO L93 Difference]: Finished difference Result 2149 states and 3663 transitions. [2025-02-05 15:41:31,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:41:31,722 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 106 [2025-02-05 15:41:31,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:41:31,729 INFO L225 Difference]: With dead ends: 2149 [2025-02-05 15:41:31,729 INFO L226 Difference]: Without dead ends: 1367 [2025-02-05 15:41:31,732 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:41:31,732 INFO L435 NwaCegarLoop]: 385 mSDtfsCounter, 95 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 762 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:41:31,732 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 762 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:41:31,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1367 states. [2025-02-05 15:41:31,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1367 to 1359. [2025-02-05 15:41:31,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1359 states, 1066 states have (on average 1.6303939962476548) internal successors, (1738), 1073 states have internal predecessors, (1738), 273 states have call successors, (273), 15 states have call predecessors, (273), 19 states have return successors, (304), 272 states have call predecessors, (304), 272 states have call successors, (304) [2025-02-05 15:41:31,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1359 states to 1359 states and 2315 transitions. [2025-02-05 15:41:31,787 INFO L78 Accepts]: Start accepts. Automaton has 1359 states and 2315 transitions. Word has length 106 [2025-02-05 15:41:31,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:41:31,788 INFO L471 AbstractCegarLoop]: Abstraction has 1359 states and 2315 transitions. [2025-02-05 15:41:31,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 15:41:31,788 INFO L276 IsEmpty]: Start isEmpty. Operand 1359 states and 2315 transitions. [2025-02-05 15:41:31,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-02-05 15:41:31,794 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:41:31,794 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:41:31,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 15:41:31,794 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:41:31,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:41:31,794 INFO L85 PathProgramCache]: Analyzing trace with hash 724098496, now seen corresponding path program 1 times [2025-02-05 15:41:31,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:41:31,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332287843] [2025-02-05 15:41:31,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:41:31,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:41:31,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-05 15:41:31,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-05 15:41:31,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:41:31,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:41:31,838 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:41:31,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:41:31,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332287843] [2025-02-05 15:41:31,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332287843] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:41:31,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:41:31,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:41:31,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699775333] [2025-02-05 15:41:31,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:41:31,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:41:31,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:41:31,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:41:31,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:41:31,840 INFO L87 Difference]: Start difference. First operand 1359 states and 2315 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 15:41:31,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:41:31,894 INFO L93 Difference]: Finished difference Result 3178 states and 5452 transitions. [2025-02-05 15:41:31,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:41:31,894 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 107 [2025-02-05 15:41:31,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:41:31,904 INFO L225 Difference]: With dead ends: 3178 [2025-02-05 15:41:31,904 INFO L226 Difference]: Without dead ends: 2058 [2025-02-05 15:41:31,907 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:41:31,907 INFO L435 NwaCegarLoop]: 383 mSDtfsCounter, 93 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 757 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:41:31,907 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 757 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:41:31,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2058 states. [2025-02-05 15:41:31,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2058 to 2050. [2025-02-05 15:41:31,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2050 states, 1634 states have (on average 1.635250917992656) internal successors, (2672), 1641 states have internal predecessors, (2672), 396 states have call successors, (396), 15 states have call predecessors, (396), 19 states have return successors, (443), 395 states have call predecessors, (443), 395 states have call successors, (443) [2025-02-05 15:41:31,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2050 states to 2050 states and 3511 transitions. [2025-02-05 15:41:31,980 INFO L78 Accepts]: Start accepts. Automaton has 2050 states and 3511 transitions. Word has length 107 [2025-02-05 15:41:31,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:41:31,980 INFO L471 AbstractCegarLoop]: Abstraction has 2050 states and 3511 transitions. [2025-02-05 15:41:31,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 15:41:31,981 INFO L276 IsEmpty]: Start isEmpty. Operand 2050 states and 3511 transitions. [2025-02-05 15:41:31,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-02-05 15:41:31,987 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:41:31,987 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:41:31,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 15:41:31,987 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:41:31,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:41:31,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1744687776, now seen corresponding path program 1 times [2025-02-05 15:41:31,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:41:31,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973310672] [2025-02-05 15:41:31,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:41:31,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:41:32,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-05 15:41:32,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-05 15:41:32,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:41:32,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:41:32,058 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:41:32,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:41:32,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973310672] [2025-02-05 15:41:32,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973310672] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:41:32,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:41:32,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:41:32,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523465571] [2025-02-05 15:41:32,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:41:32,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:41:32,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:41:32,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:41:32,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:41:32,060 INFO L87 Difference]: Start difference. First operand 2050 states and 3511 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 15:41:32,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:41:32,165 INFO L93 Difference]: Finished difference Result 4766 states and 8218 transitions. [2025-02-05 15:41:32,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:41:32,165 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 108 [2025-02-05 15:41:32,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:41:32,181 INFO L225 Difference]: With dead ends: 4766 [2025-02-05 15:41:32,181 INFO L226 Difference]: Without dead ends: 3155 [2025-02-05 15:41:32,188 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:41:32,188 INFO L435 NwaCegarLoop]: 383 mSDtfsCounter, 91 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 757 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:41:32,189 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 757 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:41:32,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3155 states. [2025-02-05 15:41:32,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3155 to 3147. [2025-02-05 15:41:32,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3147 states, 2552 states have (on average 1.6383228840125392) internal successors, (4181), 2559 states have internal predecessors, (4181), 575 states have call successors, (575), 15 states have call predecessors, (575), 19 states have return successors, (648), 574 states have call predecessors, (648), 574 states have call successors, (648) [2025-02-05 15:41:32,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3147 states to 3147 states and 5404 transitions. [2025-02-05 15:41:32,339 INFO L78 Accepts]: Start accepts. Automaton has 3147 states and 5404 transitions. Word has length 108 [2025-02-05 15:41:32,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:41:32,339 INFO L471 AbstractCegarLoop]: Abstraction has 3147 states and 5404 transitions. [2025-02-05 15:41:32,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 15:41:32,340 INFO L276 IsEmpty]: Start isEmpty. Operand 3147 states and 5404 transitions. [2025-02-05 15:41:32,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-02-05 15:41:32,348 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:41:32,349 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:41:32,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 15:41:32,349 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:41:32,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:41:32,349 INFO L85 PathProgramCache]: Analyzing trace with hash 935454687, now seen corresponding path program 1 times [2025-02-05 15:41:32,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:41:32,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58405068] [2025-02-05 15:41:32,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:41:32,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:41:32,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-05 15:41:32,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-05 15:41:32,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:41:32,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:41:32,400 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:41:32,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:41:32,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58405068] [2025-02-05 15:41:32,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58405068] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:41:32,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:41:32,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:41:32,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24525017] [2025-02-05 15:41:32,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:41:32,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:41:32,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:41:32,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:41:32,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:41:32,402 INFO L87 Difference]: Start difference. First operand 3147 states and 5404 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 15:41:32,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:41:32,557 INFO L93 Difference]: Finished difference Result 7628 states and 13161 transitions. [2025-02-05 15:41:32,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:41:32,558 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 109 [2025-02-05 15:41:32,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:41:32,580 INFO L225 Difference]: With dead ends: 7628 [2025-02-05 15:41:32,580 INFO L226 Difference]: Without dead ends: 5147 [2025-02-05 15:41:32,587 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:41:32,587 INFO L435 NwaCegarLoop]: 392 mSDtfsCounter, 89 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 772 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:41:32,587 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 772 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:41:32,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5147 states. [2025-02-05 15:41:32,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5147 to 5139. [2025-02-05 15:41:32,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5139 states, 4168 states have (on average 1.6300383877159308) internal successors, (6794), 4175 states have internal predecessors, (6794), 951 states have call successors, (951), 15 states have call predecessors, (951), 19 states have return successors, (1068), 950 states have call predecessors, (1068), 950 states have call successors, (1068) [2025-02-05 15:41:32,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5139 states to 5139 states and 8813 transitions. [2025-02-05 15:41:32,803 INFO L78 Accepts]: Start accepts. Automaton has 5139 states and 8813 transitions. Word has length 109 [2025-02-05 15:41:32,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:41:32,803 INFO L471 AbstractCegarLoop]: Abstraction has 5139 states and 8813 transitions. [2025-02-05 15:41:32,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 15:41:32,803 INFO L276 IsEmpty]: Start isEmpty. Operand 5139 states and 8813 transitions. [2025-02-05 15:41:32,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-02-05 15:41:32,815 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:41:32,815 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:41:32,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 15:41:32,816 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:41:32,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:41:32,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1878111873, now seen corresponding path program 1 times [2025-02-05 15:41:32,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:41:32,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891628060] [2025-02-05 15:41:32,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:41:32,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:41:32,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-05 15:41:32,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-05 15:41:32,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:41:32,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:41:32,861 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:41:32,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:41:32,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891628060] [2025-02-05 15:41:32,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891628060] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:41:32,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:41:32,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:41:32,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410614528] [2025-02-05 15:41:32,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:41:32,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:41:32,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:41:32,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:41:32,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:41:32,863 INFO L87 Difference]: Start difference. First operand 5139 states and 8813 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 15:41:33,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:41:33,125 INFO L93 Difference]: Finished difference Result 12665 states and 21854 transitions. [2025-02-05 15:41:33,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:41:33,126 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 110 [2025-02-05 15:41:33,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:41:33,170 INFO L225 Difference]: With dead ends: 12665 [2025-02-05 15:41:33,171 INFO L226 Difference]: Without dead ends: 8563 [2025-02-05 15:41:33,187 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:41:33,188 INFO L435 NwaCegarLoop]: 383 mSDtfsCounter, 87 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 760 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:41:33,188 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 760 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:41:33,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8563 states. [2025-02-05 15:41:33,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8563 to 8555. [2025-02-05 15:41:33,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8555 states, 6978 states have (on average 1.6274004012611063) internal successors, (11356), 6985 states have internal predecessors, (11356), 1557 states have call successors, (1557), 15 states have call predecessors, (1557), 19 states have return successors, (1752), 1556 states have call predecessors, (1752), 1556 states have call successors, (1752) [2025-02-05 15:41:33,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8555 states to 8555 states and 14665 transitions. [2025-02-05 15:41:33,575 INFO L78 Accepts]: Start accepts. Automaton has 8555 states and 14665 transitions. Word has length 110 [2025-02-05 15:41:33,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:41:33,575 INFO L471 AbstractCegarLoop]: Abstraction has 8555 states and 14665 transitions. [2025-02-05 15:41:33,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 15:41:33,576 INFO L276 IsEmpty]: Start isEmpty. Operand 8555 states and 14665 transitions. [2025-02-05 15:41:33,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-02-05 15:41:33,591 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:41:33,591 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:41:33,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 15:41:33,591 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:41:33,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:41:33,592 INFO L85 PathProgramCache]: Analyzing trace with hash 916689310, now seen corresponding path program 1 times [2025-02-05 15:41:33,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:41:33,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116361783] [2025-02-05 15:41:33,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:41:33,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:41:33,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-02-05 15:41:33,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-02-05 15:41:33,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:41:33,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:41:33,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-02-05 15:41:33,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:41:33,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116361783] [2025-02-05 15:41:33,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116361783] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:41:33,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:41:33,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:41:33,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521465874] [2025-02-05 15:41:33,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:41:33,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:41:33,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:41:33,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:41:33,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:41:33,633 INFO L87 Difference]: Start difference. First operand 8555 states and 14665 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 15:41:34,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:41:34,037 INFO L93 Difference]: Finished difference Result 22122 states and 38077 transitions. [2025-02-05 15:41:34,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:41:34,038 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 111 [2025-02-05 15:41:34,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:41:34,103 INFO L225 Difference]: With dead ends: 22122 [2025-02-05 15:41:34,103 INFO L226 Difference]: Without dead ends: 15019 [2025-02-05 15:41:34,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-02-05 15:41:34,140 INFO L435 NwaCegarLoop]: 395 mSDtfsCounter, 85 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 776 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:41:34,140 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 776 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:41:34,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15019 states. [2025-02-05 15:41:34,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15019 to 15011. [2025-02-05 15:41:34,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15011 states, 12231 states have (on average 1.6176109884719156) internal successors, (19785), 12238 states have internal predecessors, (19785), 2760 states have call successors, (2760), 15 states have call predecessors, (2760), 19 states have return successors, (3099), 2759 states have call predecessors, (3099), 2759 states have call successors, (3099) [2025-02-05 15:41:34,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15011 states to 15011 states and 25644 transitions. [2025-02-05 15:41:34,839 INFO L78 Accepts]: Start accepts. Automaton has 15011 states and 25644 transitions. Word has length 111 [2025-02-05 15:41:34,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:41:34,839 INFO L471 AbstractCegarLoop]: Abstraction has 15011 states and 25644 transitions. [2025-02-05 15:41:34,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 15:41:34,840 INFO L276 IsEmpty]: Start isEmpty. Operand 15011 states and 25644 transitions. [2025-02-05 15:41:34,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-02-05 15:41:34,859 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:41:34,859 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:41:34,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 15:41:34,859 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:41:34,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:41:34,859 INFO L85 PathProgramCache]: Analyzing trace with hash 14113570, now seen corresponding path program 1 times [2025-02-05 15:41:34,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:41:34,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761039002] [2025-02-05 15:41:34,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:41:34,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:41:34,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-05 15:41:34,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-05 15:41:34,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:41:34,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:41:34,906 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:41:34,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:41:34,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761039002] [2025-02-05 15:41:34,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761039002] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:41:34,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:41:34,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:41:34,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557832075] [2025-02-05 15:41:34,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:41:34,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:41:34,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:41:34,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:41:34,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:41:34,909 INFO L87 Difference]: Start difference. First operand 15011 states and 25644 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 15:41:35,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:41:35,457 INFO L93 Difference]: Finished difference Result 39683 states and 68125 transitions. [2025-02-05 15:41:35,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:41:35,458 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 112 [2025-02-05 15:41:35,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:41:35,561 INFO L225 Difference]: With dead ends: 39683 [2025-02-05 15:41:35,561 INFO L226 Difference]: Without dead ends: 26723 [2025-02-05 15:41:35,610 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:41:35,611 INFO L435 NwaCegarLoop]: 383 mSDtfsCounter, 83 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 760 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:41:35,611 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 760 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:41:35,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26723 states. [2025-02-05 15:41:36,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26723 to 26715. [2025-02-05 15:41:36,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26715 states, 21896 states have (on average 1.6133997077091706) internal successors, (35327), 21903 states have internal predecessors, (35327), 4799 states have call successors, (4799), 15 states have call predecessors, (4799), 19 states have return successors, (5412), 4798 states have call predecessors, (5412), 4798 states have call successors, (5412) [2025-02-05 15:41:36,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26715 states to 26715 states and 45538 transitions. [2025-02-05 15:41:36,798 INFO L78 Accepts]: Start accepts. Automaton has 26715 states and 45538 transitions. Word has length 112 [2025-02-05 15:41:36,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:41:36,799 INFO L471 AbstractCegarLoop]: Abstraction has 26715 states and 45538 transitions. [2025-02-05 15:41:36,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 15:41:36,799 INFO L276 IsEmpty]: Start isEmpty. Operand 26715 states and 45538 transitions. [2025-02-05 15:41:36,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-02-05 15:41:36,824 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:41:36,824 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:41:36,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 15:41:36,824 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:41:36,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:41:36,825 INFO L85 PathProgramCache]: Analyzing trace with hash -1282962819, now seen corresponding path program 1 times [2025-02-05 15:41:36,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:41:36,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697612789] [2025-02-05 15:41:36,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:41:36,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:41:36,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-02-05 15:41:36,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-02-05 15:41:36,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:41:36,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:41:36,882 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:41:36,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:41:36,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697612789] [2025-02-05 15:41:36,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697612789] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:41:36,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:41:36,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:41:36,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795198894] [2025-02-05 15:41:36,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:41:36,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:41:36,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:41:36,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:41:36,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:41:36,885 INFO L87 Difference]: Start difference. First operand 26715 states and 45538 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 15:41:38,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:41:38,240 INFO L93 Difference]: Finished difference Result 72690 states and 124412 transitions. [2025-02-05 15:41:38,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:41:38,241 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 113 [2025-02-05 15:41:38,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:41:38,417 INFO L225 Difference]: With dead ends: 72690 [2025-02-05 15:41:38,417 INFO L226 Difference]: Without dead ends: 48749 [2025-02-05 15:41:38,477 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:41:38,478 INFO L435 NwaCegarLoop]: 387 mSDtfsCounter, 81 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 764 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:41:38,478 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 764 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:41:38,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48749 states. [2025-02-05 15:41:39,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48749 to 48741. [2025-02-05 15:41:39,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48741 states, 40207 states have (on average 1.607804611137364) internal successors, (64645), 40214 states have internal predecessors, (64645), 8514 states have call successors, (8514), 15 states have call predecessors, (8514), 19 states have return successors, (9659), 8513 states have call predecessors, (9659), 8513 states have call successors, (9659) [2025-02-05 15:41:40,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48741 states to 48741 states and 82818 transitions. [2025-02-05 15:41:40,124 INFO L78 Accepts]: Start accepts. Automaton has 48741 states and 82818 transitions. Word has length 113 [2025-02-05 15:41:40,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:41:40,125 INFO L471 AbstractCegarLoop]: Abstraction has 48741 states and 82818 transitions. [2025-02-05 15:41:40,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 15:41:40,125 INFO L276 IsEmpty]: Start isEmpty. Operand 48741 states and 82818 transitions. [2025-02-05 15:41:40,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-02-05 15:41:40,150 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:41:40,150 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:41:40,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 15:41:40,150 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:41:40,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:41:40,151 INFO L85 PathProgramCache]: Analyzing trace with hash -543710109, now seen corresponding path program 1 times [2025-02-05 15:41:40,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:41:40,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576078799] [2025-02-05 15:41:40,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:41:40,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:41:40,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-02-05 15:41:40,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-02-05 15:41:40,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:41:40,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:41:40,462 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:41:40,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:41:40,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576078799] [2025-02-05 15:41:40,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576078799] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:41:40,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:41:40,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:41:40,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590069575] [2025-02-05 15:41:40,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:41:40,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:41:40,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:41:40,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:41:40,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:41:40,465 INFO L87 Difference]: Start difference. First operand 48741 states and 82818 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 15:41:42,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:41:42,287 INFO L93 Difference]: Finished difference Result 90666 states and 154464 transitions. [2025-02-05 15:41:42,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:41:42,288 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 114 [2025-02-05 15:41:42,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:41:42,654 INFO L225 Difference]: With dead ends: 90666 [2025-02-05 15:41:42,654 INFO L226 Difference]: Without dead ends: 90560 [2025-02-05 15:41:42,703 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:41:42,705 INFO L435 NwaCegarLoop]: 385 mSDtfsCounter, 76 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 766 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:41:42,706 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 766 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:41:42,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90560 states. [2025-02-05 15:41:45,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90560 to 90552. [2025-02-05 15:41:45,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90552 states, 75219 states have (on average 1.6006328188356664) internal successors, (120398), 75226 states have internal predecessors, (120398), 15313 states have call successors, (15313), 15 states have call predecessors, (15313), 19 states have return successors, (17504), 15312 states have call predecessors, (17504), 15312 states have call successors, (17504) [2025-02-05 15:41:46,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90552 states to 90552 states and 153215 transitions. [2025-02-05 15:41:46,064 INFO L78 Accepts]: Start accepts. Automaton has 90552 states and 153215 transitions. Word has length 114 [2025-02-05 15:41:46,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:41:46,065 INFO L471 AbstractCegarLoop]: Abstraction has 90552 states and 153215 transitions. [2025-02-05 15:41:46,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 15:41:46,065 INFO L276 IsEmpty]: Start isEmpty. Operand 90552 states and 153215 transitions. [2025-02-05 15:41:46,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-02-05 15:41:46,085 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:41:46,085 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:41:46,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 15:41:46,085 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:41:46,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:41:46,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1239692060, now seen corresponding path program 1 times [2025-02-05 15:41:46,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:41:46,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603411083] [2025-02-05 15:41:46,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:41:46,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:41:46,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-02-05 15:41:46,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-02-05 15:41:46,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:41:46,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:41:46,340 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:41:46,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:41:46,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603411083] [2025-02-05 15:41:46,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603411083] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:41:46,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:41:46,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-05 15:41:46,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456697262] [2025-02-05 15:41:46,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:41:46,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 15:41:46,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:41:46,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 15:41:46,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-02-05 15:41:46,342 INFO L87 Difference]: Start difference. First operand 90552 states and 153215 transitions. Second operand has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 9 states have internal predecessors, (80), 5 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2025-02-05 15:41:50,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:41:50,447 INFO L93 Difference]: Finished difference Result 180437 states and 310803 transitions. [2025-02-05 15:41:50,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-05 15:41:50,448 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 9 states have internal predecessors, (80), 5 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 115 [2025-02-05 15:41:50,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:41:51,417 INFO L225 Difference]: With dead ends: 180437 [2025-02-05 15:41:51,417 INFO L226 Difference]: Without dead ends: 180339 [2025-02-05 15:41:51,503 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=98, Invalid=364, Unknown=0, NotChecked=0, Total=462 [2025-02-05 15:41:51,504 INFO L435 NwaCegarLoop]: 471 mSDtfsCounter, 965 mSDsluCounter, 3530 mSDsCounter, 0 mSdLazyCounter, 699 mSolverCounterSat, 235 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 965 SdHoareTripleChecker+Valid, 4001 SdHoareTripleChecker+Invalid, 934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 235 IncrementalHoareTripleChecker+Valid, 699 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 15:41:51,504 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [965 Valid, 4001 Invalid, 934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [235 Valid, 699 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 15:41:51,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180339 states. [2025-02-05 15:41:56,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180339 to 180311. [2025-02-05 15:41:57,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180311 states, 149858 states have (on average 1.6015961777149035) internal successors, (240012), 149760 states have internal predecessors, (240012), 30409 states have call successors, (30409), 38 states have call predecessors, (30409), 43 states have return successors, (38058), 30518 states have call predecessors, (38058), 30406 states have call successors, (38058) [2025-02-05 15:41:57,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180311 states to 180311 states and 308479 transitions. [2025-02-05 15:41:57,833 INFO L78 Accepts]: Start accepts. Automaton has 180311 states and 308479 transitions. Word has length 115 [2025-02-05 15:41:57,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:41:57,834 INFO L471 AbstractCegarLoop]: Abstraction has 180311 states and 308479 transitions. [2025-02-05 15:41:57,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 9 states have internal predecessors, (80), 5 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2025-02-05 15:41:57,834 INFO L276 IsEmpty]: Start isEmpty. Operand 180311 states and 308479 transitions. [2025-02-05 15:41:58,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-02-05 15:41:58,403 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:41:58,403 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:41:58,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 15:41:58,404 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:41:58,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:41:58,405 INFO L85 PathProgramCache]: Analyzing trace with hash -599660815, now seen corresponding path program 1 times [2025-02-05 15:41:58,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:41:58,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818807964] [2025-02-05 15:41:58,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:41:58,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:41:58,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-05 15:41:58,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-05 15:41:58,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:41:58,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:41:58,494 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:41:58,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:41:58,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818807964] [2025-02-05 15:41:58,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818807964] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:41:58,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:41:58,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:41:58,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471959829] [2025-02-05 15:41:58,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:41:58,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:41:58,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:41:58,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:41:58,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:41:58,496 INFO L87 Difference]: Start difference. First operand 180311 states and 308479 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10)