./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec1_product28.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/email_spec1_product28.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 25a137cac87a0e16e274f725e7bbd21e6c99dd9079b93c306fff086ae4fee1e1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 05:31:21,908 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 05:31:21,951 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 05:31:21,955 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 05:31:21,955 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 05:31:21,979 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 05:31:21,979 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 05:31:21,979 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 05:31:21,979 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 05:31:21,979 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 05:31:21,979 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 05:31:21,980 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 05:31:21,980 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 05:31:21,980 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 05:31:21,980 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 05:31:21,980 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 05:31:21,980 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 05:31:21,980 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 05:31:21,980 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 05:31:21,980 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 05:31:21,980 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 05:31:21,980 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 05:31:21,980 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 05:31:21,980 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 05:31:21,980 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 05:31:21,980 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 05:31:21,980 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 05:31:21,981 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 05:31:21,981 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 05:31:21,981 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 05:31:21,981 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 05:31:21,981 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 05:31:21,981 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:31:21,981 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 05:31:21,981 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 05:31:21,981 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 05:31:21,981 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 05:31:21,981 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 05:31:21,981 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 05:31:21,981 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 05:31:21,981 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 05:31:21,981 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 05:31:21,981 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 05:31:21,981 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 25a137cac87a0e16e274f725e7bbd21e6c99dd9079b93c306fff086ae4fee1e1 [2025-03-08 05:31:22,194 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 05:31:22,200 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 05:31:22,202 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 05:31:22,204 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 05:31:22,204 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 05:31:22,205 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec1_product28.cil.c [2025-03-08 05:31:23,353 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6b111920/5d90bf8943dc4894b5c84fe9d30cfc18/FLAGa30c915d4 [2025-03-08 05:31:23,720 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 05:31:23,721 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec1_product28.cil.c [2025-03-08 05:31:23,745 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6b111920/5d90bf8943dc4894b5c84fe9d30cfc18/FLAGa30c915d4 [2025-03-08 05:31:23,949 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6b111920/5d90bf8943dc4894b5c84fe9d30cfc18 [2025-03-08 05:31:23,951 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 05:31:23,953 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 05:31:23,955 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 05:31:23,955 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 05:31:23,958 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 05:31:23,959 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:31:23" (1/1) ... [2025-03-08 05:31:23,960 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@227ec695 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:31:23, skipping insertion in model container [2025-03-08 05:31:23,961 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:31:23" (1/1) ... [2025-03-08 05:31:24,006 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 05:31:24,372 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec1_product28.cil.c[51091,51104] [2025-03-08 05:31:24,400 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:31:24,412 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 05:31:24,418 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [48] [2025-03-08 05:31:24,419 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [1128] [2025-03-08 05:31:24,419 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [1494] [2025-03-08 05:31:24,419 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [1512] [2025-03-08 05:31:24,419 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"AddressBookEncrypt_spec.i","") [1561] [2025-03-08 05:31:24,419 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [1592] [2025-03-08 05:31:24,419 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [1739] [2025-03-08 05:31:24,419 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [2019] [2025-03-08 05:31:24,419 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [2232] [2025-03-08 05:31:24,419 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [2241] [2025-03-08 05:31:24,419 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [2643] [2025-03-08 05:31:24,481 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec1_product28.cil.c[51091,51104] [2025-03-08 05:31:24,497 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:31:24,521 INFO L204 MainTranslator]: Completed translation [2025-03-08 05:31:24,522 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:31:24 WrapperNode [2025-03-08 05:31:24,522 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 05:31:24,523 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 05:31:24,523 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 05:31:24,523 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 05:31:24,528 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:31:24" (1/1) ... [2025-03-08 05:31:24,557 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:31:24" (1/1) ... [2025-03-08 05:31:24,600 INFO L138 Inliner]: procedures = 128, calls = 196, calls flagged for inlining = 55, calls inlined = 45, statements flattened = 856 [2025-03-08 05:31:24,601 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 05:31:24,602 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 05:31:24,602 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 05:31:24,602 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 05:31:24,608 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:31:24" (1/1) ... [2025-03-08 05:31:24,609 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:31:24" (1/1) ... [2025-03-08 05:31:24,612 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:31:24" (1/1) ... [2025-03-08 05:31:24,636 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 4, 4, 4]. 29 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 4, 4, 4]. The 0 writes are split as follows [0, 0, 0, 0]. [2025-03-08 05:31:24,640 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:31:24" (1/1) ... [2025-03-08 05:31:24,641 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:31:24" (1/1) ... [2025-03-08 05:31:24,651 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:31:24" (1/1) ... [2025-03-08 05:31:24,652 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:31:24" (1/1) ... [2025-03-08 05:31:24,654 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:31:24" (1/1) ... [2025-03-08 05:31:24,655 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:31:24" (1/1) ... [2025-03-08 05:31:24,663 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 05:31:24,664 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 05:31:24,664 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 05:31:24,664 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 05:31:24,664 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:31:24" (1/1) ... [2025-03-08 05:31:24,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:31:24,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:31:24,693 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 05:31:24,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 05:31:24,712 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2025-03-08 05:31:24,712 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2025-03-08 05:31:24,712 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2025-03-08 05:31:24,712 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2025-03-08 05:31:24,712 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2025-03-08 05:31:24,712 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2025-03-08 05:31:24,712 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-03-08 05:31:24,712 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-03-08 05:31:24,712 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-03-08 05:31:24,712 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-03-08 05:31:24,712 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2025-03-08 05:31:24,712 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2025-03-08 05:31:24,712 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-03-08 05:31:24,712 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-03-08 05:31:24,712 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2025-03-08 05:31:24,712 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2025-03-08 05:31:24,712 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2025-03-08 05:31:24,712 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2025-03-08 05:31:24,712 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-03-08 05:31:24,712 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-03-08 05:31:24,713 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-03-08 05:31:24,713 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-03-08 05:31:24,713 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-03-08 05:31:24,713 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-03-08 05:31:24,713 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 05:31:24,713 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2025-03-08 05:31:24,713 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2025-03-08 05:31:24,713 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2025-03-08 05:31:24,713 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2025-03-08 05:31:24,713 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-03-08 05:31:24,713 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-03-08 05:31:24,713 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-03-08 05:31:24,713 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-03-08 05:31:24,713 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-03-08 05:31:24,713 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-03-08 05:31:24,713 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2025-03-08 05:31:24,713 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2025-03-08 05:31:24,713 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-03-08 05:31:24,713 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-03-08 05:31:24,713 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2025-03-08 05:31:24,713 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2025-03-08 05:31:24,713 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-03-08 05:31:24,713 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-03-08 05:31:24,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 05:31:24,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 05:31:24,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 05:31:24,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 05:31:24,713 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-03-08 05:31:24,713 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-03-08 05:31:24,713 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 05:31:24,713 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 05:31:24,865 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 05:31:24,867 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 05:31:25,045 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1105-1: getClientId_#res#1 := getClientId_~retValue_acc~16#1; [2025-03-08 05:31:25,053 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2550: #res := ~retValue_acc~36; [2025-03-08 05:31:25,066 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2881: #res := ~retValue_acc~43; [2025-03-08 05:31:25,104 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L762: #res#1 := ~retValue_acc~11#1; [2025-03-08 05:31:25,104 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L717-1: getClientKeyringSize_#res#1 := getClientKeyringSize_~retValue_acc~10#1; [2025-03-08 05:31:25,157 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L986: #res := ~retValue_acc~14; [2025-03-08 05:31:25,167 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L670: #res := ~retValue_acc~9; [2025-03-08 05:31:25,185 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1736-1: createEmail_#res#1 := createEmail_~retValue_acc~26#1; [2025-03-08 05:31:25,197 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2476: #res := ~retValue_acc~34; [2025-03-08 05:31:25,211 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2513: #res := ~retValue_acc~35; [2025-03-08 05:31:25,217 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2587: #res := ~retValue_acc~37; [2025-03-08 05:31:25,231 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2361: #res := ~retValue_acc~31; [2025-03-08 05:31:25,455 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1558-1: valid_product_#res#1 := valid_product_~retValue_acc~22#1; [2025-03-08 05:31:25,455 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2838-1: is_queue_empty_#res#1 := is_queue_empty_~retValue_acc~40#1; [2025-03-08 05:31:25,455 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2847-1: get_queued_client_#res#1 := get_queued_client_~retValue_acc~41#1; [2025-03-08 05:31:25,455 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2856-1: get_queued_email_#res#1 := get_queued_email_~retValue_acc~42#1; [2025-03-08 05:31:25,455 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L932-1: getClientKeyringPublicKey_#res#1 := getClientKeyringPublicKey_~retValue_acc~13#1; [2025-03-08 05:31:25,455 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L825-1: getClientKeyringUser_#res#1 := getClientKeyringUser_~retValue_acc~12#1; [2025-03-08 05:31:25,462 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2324: #res := ~retValue_acc~30; [2025-03-08 05:31:25,480 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1712: #res#1 := ~retValue_acc~24#1; [2025-03-08 05:31:25,481 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1692-1: isReadable__wrappee__Keys_#res#1 := isReadable__wrappee__Keys_~retValue_acc~23#1; [2025-03-08 05:31:25,577 INFO L? ?]: Removed 398 outVars from TransFormulas that were not future-live. [2025-03-08 05:31:25,578 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 05:31:25,588 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 05:31:25,589 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 05:31:25,589 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:31:25 BoogieIcfgContainer [2025-03-08 05:31:25,589 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 05:31:25,591 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 05:31:25,591 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 05:31:25,594 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 05:31:25,594 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:31:23" (1/3) ... [2025-03-08 05:31:25,595 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60c2e5d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:31:25, skipping insertion in model container [2025-03-08 05:31:25,595 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:31:24" (2/3) ... [2025-03-08 05:31:25,595 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60c2e5d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:31:25, skipping insertion in model container [2025-03-08 05:31:25,595 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:31:25" (3/3) ... [2025-03-08 05:31:25,596 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec1_product28.cil.c [2025-03-08 05:31:25,607 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 05:31:25,611 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec1_product28.cil.c that has 23 procedures, 325 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 05:31:25,655 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 05:31:25,666 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;@1e209a7e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 05:31:25,667 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 05:31:25,670 INFO L276 IsEmpty]: Start isEmpty. Operand has 325 states, 251 states have (on average 1.5219123505976095) internal successors, (382), 255 states have internal predecessors, (382), 50 states have call successors, (50), 22 states have call predecessors, (50), 22 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-08 05:31:25,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-08 05:31:25,683 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:31:25,684 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:31:25,684 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:31:25,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:31:25,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1155878964, now seen corresponding path program 1 times [2025-03-08 05:31:25,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:31:25,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584327023] [2025-03-08 05:31:25,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:31:25,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:31:25,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-08 05:31:25,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-08 05:31:25,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:31:25,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:31:26,218 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-08 05:31:26,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:31:26,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584327023] [2025-03-08 05:31:26,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584327023] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:31:26,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1359274672] [2025-03-08 05:31:26,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:31:26,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:31:26,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:31:26,225 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:31:26,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 05:31:26,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-08 05:31:26,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-08 05:31:26,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:31:26,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:31:26,465 INFO L256 TraceCheckSpWp]: Trace formula consists of 975 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 05:31:26,470 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:31:26,501 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-08 05:31:26,501 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:31:26,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1359274672] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:31:26,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:31:26,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-08 05:31:26,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001103830] [2025-03-08 05:31:26,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:31:26,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:31:26,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:31:26,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:31:26,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:31:26,530 INFO L87 Difference]: Start difference. First operand has 325 states, 251 states have (on average 1.5219123505976095) internal successors, (382), 255 states have internal predecessors, (382), 50 states have call successors, (50), 22 states have call predecessors, (50), 22 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 05:31:26,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:31:26,603 INFO L93 Difference]: Finished difference Result 504 states and 732 transitions. [2025-03-08 05:31:26,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:31:26,605 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 98 [2025-03-08 05:31:26,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:31:26,616 INFO L225 Difference]: With dead ends: 504 [2025-03-08 05:31:26,616 INFO L226 Difference]: Without dead ends: 319 [2025-03-08 05:31:26,620 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:31:26,622 INFO L435 NwaCegarLoop]: 478 mSDtfsCounter, 0 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 953 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:31:26,622 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 953 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:31:26,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2025-03-08 05:31:26,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 319. [2025-03-08 05:31:26,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 246 states have (on average 1.516260162601626) internal successors, (373), 249 states have internal predecessors, (373), 50 states have call successors, (50), 22 states have call predecessors, (50), 22 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2025-03-08 05:31:26,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 472 transitions. [2025-03-08 05:31:26,673 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 472 transitions. Word has length 98 [2025-03-08 05:31:26,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:31:26,674 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 472 transitions. [2025-03-08 05:31:26,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 05:31:26,675 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 472 transitions. [2025-03-08 05:31:26,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-08 05:31:26,681 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:31:26,682 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:31:26,690 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 05:31:26,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 05:31:26,883 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:31:26,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:31:26,883 INFO L85 PathProgramCache]: Analyzing trace with hash 530946236, now seen corresponding path program 1 times [2025-03-08 05:31:26,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:31:26,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004345658] [2025-03-08 05:31:26,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:31:26,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:31:26,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-08 05:31:26,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-08 05:31:26,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:31:26,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:31:27,096 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-08 05:31:27,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:31:27,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004345658] [2025-03-08 05:31:27,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004345658] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:31:27,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1588288218] [2025-03-08 05:31:27,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:31:27,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:31:27,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:31:27,101 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:31:27,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 05:31:27,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-08 05:31:27,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-08 05:31:27,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:31:27,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:31:27,347 INFO L256 TraceCheckSpWp]: Trace formula consists of 986 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 05:31:27,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:31:27,371 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-08 05:31:27,372 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:31:27,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1588288218] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:31:27,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:31:27,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-08 05:31:27,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340966805] [2025-03-08 05:31:27,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:31:27,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:31:27,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:31:27,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:31:27,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:31:27,374 INFO L87 Difference]: Start difference. First operand 319 states and 472 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 05:31:27,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:31:27,420 INFO L93 Difference]: Finished difference Result 662 states and 994 transitions. [2025-03-08 05:31:27,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:31:27,421 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 102 [2025-03-08 05:31:27,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:31:27,425 INFO L225 Difference]: With dead ends: 662 [2025-03-08 05:31:27,426 INFO L226 Difference]: Without dead ends: 369 [2025-03-08 05:31:27,427 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:31:27,429 INFO L435 NwaCegarLoop]: 480 mSDtfsCounter, 99 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 903 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:31:27,429 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 903 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:31:27,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2025-03-08 05:31:27,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 361. [2025-03-08 05:31:27,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 277 states have (on average 1.5342960288808665) internal successors, (425), 280 states have internal predecessors, (425), 61 states have call successors, (61), 22 states have call predecessors, (61), 22 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-08 05:31:27,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 546 transitions. [2025-03-08 05:31:27,464 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 546 transitions. Word has length 102 [2025-03-08 05:31:27,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:31:27,466 INFO L471 AbstractCegarLoop]: Abstraction has 361 states and 546 transitions. [2025-03-08 05:31:27,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 05:31:27,466 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 546 transitions. [2025-03-08 05:31:27,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-08 05:31:27,468 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:31:27,468 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:31:27,477 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 05:31:27,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-08 05:31:27,669 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:31:27,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:31:27,670 INFO L85 PathProgramCache]: Analyzing trace with hash 2142803396, now seen corresponding path program 1 times [2025-03-08 05:31:27,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:31:27,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776043748] [2025-03-08 05:31:27,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:31:27,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:31:27,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-08 05:31:27,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-08 05:31:27,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:31:27,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:31:27,862 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-08 05:31:27,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:31:27,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776043748] [2025-03-08 05:31:27,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776043748] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:31:27,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1619115954] [2025-03-08 05:31:27,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:31:27,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:31:27,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:31:27,866 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:31:27,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 05:31:27,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-08 05:31:28,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-08 05:31:28,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:31:28,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:31:28,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 991 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 05:31:28,114 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:31:28,169 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 05:31:28,171 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:31:28,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1619115954] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:31:28,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:31:28,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-03-08 05:31:28,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799235267] [2025-03-08 05:31:28,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:31:28,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:31:28,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:31:28,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:31:28,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:31:28,174 INFO L87 Difference]: Start difference. First operand 361 states and 546 transitions. Second operand has 5 states, 4 states have (on average 17.75) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-08 05:31:28,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:31:28,258 INFO L93 Difference]: Finished difference Result 713 states and 1082 transitions. [2025-03-08 05:31:28,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:31:28,260 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.75) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 103 [2025-03-08 05:31:28,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:31:28,262 INFO L225 Difference]: With dead ends: 713 [2025-03-08 05:31:28,263 INFO L226 Difference]: Without dead ends: 363 [2025-03-08 05:31:28,264 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:31:28,265 INFO L435 NwaCegarLoop]: 463 mSDtfsCounter, 2 mSDsluCounter, 1378 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1841 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:31:28,265 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1841 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:31:28,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2025-03-08 05:31:28,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 363. [2025-03-08 05:31:28,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 278 states have (on average 1.5323741007194245) internal successors, (426), 282 states have internal predecessors, (426), 61 states have call successors, (61), 22 states have call predecessors, (61), 23 states have return successors, (62), 60 states have call predecessors, (62), 60 states have call successors, (62) [2025-03-08 05:31:28,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 549 transitions. [2025-03-08 05:31:28,278 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 549 transitions. Word has length 103 [2025-03-08 05:31:28,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:31:28,279 INFO L471 AbstractCegarLoop]: Abstraction has 363 states and 549 transitions. [2025-03-08 05:31:28,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.75) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-08 05:31:28,279 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 549 transitions. [2025-03-08 05:31:28,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-08 05:31:28,280 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:31:28,281 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:31:28,288 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 05:31:28,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:31:28,481 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:31:28,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:31:28,482 INFO L85 PathProgramCache]: Analyzing trace with hash -1474209125, now seen corresponding path program 1 times [2025-03-08 05:31:28,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:31:28,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876151723] [2025-03-08 05:31:28,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:31:28,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:31:28,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-08 05:31:28,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-08 05:31:28,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:31:28,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:31:28,641 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-08 05:31:28,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:31:28,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876151723] [2025-03-08 05:31:28,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876151723] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:31:28,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1382612810] [2025-03-08 05:31:28,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:31:28,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:31:28,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:31:28,643 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:31:28,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 05:31:28,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-08 05:31:28,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-08 05:31:28,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:31:28,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:31:28,856 INFO L256 TraceCheckSpWp]: Trace formula consists of 992 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 05:31:28,859 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:31:28,896 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 05:31:28,896 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:31:28,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1382612810] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:31:28,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:31:28,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-03-08 05:31:28,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223156399] [2025-03-08 05:31:28,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:31:28,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:31:28,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:31:28,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:31:28,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-08 05:31:28,898 INFO L87 Difference]: Start difference. First operand 363 states and 549 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-08 05:31:28,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:31:28,952 INFO L93 Difference]: Finished difference Result 715 states and 1087 transitions. [2025-03-08 05:31:28,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:31:28,953 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 104 [2025-03-08 05:31:28,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:31:28,956 INFO L225 Difference]: With dead ends: 715 [2025-03-08 05:31:28,956 INFO L226 Difference]: Without dead ends: 365 [2025-03-08 05:31:28,958 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-08 05:31:28,959 INFO L435 NwaCegarLoop]: 461 mSDtfsCounter, 2 mSDsluCounter, 1366 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1827 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:31:28,959 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1827 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:31:28,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2025-03-08 05:31:28,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 365. [2025-03-08 05:31:28,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 279 states have (on average 1.5304659498207884) internal successors, (427), 284 states have internal predecessors, (427), 61 states have call successors, (61), 22 states have call predecessors, (61), 24 states have return successors, (67), 60 states have call predecessors, (67), 60 states have call successors, (67) [2025-03-08 05:31:28,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 555 transitions. [2025-03-08 05:31:28,982 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 555 transitions. Word has length 104 [2025-03-08 05:31:28,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:31:28,982 INFO L471 AbstractCegarLoop]: Abstraction has 365 states and 555 transitions. [2025-03-08 05:31:28,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-08 05:31:28,983 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 555 transitions. [2025-03-08 05:31:28,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-08 05:31:28,986 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:31:28,986 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-03-08 05:31:28,994 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 05:31:29,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:31:29,187 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:31:29,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:31:29,187 INFO L85 PathProgramCache]: Analyzing trace with hash -254539061, now seen corresponding path program 1 times [2025-03-08 05:31:29,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:31:29,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552951600] [2025-03-08 05:31:29,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:31:29,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:31:29,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-08 05:31:29,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-08 05:31:29,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:31:29,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:31:29,305 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-08 05:31:29,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:31:29,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552951600] [2025-03-08 05:31:29,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552951600] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:31:29,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:31:29,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:31:29,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539304376] [2025-03-08 05:31:29,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:31:29,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:31:29,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:31:29,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:31:29,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:31:29,307 INFO L87 Difference]: Start difference. First operand 365 states and 555 transitions. Second operand has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 states have internal predecessors, (69), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-08 05:31:29,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:31:29,347 INFO L93 Difference]: Finished difference Result 707 states and 1078 transitions. [2025-03-08 05:31:29,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:31:29,347 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 states have internal predecessors, (69), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 105 [2025-03-08 05:31:29,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:31:29,350 INFO L225 Difference]: With dead ends: 707 [2025-03-08 05:31:29,350 INFO L226 Difference]: Without dead ends: 365 [2025-03-08 05:31:29,352 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:31:29,353 INFO L435 NwaCegarLoop]: 464 mSDtfsCounter, 2 mSDsluCounter, 1381 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1845 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:31:29,353 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1845 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:31:29,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2025-03-08 05:31:29,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 365. [2025-03-08 05:31:29,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 279 states have (on average 1.5304659498207884) internal successors, (427), 284 states have internal predecessors, (427), 61 states have call successors, (61), 22 states have call predecessors, (61), 24 states have return successors, (66), 60 states have call predecessors, (66), 60 states have call successors, (66) [2025-03-08 05:31:29,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 554 transitions. [2025-03-08 05:31:29,373 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 554 transitions. Word has length 105 [2025-03-08 05:31:29,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:31:29,374 INFO L471 AbstractCegarLoop]: Abstraction has 365 states and 554 transitions. [2025-03-08 05:31:29,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 states have internal predecessors, (69), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-08 05:31:29,376 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 554 transitions. [2025-03-08 05:31:29,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-08 05:31:29,377 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:31:29,377 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:31:29,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 05:31:29,378 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:31:29,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:31:29,378 INFO L85 PathProgramCache]: Analyzing trace with hash -629024124, now seen corresponding path program 2 times [2025-03-08 05:31:29,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:31:29,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337640927] [2025-03-08 05:31:29,378 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:31:29,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:31:29,395 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 106 statements into 2 equivalence classes. [2025-03-08 05:31:29,406 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 106 of 106 statements. [2025-03-08 05:31:29,406 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 05:31:29,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:31:29,483 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-08 05:31:29,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:31:29,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337640927] [2025-03-08 05:31:29,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337640927] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:31:29,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:31:29,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:31:29,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996316792] [2025-03-08 05:31:29,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:31:29,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:31:29,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:31:29,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:31:29,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:31:29,485 INFO L87 Difference]: Start difference. First operand 365 states and 554 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-08 05:31:29,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:31:29,529 INFO L93 Difference]: Finished difference Result 705 states and 1073 transitions. [2025-03-08 05:31:29,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:31:29,530 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 106 [2025-03-08 05:31:29,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:31:29,532 INFO L225 Difference]: With dead ends: 705 [2025-03-08 05:31:29,532 INFO L226 Difference]: Without dead ends: 365 [2025-03-08 05:31:29,534 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:31:29,534 INFO L435 NwaCegarLoop]: 462 mSDtfsCounter, 2 mSDsluCounter, 1369 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1831 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:31:29,534 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1831 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:31:29,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2025-03-08 05:31:29,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 365. [2025-03-08 05:31:29,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 279 states have (on average 1.5304659498207884) internal successors, (427), 284 states have internal predecessors, (427), 61 states have call successors, (61), 22 states have call predecessors, (61), 24 states have return successors, (65), 60 states have call predecessors, (65), 60 states have call successors, (65) [2025-03-08 05:31:29,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 553 transitions. [2025-03-08 05:31:29,547 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 553 transitions. Word has length 106 [2025-03-08 05:31:29,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:31:29,547 INFO L471 AbstractCegarLoop]: Abstraction has 365 states and 553 transitions. [2025-03-08 05:31:29,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-08 05:31:29,548 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 553 transitions. [2025-03-08 05:31:29,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-08 05:31:29,549 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:31:29,549 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:31:29,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 05:31:29,549 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:31:29,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:31:29,550 INFO L85 PathProgramCache]: Analyzing trace with hash 22996182, now seen corresponding path program 3 times [2025-03-08 05:31:29,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:31:29,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369715219] [2025-03-08 05:31:29,550 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 05:31:29,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:31:29,565 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 107 statements into 3 equivalence classes. [2025-03-08 05:31:29,574 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 95 of 107 statements. [2025-03-08 05:31:29,575 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-08 05:31:29,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:31:29,651 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-08 05:31:29,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:31:29,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369715219] [2025-03-08 05:31:29,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369715219] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:31:29,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:31:29,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:31:29,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950781031] [2025-03-08 05:31:29,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:31:29,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:31:29,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:31:29,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:31:29,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:31:29,653 INFO L87 Difference]: Start difference. First operand 365 states and 553 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-08 05:31:29,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:31:29,704 INFO L93 Difference]: Finished difference Result 707 states and 1079 transitions. [2025-03-08 05:31:29,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:31:29,705 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 107 [2025-03-08 05:31:29,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:31:29,708 INFO L225 Difference]: With dead ends: 707 [2025-03-08 05:31:29,708 INFO L226 Difference]: Without dead ends: 367 [2025-03-08 05:31:29,709 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:31:29,710 INFO L435 NwaCegarLoop]: 465 mSDtfsCounter, 1 mSDsluCounter, 1377 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1842 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:31:29,710 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1842 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:31:29,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2025-03-08 05:31:29,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 367. [2025-03-08 05:31:29,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 280 states have (on average 1.5285714285714285) internal successors, (428), 286 states have internal predecessors, (428), 61 states have call successors, (61), 22 states have call predecessors, (61), 25 states have return successors, (70), 60 states have call predecessors, (70), 60 states have call successors, (70) [2025-03-08 05:31:29,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 559 transitions. [2025-03-08 05:31:29,727 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 559 transitions. Word has length 107 [2025-03-08 05:31:29,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:31:29,727 INFO L471 AbstractCegarLoop]: Abstraction has 367 states and 559 transitions. [2025-03-08 05:31:29,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-08 05:31:29,728 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 559 transitions. [2025-03-08 05:31:29,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-08 05:31:29,729 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:31:29,730 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:31:29,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 05:31:29,730 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:31:29,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:31:29,731 INFO L85 PathProgramCache]: Analyzing trace with hash 797150343, now seen corresponding path program 1 times [2025-03-08 05:31:29,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:31:29,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064021590] [2025-03-08 05:31:29,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:31:29,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:31:29,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-08 05:31:29,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-08 05:31:29,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:31:29,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:31:29,843 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-08 05:31:29,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:31:29,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064021590] [2025-03-08 05:31:29,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064021590] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:31:29,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:31:29,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:31:29,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972514794] [2025-03-08 05:31:29,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:31:29,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:31:29,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:31:29,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:31:29,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:31:29,845 INFO L87 Difference]: Start difference. First operand 367 states and 559 transitions. Second operand has 5 states, 4 states have (on average 18.0) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-08 05:31:29,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:31:29,885 INFO L93 Difference]: Finished difference Result 713 states and 1089 transitions. [2025-03-08 05:31:29,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:31:29,886 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 18.0) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 108 [2025-03-08 05:31:29,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:31:29,890 INFO L225 Difference]: With dead ends: 713 [2025-03-08 05:31:29,890 INFO L226 Difference]: Without dead ends: 369 [2025-03-08 05:31:29,891 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:31:29,892 INFO L435 NwaCegarLoop]: 465 mSDtfsCounter, 1 mSDsluCounter, 1383 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1848 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:31:29,892 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1848 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:31:29,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2025-03-08 05:31:29,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 369. [2025-03-08 05:31:29,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 281 states have (on average 1.5266903914590748) internal successors, (429), 288 states have internal predecessors, (429), 61 states have call successors, (61), 22 states have call predecessors, (61), 26 states have return successors, (72), 60 states have call predecessors, (72), 60 states have call successors, (72) [2025-03-08 05:31:29,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 562 transitions. [2025-03-08 05:31:29,907 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 562 transitions. Word has length 108 [2025-03-08 05:31:29,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:31:29,907 INFO L471 AbstractCegarLoop]: Abstraction has 369 states and 562 transitions. [2025-03-08 05:31:29,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 18.0) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-08 05:31:29,908 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 562 transitions. [2025-03-08 05:31:29,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-08 05:31:29,910 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:31:29,910 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-03-08 05:31:29,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 05:31:29,910 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:31:29,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:31:29,911 INFO L85 PathProgramCache]: Analyzing trace with hash 994929393, now seen corresponding path program 1 times [2025-03-08 05:31:29,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:31:29,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570976989] [2025-03-08 05:31:29,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:31:29,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:31:29,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-08 05:31:29,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-08 05:31:29,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:31:29,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:31:30,006 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:31:30,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:31:30,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570976989] [2025-03-08 05:31:30,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570976989] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:31:30,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [762319782] [2025-03-08 05:31:30,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:31:30,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:31:30,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:31:30,009 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:31:30,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 05:31:30,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-08 05:31:30,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-08 05:31:30,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:31:30,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:31:30,232 INFO L256 TraceCheckSpWp]: Trace formula consists of 997 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 05:31:30,235 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:31:30,252 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:31:30,252 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:31:30,313 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:31:30,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [762319782] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:31:30,317 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:31:30,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-08 05:31:30,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065176860] [2025-03-08 05:31:30,318 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:31:30,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:31:30,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:31:30,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:31:30,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:31:30,319 INFO L87 Difference]: Start difference. First operand 369 states and 562 transitions. Second operand has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 05:31:30,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:31:30,435 INFO L93 Difference]: Finished difference Result 857 states and 1356 transitions. [2025-03-08 05:31:30,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:31:30,436 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 109 [2025-03-08 05:31:30,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:31:30,441 INFO L225 Difference]: With dead ends: 857 [2025-03-08 05:31:30,441 INFO L226 Difference]: Without dead ends: 685 [2025-03-08 05:31:30,444 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:31:30,445 INFO L435 NwaCegarLoop]: 506 mSDtfsCounter, 291 mSDsluCounter, 2076 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 2582 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:31:30,445 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 2582 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:31:30,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2025-03-08 05:31:30,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 661. [2025-03-08 05:31:30,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 661 states, 509 states have (on average 1.6031434184675835) internal successors, (816), 516 states have internal predecessors, (816), 125 states have call successors, (125), 22 states have call predecessors, (125), 26 states have return successors, (146), 124 states have call predecessors, (146), 124 states have call successors, (146) [2025-03-08 05:31:30,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 1087 transitions. [2025-03-08 05:31:30,490 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 1087 transitions. Word has length 109 [2025-03-08 05:31:30,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:31:30,491 INFO L471 AbstractCegarLoop]: Abstraction has 661 states and 1087 transitions. [2025-03-08 05:31:30,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 05:31:30,491 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 1087 transitions. [2025-03-08 05:31:30,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-08 05:31:30,495 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:31:30,495 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-03-08 05:31:30,504 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-08 05:31:30,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:31:30,699 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:31:30,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:31:30,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1225426018, now seen corresponding path program 1 times [2025-03-08 05:31:30,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:31:30,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948951610] [2025-03-08 05:31:30,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:31:30,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:31:30,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-08 05:31:30,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-08 05:31:30,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:31:30,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:31:30,753 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:31:30,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:31:30,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948951610] [2025-03-08 05:31:30,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948951610] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:31:30,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:31:30,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:31:30,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479126075] [2025-03-08 05:31:30,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:31:30,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:31:30,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:31:30,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:31:30,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:31:30,755 INFO L87 Difference]: Start difference. First operand 661 states and 1087 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, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 05:31:30,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:31:30,792 INFO L93 Difference]: Finished difference Result 1554 states and 2598 transitions. [2025-03-08 05:31:30,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:31:30,793 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, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 116 [2025-03-08 05:31:30,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:31:30,799 INFO L225 Difference]: With dead ends: 1554 [2025-03-08 05:31:30,799 INFO L226 Difference]: Without dead ends: 957 [2025-03-08 05:31:30,801 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:31:30,802 INFO L435 NwaCegarLoop]: 477 mSDtfsCounter, 97 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 943 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:31:30,802 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 943 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:31:30,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 957 states. [2025-03-08 05:31:30,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 957 to 949. [2025-03-08 05:31:30,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 949 states, 733 states have (on average 1.6221009549795362) internal successors, (1189), 740 states have internal predecessors, (1189), 189 states have call successors, (189), 22 states have call predecessors, (189), 26 states have return successors, (220), 188 states have call predecessors, (220), 188 states have call successors, (220) [2025-03-08 05:31:30,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 949 states to 949 states and 1598 transitions. [2025-03-08 05:31:30,855 INFO L78 Accepts]: Start accepts. Automaton has 949 states and 1598 transitions. Word has length 116 [2025-03-08 05:31:30,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:31:30,855 INFO L471 AbstractCegarLoop]: Abstraction has 949 states and 1598 transitions. [2025-03-08 05:31:30,855 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, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 05:31:30,856 INFO L276 IsEmpty]: Start isEmpty. Operand 949 states and 1598 transitions. [2025-03-08 05:31:30,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-08 05:31:30,861 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:31:30,861 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:31:30,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 05:31:30,861 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:31:30,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:31:30,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1686891995, now seen corresponding path program 1 times [2025-03-08 05:31:30,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:31:30,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533646034] [2025-03-08 05:31:30,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:31:30,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:31:30,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-08 05:31:30,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-08 05:31:30,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:31:30,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:31:30,915 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:31:30,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:31:30,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533646034] [2025-03-08 05:31:30,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533646034] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:31:30,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:31:30,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:31:30,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426212508] [2025-03-08 05:31:30,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:31:30,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:31:30,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:31:30,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:31:30,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:31:30,917 INFO L87 Difference]: Start difference. First operand 949 states and 1598 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, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 05:31:30,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:31:30,959 INFO L93 Difference]: Finished difference Result 2241 states and 3799 transitions. [2025-03-08 05:31:30,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:31:30,960 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, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 117 [2025-03-08 05:31:30,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:31:30,968 INFO L225 Difference]: With dead ends: 2241 [2025-03-08 05:31:30,968 INFO L226 Difference]: Without dead ends: 1405 [2025-03-08 05:31:30,971 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:31:30,971 INFO L435 NwaCegarLoop]: 481 mSDtfsCounter, 95 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 946 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:31:30,972 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 946 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:31:30,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1405 states. [2025-03-08 05:31:31,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1405 to 1397. [2025-03-08 05:31:31,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1397 states, 1086 states have (on average 1.6353591160220995) internal successors, (1776), 1093 states have internal predecessors, (1776), 284 states have call successors, (284), 22 states have call predecessors, (284), 26 states have return successors, (315), 283 states have call predecessors, (315), 283 states have call successors, (315) [2025-03-08 05:31:31,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1397 states to 1397 states and 2375 transitions. [2025-03-08 05:31:31,025 INFO L78 Accepts]: Start accepts. Automaton has 1397 states and 2375 transitions. Word has length 117 [2025-03-08 05:31:31,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:31:31,026 INFO L471 AbstractCegarLoop]: Abstraction has 1397 states and 2375 transitions. [2025-03-08 05:31:31,026 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, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 05:31:31,026 INFO L276 IsEmpty]: Start isEmpty. Operand 1397 states and 2375 transitions. [2025-03-08 05:31:31,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-08 05:31:31,033 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:31:31,033 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:31:31,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 05:31:31,033 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:31:31,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:31:31,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1884452991, now seen corresponding path program 1 times [2025-03-08 05:31:31,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:31:31,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719847172] [2025-03-08 05:31:31,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:31:31,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:31:31,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-08 05:31:31,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-08 05:31:31,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:31:31,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:31:31,083 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:31:31,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:31:31,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719847172] [2025-03-08 05:31:31,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719847172] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:31:31,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:31:31,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:31:31,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652379301] [2025-03-08 05:31:31,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:31:31,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:31:31,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:31:31,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:31:31,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:31:31,084 INFO L87 Difference]: Start difference. First operand 1397 states and 2375 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, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 05:31:31,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:31:31,177 INFO L93 Difference]: Finished difference Result 3242 states and 5560 transitions. [2025-03-08 05:31:31,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:31:31,177 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, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 118 [2025-03-08 05:31:31,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:31:31,189 INFO L225 Difference]: With dead ends: 3242 [2025-03-08 05:31:31,189 INFO L226 Difference]: Without dead ends: 2076 [2025-03-08 05:31:31,194 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:31:31,194 INFO L435 NwaCegarLoop]: 470 mSDtfsCounter, 93 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 931 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:31:31,194 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 931 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:31:31,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2076 states. [2025-03-08 05:31:31,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2076 to 2068. [2025-03-08 05:31:31,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2068 states, 1634 states have (on average 1.646266829865361) internal successors, (2690), 1641 states have internal predecessors, (2690), 407 states have call successors, (407), 22 states have call predecessors, (407), 26 states have return successors, (454), 406 states have call predecessors, (454), 406 states have call successors, (454) [2025-03-08 05:31:31,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2068 states to 2068 states and 3551 transitions. [2025-03-08 05:31:31,280 INFO L78 Accepts]: Start accepts. Automaton has 2068 states and 3551 transitions. Word has length 118 [2025-03-08 05:31:31,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:31:31,280 INFO L471 AbstractCegarLoop]: Abstraction has 2068 states and 3551 transitions. [2025-03-08 05:31:31,280 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, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 05:31:31,281 INFO L276 IsEmpty]: Start isEmpty. Operand 2068 states and 3551 transitions. [2025-03-08 05:31:31,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-08 05:31:31,290 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:31:31,290 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:31:31,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 05:31:31,290 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:31:31,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:31:31,291 INFO L85 PathProgramCache]: Analyzing trace with hash -320677722, now seen corresponding path program 1 times [2025-03-08 05:31:31,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:31:31,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190867985] [2025-03-08 05:31:31,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:31:31,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:31:31,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-08 05:31:31,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-08 05:31:31,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:31:31,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:31:31,337 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:31:31,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:31:31,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190867985] [2025-03-08 05:31:31,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190867985] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:31:31,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:31:31,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:31:31,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926827179] [2025-03-08 05:31:31,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:31:31,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:31:31,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:31:31,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:31:31,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:31:31,339 INFO L87 Difference]: Start difference. First operand 2068 states and 3551 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 05:31:31,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:31:31,425 INFO L93 Difference]: Finished difference Result 4784 states and 8280 transitions. [2025-03-08 05:31:31,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:31:31,425 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 119 [2025-03-08 05:31:31,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:31:31,443 INFO L225 Difference]: With dead ends: 4784 [2025-03-08 05:31:31,443 INFO L226 Difference]: Without dead ends: 3140 [2025-03-08 05:31:31,451 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:31:31,452 INFO L435 NwaCegarLoop]: 470 mSDtfsCounter, 91 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 931 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:31:31,452 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 931 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:31:31,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3140 states. [2025-03-08 05:31:31,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3140 to 3132. [2025-03-08 05:31:31,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3132 states, 2519 states have (on average 1.6538308852719332) internal successors, (4166), 2526 states have internal predecessors, (4166), 586 states have call successors, (586), 22 states have call predecessors, (586), 26 states have return successors, (659), 585 states have call predecessors, (659), 585 states have call successors, (659) [2025-03-08 05:31:31,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3132 states to 3132 states and 5411 transitions. [2025-03-08 05:31:31,645 INFO L78 Accepts]: Start accepts. Automaton has 3132 states and 5411 transitions. Word has length 119 [2025-03-08 05:31:31,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:31:31,646 INFO L471 AbstractCegarLoop]: Abstraction has 3132 states and 5411 transitions. [2025-03-08 05:31:31,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 05:31:31,646 INFO L276 IsEmpty]: Start isEmpty. Operand 3132 states and 5411 transitions. [2025-03-08 05:31:31,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-08 05:31:31,658 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:31:31,658 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:31:31,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 05:31:31,658 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:31:31,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:31:31,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1342512192, now seen corresponding path program 1 times [2025-03-08 05:31:31,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:31:31,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522606421] [2025-03-08 05:31:31,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:31:31,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:31:31,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-08 05:31:31,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-08 05:31:31,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:31:31,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:31:31,706 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:31:31,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:31:31,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522606421] [2025-03-08 05:31:31,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522606421] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:31:31,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:31:31,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:31:31,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622032749] [2025-03-08 05:31:31,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:31:31,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:31:31,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:31:31,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:31:31,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:31:31,707 INFO L87 Difference]: Start difference. First operand 3132 states and 5411 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 05:31:31,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:31:31,835 INFO L93 Difference]: Finished difference Result 7569 states and 13146 transitions. [2025-03-08 05:31:31,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:31:31,836 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 120 [2025-03-08 05:31:31,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:31:31,861 INFO L225 Difference]: With dead ends: 7569 [2025-03-08 05:31:31,862 INFO L226 Difference]: Without dead ends: 5077 [2025-03-08 05:31:31,871 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:31:31,872 INFO L435 NwaCegarLoop]: 486 mSDtfsCounter, 89 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 956 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:31:31,872 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 956 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:31:31,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5077 states. [2025-03-08 05:31:32,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5077 to 5069. [2025-03-08 05:31:32,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5069 states, 4080 states have (on average 1.6480392156862744) internal successors, (6724), 4087 states have internal predecessors, (6724), 962 states have call successors, (962), 22 states have call predecessors, (962), 26 states have return successors, (1079), 961 states have call predecessors, (1079), 961 states have call successors, (1079) [2025-03-08 05:31:32,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5069 states to 5069 states and 8765 transitions. [2025-03-08 05:31:32,129 INFO L78 Accepts]: Start accepts. Automaton has 5069 states and 8765 transitions. Word has length 120 [2025-03-08 05:31:32,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:31:32,130 INFO L471 AbstractCegarLoop]: Abstraction has 5069 states and 8765 transitions. [2025-03-08 05:31:32,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 05:31:32,130 INFO L276 IsEmpty]: Start isEmpty. Operand 5069 states and 8765 transitions. [2025-03-08 05:31:32,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-08 05:31:32,147 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:31:32,147 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:31:32,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 05:31:32,147 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:31:32,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:31:32,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1641971303, now seen corresponding path program 1 times [2025-03-08 05:31:32,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:31:32,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591116129] [2025-03-08 05:31:32,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:31:32,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:31:32,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-08 05:31:32,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-08 05:31:32,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:31:32,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:31:32,192 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:31:32,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:31:32,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591116129] [2025-03-08 05:31:32,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591116129] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:31:32,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:31:32,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:31:32,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714266032] [2025-03-08 05:31:32,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:31:32,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:31:32,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:31:32,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:31:32,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:31:32,194 INFO L87 Difference]: Start difference. First operand 5069 states and 8765 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 05:31:32,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:31:32,474 INFO L93 Difference]: Finished difference Result 12473 states and 21706 transitions. [2025-03-08 05:31:32,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:31:32,475 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 121 [2025-03-08 05:31:32,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:31:32,525 INFO L225 Difference]: With dead ends: 12473 [2025-03-08 05:31:32,525 INFO L226 Difference]: Without dead ends: 8399 [2025-03-08 05:31:32,545 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:31:32,546 INFO L435 NwaCegarLoop]: 470 mSDtfsCounter, 87 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 934 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:31:32,546 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 934 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:31:32,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8399 states. [2025-03-08 05:31:32,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8399 to 8391. [2025-03-08 05:31:32,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8391 states, 6796 states have (on average 1.6468510888758092) internal successors, (11192), 6803 states have internal predecessors, (11192), 1568 states have call successors, (1568), 22 states have call predecessors, (1568), 26 states have return successors, (1763), 1567 states have call predecessors, (1763), 1567 states have call successors, (1763) [2025-03-08 05:31:32,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8391 states to 8391 states and 14523 transitions. [2025-03-08 05:31:32,957 INFO L78 Accepts]: Start accepts. Automaton has 8391 states and 14523 transitions. Word has length 121 [2025-03-08 05:31:32,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:31:32,957 INFO L471 AbstractCegarLoop]: Abstraction has 8391 states and 14523 transitions. [2025-03-08 05:31:32,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 05:31:32,957 INFO L276 IsEmpty]: Start isEmpty. Operand 8391 states and 14523 transitions. [2025-03-08 05:31:32,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-08 05:31:32,982 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:31:32,982 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:31:32,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 05:31:32,982 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:31:32,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:31:32,983 INFO L85 PathProgramCache]: Analyzing trace with hash 440321951, now seen corresponding path program 1 times [2025-03-08 05:31:32,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:31:32,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832303105] [2025-03-08 05:31:32,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:31:32,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:31:32,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-08 05:31:33,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-08 05:31:33,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:31:33,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:31:33,026 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:31:33,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:31:33,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832303105] [2025-03-08 05:31:33,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832303105] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:31:33,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:31:33,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:31:33,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526274208] [2025-03-08 05:31:33,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:31:33,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:31:33,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:31:33,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:31:33,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:31:33,028 INFO L87 Difference]: Start difference. First operand 8391 states and 14523 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 05:31:33,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:31:33,317 INFO L93 Difference]: Finished difference Result 21692 states and 37691 transitions. [2025-03-08 05:31:33,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:31:33,318 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 122 [2025-03-08 05:31:33,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:31:33,374 INFO L225 Difference]: With dead ends: 21692 [2025-03-08 05:31:33,374 INFO L226 Difference]: Without dead ends: 14689 [2025-03-08 05:31:33,398 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:31:33,399 INFO L435 NwaCegarLoop]: 479 mSDtfsCounter, 85 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 946 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:31:33,399 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 946 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:31:33,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14689 states. [2025-03-08 05:31:33,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14689 to 14681. [2025-03-08 05:31:33,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14681 states, 11883 states have (on average 1.6372128250441809) internal successors, (19455), 11890 states have internal predecessors, (19455), 2771 states have call successors, (2771), 22 states have call predecessors, (2771), 26 states have return successors, (3110), 2770 states have call predecessors, (3110), 2770 states have call successors, (3110) [2025-03-08 05:31:33,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14681 states to 14681 states and 25336 transitions. [2025-03-08 05:31:33,989 INFO L78 Accepts]: Start accepts. Automaton has 14681 states and 25336 transitions. Word has length 122 [2025-03-08 05:31:33,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:31:33,990 INFO L471 AbstractCegarLoop]: Abstraction has 14681 states and 25336 transitions. [2025-03-08 05:31:33,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 05:31:33,990 INFO L276 IsEmpty]: Start isEmpty. Operand 14681 states and 25336 transitions. [2025-03-08 05:31:34,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-08 05:31:34,025 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:31:34,025 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:31:34,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 05:31:34,026 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:31:34,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:31:34,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1397003032, now seen corresponding path program 1 times [2025-03-08 05:31:34,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:31:34,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744125738] [2025-03-08 05:31:34,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:31:34,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:31:34,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-08 05:31:34,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-08 05:31:34,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:31:34,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:31:34,074 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:31:34,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:31:34,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744125738] [2025-03-08 05:31:34,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744125738] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:31:34,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:31:34,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:31:34,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635689201] [2025-03-08 05:31:34,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:31:34,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:31:34,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:31:34,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:31:34,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:31:34,077 INFO L87 Difference]: Start difference. First operand 14681 states and 25336 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 05:31:34,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:31:34,838 INFO L93 Difference]: Finished difference Result 38813 states and 67299 transitions. [2025-03-08 05:31:34,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:31:34,839 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 123 [2025-03-08 05:31:34,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:31:34,982 INFO L225 Difference]: With dead ends: 38813 [2025-03-08 05:31:34,982 INFO L226 Difference]: Without dead ends: 26090 [2025-03-08 05:31:35,053 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:31:35,053 INFO L435 NwaCegarLoop]: 470 mSDtfsCounter, 83 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 934 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:31:35,054 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 934 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:31:35,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26090 states. [2025-03-08 05:31:36,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26090 to 26082. [2025-03-08 05:31:36,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26082 states, 21245 states have (on average 1.6330430689574018) internal successors, (34694), 21252 states have internal predecessors, (34694), 4810 states have call successors, (4810), 22 states have call predecessors, (4810), 26 states have return successors, (5423), 4809 states have call predecessors, (5423), 4809 states have call successors, (5423) [2025-03-08 05:31:36,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26082 states to 26082 states and 44927 transitions. [2025-03-08 05:31:36,177 INFO L78 Accepts]: Start accepts. Automaton has 26082 states and 44927 transitions. Word has length 123 [2025-03-08 05:31:36,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:31:36,178 INFO L471 AbstractCegarLoop]: Abstraction has 26082 states and 44927 transitions. [2025-03-08 05:31:36,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 05:31:36,178 INFO L276 IsEmpty]: Start isEmpty. Operand 26082 states and 44927 transitions. [2025-03-08 05:31:36,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-08 05:31:36,214 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:31:36,214 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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] [2025-03-08 05:31:36,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 05:31:36,214 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:31:36,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:31:36,215 INFO L85 PathProgramCache]: Analyzing trace with hash -23507097, now seen corresponding path program 2 times [2025-03-08 05:31:36,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:31:36,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437397540] [2025-03-08 05:31:36,215 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:31:36,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:31:36,231 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 124 statements into 2 equivalence classes. [2025-03-08 05:31:36,241 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 124 of 124 statements. [2025-03-08 05:31:36,241 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 05:31:36,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:31:36,397 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-03-08 05:31:36,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:31:36,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437397540] [2025-03-08 05:31:36,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437397540] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:31:36,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:31:36,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:31:36,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426339601] [2025-03-08 05:31:36,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:31:36,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:31:36,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:31:36,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:31:36,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:31:36,399 INFO L87 Difference]: Start difference. First operand 26082 states and 44927 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, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 05:31:36,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:31:36,875 INFO L93 Difference]: Finished difference Result 49311 states and 85093 transitions. [2025-03-08 05:31:36,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:31:36,875 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, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 124 [2025-03-08 05:31:36,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:31:37,088 INFO L225 Difference]: With dead ends: 49311 [2025-03-08 05:31:37,089 INFO L226 Difference]: Without dead ends: 26090 [2025-03-08 05:31:37,133 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:31:37,134 INFO L435 NwaCegarLoop]: 583 mSDtfsCounter, 96 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 1063 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:31:37,134 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 1063 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:31:37,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26090 states. [2025-03-08 05:31:37,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26090 to 26082. [2025-03-08 05:31:37,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26082 states, 21245 states have (on average 1.620522475876677) internal successors, (34428), 21252 states have internal predecessors, (34428), 4810 states have call successors, (4810), 22 states have call predecessors, (4810), 26 states have return successors, (5423), 4809 states have call predecessors, (5423), 4809 states have call successors, (5423) [2025-03-08 05:31:38,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26082 states to 26082 states and 44661 transitions. [2025-03-08 05:31:38,076 INFO L78 Accepts]: Start accepts. Automaton has 26082 states and 44661 transitions. Word has length 124 [2025-03-08 05:31:38,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:31:38,077 INFO L471 AbstractCegarLoop]: Abstraction has 26082 states and 44661 transitions. [2025-03-08 05:31:38,077 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, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 05:31:38,077 INFO L276 IsEmpty]: Start isEmpty. Operand 26082 states and 44661 transitions. [2025-03-08 05:31:38,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-08 05:31:38,109 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:31:38,109 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:31:38,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 05:31:38,109 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:31:38,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:31:38,110 INFO L85 PathProgramCache]: Analyzing trace with hash 821142174, now seen corresponding path program 1 times [2025-03-08 05:31:38,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:31:38,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501299611] [2025-03-08 05:31:38,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:31:38,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:31:38,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-08 05:31:38,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-08 05:31:38,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:31:38,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:31:38,176 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:31:38,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:31:38,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501299611] [2025-03-08 05:31:38,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501299611] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:31:38,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:31:38,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:31:38,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83900947] [2025-03-08 05:31:38,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:31:38,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:31:38,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:31:38,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:31:38,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:31:38,178 INFO L87 Difference]: Start difference. First operand 26082 states and 44661 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 05:31:39,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:31:39,472 INFO L93 Difference]: Finished difference Result 70985 states and 121971 transitions. [2025-03-08 05:31:39,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:31:39,472 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 124 [2025-03-08 05:31:39,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:31:39,733 INFO L225 Difference]: With dead ends: 70985 [2025-03-08 05:31:39,734 INFO L226 Difference]: Without dead ends: 47547 [2025-03-08 05:31:39,830 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:31:39,830 INFO L435 NwaCegarLoop]: 481 mSDtfsCounter, 81 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 946 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:31:39,831 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 946 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:31:39,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47547 states. [2025-03-08 05:31:41,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47547 to 47539. [2025-03-08 05:31:41,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47539 states, 38987 states have (on average 1.6138712904301433) internal successors, (62920), 38994 states have internal predecessors, (62920), 8525 states have call successors, (8525), 22 states have call predecessors, (8525), 26 states have return successors, (9670), 8524 states have call predecessors, (9670), 8524 states have call successors, (9670) [2025-03-08 05:31:41,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47539 states to 47539 states and 81115 transitions. [2025-03-08 05:31:41,625 INFO L78 Accepts]: Start accepts. Automaton has 47539 states and 81115 transitions. Word has length 124 [2025-03-08 05:31:41,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:31:41,625 INFO L471 AbstractCegarLoop]: Abstraction has 47539 states and 81115 transitions. [2025-03-08 05:31:41,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 05:31:41,626 INFO L276 IsEmpty]: Start isEmpty. Operand 47539 states and 81115 transitions. [2025-03-08 05:31:41,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-08 05:31:41,658 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:31:41,658 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:31:41,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 05:31:41,658 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:31:41,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:31:41,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1346258935, now seen corresponding path program 1 times [2025-03-08 05:31:41,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:31:41,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505314314] [2025-03-08 05:31:41,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:31:41,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:31:41,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-08 05:31:41,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-08 05:31:41,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:31:41,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:31:41,710 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:31:41,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:31:41,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505314314] [2025-03-08 05:31:41,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505314314] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:31:41,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:31:41,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:31:41,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186818039] [2025-03-08 05:31:41,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:31:41,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:31:41,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:31:41,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:31:41,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:31:41,714 INFO L87 Difference]: Start difference. First operand 47539 states and 81115 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 05:31:43,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:31:43,560 INFO L93 Difference]: Finished difference Result 88442 states and 151248 transitions. [2025-03-08 05:31:43,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:31:43,561 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 125 [2025-03-08 05:31:43,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:31:44,052 INFO L225 Difference]: With dead ends: 88442 [2025-03-08 05:31:44,052 INFO L226 Difference]: Without dead ends: 88270 [2025-03-08 05:31:44,115 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:31:44,117 INFO L435 NwaCegarLoop]: 479 mSDtfsCounter, 76 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 948 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:31:44,117 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 948 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:31:44,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88270 states. [2025-03-08 05:31:46,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88270 to 88262. [2025-03-08 05:31:46,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88262 states, 72911 states have (on average 1.605683641700155) internal successors, (117072), 72918 states have internal predecessors, (117072), 15324 states have call successors, (15324), 22 states have call predecessors, (15324), 26 states have return successors, (17515), 15323 states have call predecessors, (17515), 15323 states have call successors, (17515) [2025-03-08 05:31:46,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88262 states to 88262 states and 149911 transitions. [2025-03-08 05:31:46,789 INFO L78 Accepts]: Start accepts. Automaton has 88262 states and 149911 transitions. Word has length 125 [2025-03-08 05:31:46,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:31:46,790 INFO L471 AbstractCegarLoop]: Abstraction has 88262 states and 149911 transitions. [2025-03-08 05:31:46,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 05:31:46,790 INFO L276 IsEmpty]: Start isEmpty. Operand 88262 states and 149911 transitions. [2025-03-08 05:31:46,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-08 05:31:46,826 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:31:46,826 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:31:46,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 05:31:46,827 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:31:46,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:31:46,827 INFO L85 PathProgramCache]: Analyzing trace with hash -374872739, now seen corresponding path program 1 times [2025-03-08 05:31:46,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:31:46,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454024262] [2025-03-08 05:31:46,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:31:46,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:31:46,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-08 05:31:46,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-08 05:31:46,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:31:46,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:31:47,063 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:31:47,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:31:47,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454024262] [2025-03-08 05:31:47,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454024262] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:31:47,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:31:47,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 05:31:47,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824606753] [2025-03-08 05:31:47,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:31:47,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 05:31:47,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:31:47,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 05:31:47,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2025-03-08 05:31:47,066 INFO L87 Difference]: Start difference. First operand 88262 states and 149911 transitions. Second operand has 13 states, 12 states have (on average 7.25) internal successors, (87), 11 states have internal predecessors, (87), 6 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2025-03-08 05:31:52,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:31:52,246 INFO L93 Difference]: Finished difference Result 176098 states and 304522 transitions. [2025-03-08 05:31:52,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-08 05:31:52,247 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 7.25) internal successors, (87), 11 states have internal predecessors, (87), 6 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) Word has length 126 [2025-03-08 05:31:52,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:31:52,999 INFO L225 Difference]: With dead ends: 176098 [2025-03-08 05:31:52,999 INFO L226 Difference]: Without dead ends: 175934 [2025-03-08 05:31:53,078 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=577, Unknown=0, NotChecked=0, Total=702 [2025-03-08 05:31:53,078 INFO L435 NwaCegarLoop]: 541 mSDtfsCounter, 1387 mSDsluCounter, 5198 mSDsCounter, 0 mSdLazyCounter, 1136 mSolverCounterSat, 412 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1387 SdHoareTripleChecker+Valid, 5739 SdHoareTripleChecker+Invalid, 1548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 412 IncrementalHoareTripleChecker+Valid, 1136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 05:31:53,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1387 Valid, 5739 Invalid, 1548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [412 Valid, 1136 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 05:31:53,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175934 states. [2025-03-08 05:31:58,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175934 to 175840. [2025-03-08 05:31:59,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175840 states, 145331 states have (on average 1.6064845077787946) internal successors, (233472), 145235 states have internal predecessors, (233472), 30443 states have call successors, (30443), 59 states have call predecessors, (30443), 65 states have return successors, (38094), 30551 states have call predecessors, (38094), 30440 states have call successors, (38094) [2025-03-08 05:32:00,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175840 states to 175840 states and 302009 transitions. [2025-03-08 05:32:00,110 INFO L78 Accepts]: Start accepts. Automaton has 175840 states and 302009 transitions. Word has length 126 [2025-03-08 05:32:00,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:00,111 INFO L471 AbstractCegarLoop]: Abstraction has 175840 states and 302009 transitions. [2025-03-08 05:32:00,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 7.25) internal successors, (87), 11 states have internal predecessors, (87), 6 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2025-03-08 05:32:00,111 INFO L276 IsEmpty]: Start isEmpty. Operand 175840 states and 302009 transitions. [2025-03-08 05:32:00,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-08 05:32:00,187 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:00,187 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:32:00,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 05:32:00,187 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:00,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:00,188 INFO L85 PathProgramCache]: Analyzing trace with hash -2012605974, now seen corresponding path program 1 times [2025-03-08 05:32:00,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:00,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444572293] [2025-03-08 05:32:00,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:00,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:00,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-08 05:32:00,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-08 05:32:00,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:00,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:00,269 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:32:00,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:00,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444572293] [2025-03-08 05:32:00,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444572293] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:00,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:32:00,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:32:00,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643365029] [2025-03-08 05:32:00,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:00,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:32:00,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:00,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:32:00,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:32:00,270 INFO L87 Difference]: Start difference. First operand 175840 states and 302009 transitions. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12)