./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec6_product22.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/email_spec6_product22.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 e61661fc2d58041f16237a6d2ff2f3d5f72c7660b85c9fdf3f096a51b709ec23 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 05:35:03,642 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 05:35:03,707 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 05:35:03,711 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 05:35:03,711 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 05:35:03,734 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 05:35:03,736 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 05:35:03,736 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 05:35:03,737 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 05:35:03,737 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 05:35:03,737 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 05:35:03,737 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 05:35:03,737 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 05:35:03,737 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 05:35:03,737 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 05:35:03,737 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 05:35:03,737 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 05:35:03,737 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 05:35:03,738 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 05:35:03,738 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 05:35:03,738 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 05:35:03,738 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 05:35:03,738 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 05:35:03,738 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 05:35:03,738 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 05:35:03,738 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 05:35:03,738 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 05:35:03,738 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 05:35:03,738 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 05:35:03,738 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 05:35:03,738 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 05:35:03,738 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 05:35:03,738 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:35:03,738 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 05:35:03,738 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 05:35:03,739 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 05:35:03,739 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 05:35:03,739 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 05:35:03,739 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 05:35:03,739 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 05:35:03,739 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 05:35:03,739 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 05:35:03,739 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 05:35:03,739 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 -> e61661fc2d58041f16237a6d2ff2f3d5f72c7660b85c9fdf3f096a51b709ec23 [2025-03-08 05:35:03,981 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 05:35:03,991 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 05:35:03,994 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 05:35:03,995 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 05:35:03,995 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 05:35:03,996 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec6_product22.cil.c [2025-03-08 05:35:05,258 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1fa78437f/0408488721ba48388c486c926bda2a08/FLAG96bb82de0 [2025-03-08 05:35:05,585 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 05:35:05,587 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec6_product22.cil.c [2025-03-08 05:35:05,601 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1fa78437f/0408488721ba48388c486c926bda2a08/FLAG96bb82de0 [2025-03-08 05:35:05,617 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1fa78437f/0408488721ba48388c486c926bda2a08 [2025-03-08 05:35:05,622 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 05:35:05,623 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 05:35:05,624 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 05:35:05,624 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 05:35:05,628 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 05:35:05,628 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:35:05" (1/1) ... [2025-03-08 05:35:05,630 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76530039 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:35:05, skipping insertion in model container [2025-03-08 05:35:05,631 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:35:05" (1/1) ... [2025-03-08 05:35:05,680 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 05:35:05,955 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec6_product22.cil.c[21483,21496] [2025-03-08 05:35:06,125 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:35:06,139 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 05:35:06,145 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [48] [2025-03-08 05:35:06,147 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [460] [2025-03-08 05:35:06,147 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [509] [2025-03-08 05:35:06,147 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [875] [2025-03-08 05:35:06,147 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EncryptDecrypt_spec.i","") [893] [2025-03-08 05:35:06,147 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [943] [2025-03-08 05:35:06,147 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [952] [2025-03-08 05:35:06,147 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [2031] [2025-03-08 05:35:06,147 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [2260] [2025-03-08 05:35:06,147 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [2551] [2025-03-08 05:35:06,149 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [2850] [2025-03-08 05:35:06,193 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec6_product22.cil.c[21483,21496] [2025-03-08 05:35:06,245 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:35:06,275 INFO L204 MainTranslator]: Completed translation [2025-03-08 05:35:06,276 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:35:06 WrapperNode [2025-03-08 05:35:06,276 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 05:35:06,277 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 05:35:06,277 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 05:35:06,277 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 05:35:06,282 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:35:06" (1/1) ... [2025-03-08 05:35:06,303 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:35:06" (1/1) ... [2025-03-08 05:35:06,340 INFO L138 Inliner]: procedures = 129, calls = 195, calls flagged for inlining = 58, calls inlined = 53, statements flattened = 1009 [2025-03-08 05:35:06,340 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 05:35:06,341 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 05:35:06,341 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 05:35:06,341 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 05:35:06,348 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:35:06" (1/1) ... [2025-03-08 05:35:06,349 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:35:06" (1/1) ... [2025-03-08 05:35:06,354 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:35:06" (1/1) ... [2025-03-08 05:35:06,376 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:35:06,376 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:35:06" (1/1) ... [2025-03-08 05:35:06,376 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:35:06" (1/1) ... [2025-03-08 05:35:06,393 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:35:06" (1/1) ... [2025-03-08 05:35:06,396 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:35:06" (1/1) ... [2025-03-08 05:35:06,399 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:35:06" (1/1) ... [2025-03-08 05:35:06,400 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:35:06" (1/1) ... [2025-03-08 05:35:06,404 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 05:35:06,405 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 05:35:06,405 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 05:35:06,405 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 05:35:06,405 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:35:06" (1/1) ... [2025-03-08 05:35:06,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:35:06,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:35:06,443 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:35:06,447 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:35:06,464 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2025-03-08 05:35:06,464 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2025-03-08 05:35:06,464 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2025-03-08 05:35:06,464 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2025-03-08 05:35:06,465 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2025-03-08 05:35:06,465 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2025-03-08 05:35:06,465 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-03-08 05:35:06,465 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-03-08 05:35:06,465 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-03-08 05:35:06,465 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-03-08 05:35:06,465 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-03-08 05:35:06,465 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-03-08 05:35:06,466 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2025-03-08 05:35:06,466 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2025-03-08 05:35:06,466 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-03-08 05:35:06,466 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-03-08 05:35:06,466 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-03-08 05:35:06,466 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-03-08 05:35:06,466 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2025-03-08 05:35:06,466 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2025-03-08 05:35:06,467 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-03-08 05:35:06,467 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-03-08 05:35:06,468 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 05:35:06,468 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2025-03-08 05:35:06,468 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2025-03-08 05:35:06,468 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-03-08 05:35:06,468 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-03-08 05:35:06,468 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-03-08 05:35:06,468 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-03-08 05:35:06,468 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-03-08 05:35:06,468 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-03-08 05:35:06,468 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-03-08 05:35:06,468 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-03-08 05:35:06,468 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2025-03-08 05:35:06,468 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2025-03-08 05:35:06,468 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-03-08 05:35:06,468 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-03-08 05:35:06,468 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-03-08 05:35:06,468 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-03-08 05:35:06,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 05:35:06,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 05:35:06,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 05:35:06,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 05:35:06,468 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-03-08 05:35:06,468 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-03-08 05:35:06,468 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 05:35:06,468 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 05:35:06,639 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 05:35:06,644 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 05:35:06,913 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2926-1: isReadable_#res#1 := isReadable_~retValue_acc~41#1; [2025-03-08 05:35:06,914 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1961-1: getClientForwardReceiver_#res#1 := getClientForwardReceiver_~retValue_acc~32#1; [2025-03-08 05:35:06,914 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L104-1: getEmailId_#res#1 := getEmailId_~retValue_acc~1#1; [2025-03-08 05:35:06,914 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1889-1: findPublicKey_#res#1 := findPublicKey_~retValue_acc~31#1; [2025-03-08 05:35:06,914 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1526-1: getClientAutoResponse_#res#1 := getClientAutoResponse_~retValue_acc~25#1; [2025-03-08 05:35:06,914 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2906-1: isReadable__wrappee__Keys_#res#1 := isReadable__wrappee__Keys_~retValue_acc~40#1; [2025-03-08 05:35:06,914 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2008-1: getClientId_#res#1 := getClientId_~retValue_acc~33#1; [2025-03-08 05:35:06,927 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2810: #res := ~retValue_acc~39; [2025-03-08 05:35:06,951 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1665: #res#1 := ~retValue_acc~28#1; [2025-03-08 05:35:06,952 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1620-1: getClientKeyringSize_#res#1 := getClientKeyringSize_~retValue_acc~27#1; [2025-03-08 05:35:06,961 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1573: #res := ~retValue_acc~26; [2025-03-08 05:35:06,972 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2950-1: createEmail_#res#1 := createEmail_~retValue_acc~43#1; [2025-03-08 05:35:06,988 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L293: #res := ~retValue_acc~6; [2025-03-08 05:35:07,002 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L330: #res := ~retValue_acc~7; [2025-03-08 05:35:07,028 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L178: #res := ~retValue_acc~3; [2025-03-08 05:35:07,329 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2785-1: get_queued_email_#res#1 := get_queued_email_~retValue_acc~38#1; [2025-03-08 05:35:07,330 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1728-1: getClientKeyringUser_#res#1 := getClientKeyringUser_~retValue_acc~29#1; [2025-03-08 05:35:07,330 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L506-1: valid_product_#res#1 := valid_product_~retValue_acc~12#1; [2025-03-08 05:35:07,330 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2767-1: is_queue_empty_#res#1 := is_queue_empty_~retValue_acc~36#1; [2025-03-08 05:35:07,330 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2776-1: get_queued_client_#res#1 := get_queued_client_~retValue_acc~37#1; [2025-03-08 05:35:07,330 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1835-1: getClientKeyringPublicKey_#res#1 := getClientKeyringPublicKey_~retValue_acc~30#1; [2025-03-08 05:35:07,337 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L141: #res := ~retValue_acc~2; [2025-03-08 05:35:07,494 INFO L? ?]: Removed 434 outVars from TransFormulas that were not future-live. [2025-03-08 05:35:07,495 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 05:35:07,512 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 05:35:07,513 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 05:35:07,513 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:35:07 BoogieIcfgContainer [2025-03-08 05:35:07,513 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 05:35:07,516 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 05:35:07,516 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 05:35:07,520 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 05:35:07,520 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:35:05" (1/3) ... [2025-03-08 05:35:07,521 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ca01fac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:35:07, skipping insertion in model container [2025-03-08 05:35:07,521 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:35:06" (2/3) ... [2025-03-08 05:35:07,521 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ca01fac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:35:07, skipping insertion in model container [2025-03-08 05:35:07,521 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:35:07" (3/3) ... [2025-03-08 05:35:07,522 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec6_product22.cil.c [2025-03-08 05:35:07,532 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 05:35:07,536 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec6_product22.cil.c that has 21 procedures, 332 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 05:35:07,602 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 05:35:07,613 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;@3e0831ff, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 05:35:07,614 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 05:35:07,618 INFO L276 IsEmpty]: Start isEmpty. Operand has 332 states, 256 states have (on average 1.515625) internal successors, (388), 260 states have internal predecessors, (388), 54 states have call successors, (54), 20 states have call predecessors, (54), 20 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-08 05:35:07,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-08 05:35:07,636 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:35:07,637 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:35:07,638 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:35:07,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:35:07,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1609630064, now seen corresponding path program 1 times [2025-03-08 05:35:07,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:35:07,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800677475] [2025-03-08 05:35:07,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:35:07,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:35:07,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-08 05:35:07,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-08 05:35:07,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:35:07,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:35:08,303 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-08 05:35:08,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:35:08,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800677475] [2025-03-08 05:35:08,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800677475] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:35:08,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [164873433] [2025-03-08 05:35:08,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:35:08,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:35:08,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:35:08,308 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:35:08,310 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:35:08,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-08 05:35:08,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-08 05:35:08,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:35:08,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:35:08,623 INFO L256 TraceCheckSpWp]: Trace formula consists of 1029 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 05:35:08,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:35:08,662 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-08 05:35:08,663 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:35:08,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [164873433] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:35:08,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:35:08,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-08 05:35:08,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377110025] [2025-03-08 05:35:08,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:35:08,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:35:08,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:35:08,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:35:08,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:35:08,691 INFO L87 Difference]: Start difference. First operand has 332 states, 256 states have (on average 1.515625) internal successors, (388), 260 states have internal predecessors, (388), 54 states have call successors, (54), 20 states have call predecessors, (54), 20 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 05:35:08,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:35:08,754 INFO L93 Difference]: Finished difference Result 508 states and 744 transitions. [2025-03-08 05:35:08,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:35:08,756 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 114 [2025-03-08 05:35:08,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:35:08,767 INFO L225 Difference]: With dead ends: 508 [2025-03-08 05:35:08,770 INFO L226 Difference]: Without dead ends: 326 [2025-03-08 05:35:08,775 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 114 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:35:08,778 INFO L435 NwaCegarLoop]: 492 mSDtfsCounter, 0 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 981 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:35:08,780 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 981 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:35:08,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2025-03-08 05:35:08,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 326. [2025-03-08 05:35:08,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 251 states have (on average 1.5099601593625498) internal successors, (379), 254 states have internal predecessors, (379), 54 states have call successors, (54), 20 states have call predecessors, (54), 20 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2025-03-08 05:35:08,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 486 transitions. [2025-03-08 05:35:08,828 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 486 transitions. Word has length 114 [2025-03-08 05:35:08,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:35:08,831 INFO L471 AbstractCegarLoop]: Abstraction has 326 states and 486 transitions. [2025-03-08 05:35:08,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 05:35:08,831 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 486 transitions. [2025-03-08 05:35:08,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-08 05:35:08,839 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:35:08,839 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:35:08,848 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 05:35:09,040 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:35:09,040 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:35:09,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:35:09,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1809388591, now seen corresponding path program 1 times [2025-03-08 05:35:09,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:35:09,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461386291] [2025-03-08 05:35:09,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:35:09,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:35:09,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-08 05:35:09,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-08 05:35:09,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:35:09,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:35:09,258 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-08 05:35:09,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:35:09,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461386291] [2025-03-08 05:35:09,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461386291] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:35:09,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2072663220] [2025-03-08 05:35:09,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:35:09,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:35:09,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:35:09,261 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:35:09,263 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:35:09,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-08 05:35:09,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-08 05:35:09,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:35:09,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:35:09,545 INFO L256 TraceCheckSpWp]: Trace formula consists of 1053 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 05:35:09,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:35:09,575 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-08 05:35:09,576 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:35:09,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2072663220] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:35:09,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:35:09,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-08 05:35:09,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101626909] [2025-03-08 05:35:09,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:35:09,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:35:09,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:35:09,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:35:09,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:35:09,577 INFO L87 Difference]: Start difference. First operand 326 states and 486 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 05:35:09,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:35:09,618 INFO L93 Difference]: Finished difference Result 686 states and 1038 transitions. [2025-03-08 05:35:09,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:35:09,618 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 121 [2025-03-08 05:35:09,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:35:09,623 INFO L225 Difference]: With dead ends: 686 [2025-03-08 05:35:09,623 INFO L226 Difference]: Without dead ends: 386 [2025-03-08 05:35:09,626 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 121 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:35:09,627 INFO L435 NwaCegarLoop]: 495 mSDtfsCounter, 115 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 933 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:35:09,627 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 933 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:35:09,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2025-03-08 05:35:09,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 378. [2025-03-08 05:35:09,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 292 states have (on average 1.5308219178082192) internal successors, (447), 295 states have internal predecessors, (447), 65 states have call successors, (65), 20 states have call predecessors, (65), 20 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2025-03-08 05:35:09,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 576 transitions. [2025-03-08 05:35:09,661 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 576 transitions. Word has length 121 [2025-03-08 05:35:09,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:35:09,662 INFO L471 AbstractCegarLoop]: Abstraction has 378 states and 576 transitions. [2025-03-08 05:35:09,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 05:35:09,662 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 576 transitions. [2025-03-08 05:35:09,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-08 05:35:09,665 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:35:09,665 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:35:09,673 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 05:35:09,865 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:35:09,866 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:35:09,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:35:09,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1145861103, now seen corresponding path program 1 times [2025-03-08 05:35:09,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:35:09,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100666921] [2025-03-08 05:35:09,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:35:09,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:35:09,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-08 05:35:09,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-08 05:35:09,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:35:09,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:35:10,089 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-08 05:35:10,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:35:10,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100666921] [2025-03-08 05:35:10,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100666921] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:35:10,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [497017802] [2025-03-08 05:35:10,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:35:10,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:35:10,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:35:10,093 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:35:10,096 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:35:10,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-08 05:35:10,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-08 05:35:10,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:35:10,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:35:10,374 INFO L256 TraceCheckSpWp]: Trace formula consists of 1058 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 05:35:10,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:35:10,442 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-08 05:35:10,443 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:35:10,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [497017802] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:35:10,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:35:10,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-03-08 05:35:10,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819630159] [2025-03-08 05:35:10,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:35:10,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:35:10,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:35:10,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:35:10,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:35:10,447 INFO L87 Difference]: Start difference. First operand 378 states and 576 transitions. Second operand has 5 states, 4 states have (on average 20.25) internal successors, (81), 5 states have internal predecessors, (81), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-08 05:35:10,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:35:10,508 INFO L93 Difference]: Finished difference Result 747 states and 1142 transitions. [2025-03-08 05:35:10,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:35:10,509 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.25) internal successors, (81), 5 states have internal predecessors, (81), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 122 [2025-03-08 05:35:10,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:35:10,511 INFO L225 Difference]: With dead ends: 747 [2025-03-08 05:35:10,512 INFO L226 Difference]: Without dead ends: 380 [2025-03-08 05:35:10,513 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 120 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:35:10,513 INFO L435 NwaCegarLoop]: 477 mSDtfsCounter, 2 mSDsluCounter, 1420 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1897 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:35:10,514 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1897 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:35:10,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2025-03-08 05:35:10,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 380. [2025-03-08 05:35:10,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 293 states have (on average 1.52901023890785) internal successors, (448), 297 states have internal predecessors, (448), 65 states have call successors, (65), 20 states have call predecessors, (65), 21 states have return successors, (66), 64 states have call predecessors, (66), 64 states have call successors, (66) [2025-03-08 05:35:10,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 579 transitions. [2025-03-08 05:35:10,537 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 579 transitions. Word has length 122 [2025-03-08 05:35:10,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:35:10,538 INFO L471 AbstractCegarLoop]: Abstraction has 380 states and 579 transitions. [2025-03-08 05:35:10,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.25) internal successors, (81), 5 states have internal predecessors, (81), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-08 05:35:10,538 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 579 transitions. [2025-03-08 05:35:10,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-08 05:35:10,541 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:35:10,542 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:35:10,550 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 05:35:10,742 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:35:10,742 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:35:10,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:35:10,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1536112033, now seen corresponding path program 1 times [2025-03-08 05:35:10,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:35:10,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829585998] [2025-03-08 05:35:10,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:35:10,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:35:10,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-08 05:35:10,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-08 05:35:10,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:35:10,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:35:10,904 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-08 05:35:10,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:35:10,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829585998] [2025-03-08 05:35:10,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829585998] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:35:10,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1460185696] [2025-03-08 05:35:10,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:35:10,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:35:10,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:35:10,908 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:35:10,911 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:35:11,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-08 05:35:11,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-08 05:35:11,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:35:11,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:35:11,232 INFO L256 TraceCheckSpWp]: Trace formula consists of 1059 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 05:35:11,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:35:11,285 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-08 05:35:11,286 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:35:11,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1460185696] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:35:11,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:35:11,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-03-08 05:35:11,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811257285] [2025-03-08 05:35:11,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:35:11,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:35:11,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:35:11,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:35:11,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-08 05:35:11,288 INFO L87 Difference]: Start difference. First operand 380 states and 579 transitions. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-08 05:35:11,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:35:11,371 INFO L93 Difference]: Finished difference Result 749 states and 1147 transitions. [2025-03-08 05:35:11,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:35:11,371 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 123 [2025-03-08 05:35:11,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:35:11,374 INFO L225 Difference]: With dead ends: 749 [2025-03-08 05:35:11,377 INFO L226 Difference]: Without dead ends: 382 [2025-03-08 05:35:11,379 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 121 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:35:11,380 INFO L435 NwaCegarLoop]: 475 mSDtfsCounter, 2 mSDsluCounter, 1408 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1883 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:35:11,380 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1883 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:35:11,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2025-03-08 05:35:11,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2025-03-08 05:35:11,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 294 states have (on average 1.5272108843537415) internal successors, (449), 299 states have internal predecessors, (449), 65 states have call successors, (65), 20 states have call predecessors, (65), 22 states have return successors, (71), 64 states have call predecessors, (71), 64 states have call successors, (71) [2025-03-08 05:35:11,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 585 transitions. [2025-03-08 05:35:11,397 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 585 transitions. Word has length 123 [2025-03-08 05:35:11,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:35:11,398 INFO L471 AbstractCegarLoop]: Abstraction has 382 states and 585 transitions. [2025-03-08 05:35:11,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-08 05:35:11,398 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 585 transitions. [2025-03-08 05:35:11,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-08 05:35:11,400 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:35:11,400 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:35:11,410 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:35:11,605 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:35:11,605 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:35:11,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:35:11,605 INFO L85 PathProgramCache]: Analyzing trace with hash 174797711, now seen corresponding path program 1 times [2025-03-08 05:35:11,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:35:11,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080769691] [2025-03-08 05:35:11,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:35:11,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:35:11,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-08 05:35:11,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-08 05:35:11,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:35:11,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:35:11,780 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-08 05:35:11,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:35:11,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080769691] [2025-03-08 05:35:11,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080769691] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:35:11,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:35:11,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:35:11,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998828221] [2025-03-08 05:35:11,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:35:11,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:35:11,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:35:11,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:35:11,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:35:11,783 INFO L87 Difference]: Start difference. First operand 382 states and 585 transitions. Second operand has 5 states, 4 states have (on average 19.75) internal successors, (79), 5 states have internal predecessors, (79), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-08 05:35:11,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:35:11,838 INFO L93 Difference]: Finished difference Result 741 states and 1138 transitions. [2025-03-08 05:35:11,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:35:11,838 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.75) internal successors, (79), 5 states have internal predecessors, (79), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 124 [2025-03-08 05:35:11,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:35:11,841 INFO L225 Difference]: With dead ends: 741 [2025-03-08 05:35:11,841 INFO L226 Difference]: Without dead ends: 382 [2025-03-08 05:35:11,843 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:35:11,845 INFO L435 NwaCegarLoop]: 478 mSDtfsCounter, 2 mSDsluCounter, 1423 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1901 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:35:11,846 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1901 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:35:11,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2025-03-08 05:35:11,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2025-03-08 05:35:11,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 294 states have (on average 1.5272108843537415) internal successors, (449), 299 states have internal predecessors, (449), 65 states have call successors, (65), 20 states have call predecessors, (65), 22 states have return successors, (70), 64 states have call predecessors, (70), 64 states have call successors, (70) [2025-03-08 05:35:11,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 584 transitions. [2025-03-08 05:35:11,866 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 584 transitions. Word has length 124 [2025-03-08 05:35:11,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:35:11,867 INFO L471 AbstractCegarLoop]: Abstraction has 382 states and 584 transitions. [2025-03-08 05:35:11,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.75) internal successors, (79), 5 states have internal predecessors, (79), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-08 05:35:11,867 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 584 transitions. [2025-03-08 05:35:11,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-08 05:35:11,869 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:35:11,869 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:35:11,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 05:35:11,870 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:35:11,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:35:11,870 INFO L85 PathProgramCache]: Analyzing trace with hash -706393635, now seen corresponding path program 2 times [2025-03-08 05:35:11,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:35:11,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959719353] [2025-03-08 05:35:11,870 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:35:11,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:35:11,891 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 125 statements into 2 equivalence classes. [2025-03-08 05:35:11,904 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 125 of 125 statements. [2025-03-08 05:35:11,905 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 05:35:11,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:35:12,021 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-08 05:35:12,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:35:12,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959719353] [2025-03-08 05:35:12,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959719353] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:35:12,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:35:12,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:35:12,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157341005] [2025-03-08 05:35:12,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:35:12,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:35:12,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:35:12,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:35:12,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:35:12,024 INFO L87 Difference]: Start difference. First operand 382 states and 584 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-08 05:35:12,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:35:12,079 INFO L93 Difference]: Finished difference Result 739 states and 1133 transitions. [2025-03-08 05:35:12,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:35:12,080 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 125 [2025-03-08 05:35:12,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:35:12,082 INFO L225 Difference]: With dead ends: 739 [2025-03-08 05:35:12,082 INFO L226 Difference]: Without dead ends: 382 [2025-03-08 05:35:12,084 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:35:12,084 INFO L435 NwaCegarLoop]: 476 mSDtfsCounter, 2 mSDsluCounter, 1411 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1887 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:35:12,085 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1887 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:35:12,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2025-03-08 05:35:12,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2025-03-08 05:35:12,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 294 states have (on average 1.5272108843537415) internal successors, (449), 299 states have internal predecessors, (449), 65 states have call successors, (65), 20 states have call predecessors, (65), 22 states have return successors, (69), 64 states have call predecessors, (69), 64 states have call successors, (69) [2025-03-08 05:35:12,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 583 transitions. [2025-03-08 05:35:12,100 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 583 transitions. Word has length 125 [2025-03-08 05:35:12,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:35:12,100 INFO L471 AbstractCegarLoop]: Abstraction has 382 states and 583 transitions. [2025-03-08 05:35:12,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-08 05:35:12,101 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 583 transitions. [2025-03-08 05:35:12,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-08 05:35:12,102 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:35:12,103 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:35:12,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 05:35:12,103 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:35:12,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:35:12,103 INFO L85 PathProgramCache]: Analyzing trace with hash -601535957, now seen corresponding path program 3 times [2025-03-08 05:35:12,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:35:12,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508137399] [2025-03-08 05:35:12,104 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 05:35:12,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:35:12,123 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 126 statements into 3 equivalence classes. [2025-03-08 05:35:12,134 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 114 of 126 statements. [2025-03-08 05:35:12,134 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-08 05:35:12,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:35:12,219 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-08 05:35:12,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:35:12,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508137399] [2025-03-08 05:35:12,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508137399] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:35:12,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:35:12,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:35:12,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674037241] [2025-03-08 05:35:12,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:35:12,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:35:12,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:35:12,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:35:12,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:35:12,221 INFO L87 Difference]: Start difference. First operand 382 states and 583 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-08 05:35:12,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:35:12,270 INFO L93 Difference]: Finished difference Result 741 states and 1139 transitions. [2025-03-08 05:35:12,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:35:12,270 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 126 [2025-03-08 05:35:12,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:35:12,275 INFO L225 Difference]: With dead ends: 741 [2025-03-08 05:35:12,275 INFO L226 Difference]: Without dead ends: 384 [2025-03-08 05:35:12,276 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:35:12,277 INFO L435 NwaCegarLoop]: 479 mSDtfsCounter, 1 mSDsluCounter, 1419 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1898 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:35:12,278 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1898 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:35:12,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2025-03-08 05:35:12,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 384. [2025-03-08 05:35:12,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 295 states have (on average 1.5254237288135593) internal successors, (450), 301 states have internal predecessors, (450), 65 states have call successors, (65), 20 states have call predecessors, (65), 23 states have return successors, (74), 64 states have call predecessors, (74), 64 states have call successors, (74) [2025-03-08 05:35:12,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 589 transitions. [2025-03-08 05:35:12,295 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 589 transitions. Word has length 126 [2025-03-08 05:35:12,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:35:12,295 INFO L471 AbstractCegarLoop]: Abstraction has 384 states and 589 transitions. [2025-03-08 05:35:12,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-08 05:35:12,295 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 589 transitions. [2025-03-08 05:35:12,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-08 05:35:12,298 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:35:12,298 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:35:12,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 05:35:12,298 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:35:12,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:35:12,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1980487418, now seen corresponding path program 1 times [2025-03-08 05:35:12,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:35:12,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590838076] [2025-03-08 05:35:12,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:35:12,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:35:12,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-08 05:35:12,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-08 05:35:12,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:35:12,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:35:12,466 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-08 05:35:12,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:35:12,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590838076] [2025-03-08 05:35:12,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590838076] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:35:12,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:35:12,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:35:12,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975023142] [2025-03-08 05:35:12,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:35:12,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:35:12,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:35:12,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:35:12,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:35:12,468 INFO L87 Difference]: Start difference. First operand 384 states and 589 transitions. Second operand has 5 states, 4 states have (on average 20.5) internal successors, (82), 5 states have internal predecessors, (82), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-08 05:35:12,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:35:12,509 INFO L93 Difference]: Finished difference Result 747 states and 1149 transitions. [2025-03-08 05:35:12,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:35:12,510 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.5) internal successors, (82), 5 states have internal predecessors, (82), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 127 [2025-03-08 05:35:12,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:35:12,513 INFO L225 Difference]: With dead ends: 747 [2025-03-08 05:35:12,513 INFO L226 Difference]: Without dead ends: 386 [2025-03-08 05:35:12,514 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:35:12,515 INFO L435 NwaCegarLoop]: 479 mSDtfsCounter, 1 mSDsluCounter, 1425 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1904 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:35:12,515 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1904 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:35:12,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2025-03-08 05:35:12,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 386. [2025-03-08 05:35:12,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 296 states have (on average 1.5236486486486487) internal successors, (451), 303 states have internal predecessors, (451), 65 states have call successors, (65), 20 states have call predecessors, (65), 24 states have return successors, (76), 64 states have call predecessors, (76), 64 states have call successors, (76) [2025-03-08 05:35:12,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 592 transitions. [2025-03-08 05:35:12,532 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 592 transitions. Word has length 127 [2025-03-08 05:35:12,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:35:12,532 INFO L471 AbstractCegarLoop]: Abstraction has 386 states and 592 transitions. [2025-03-08 05:35:12,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.5) internal successors, (82), 5 states have internal predecessors, (82), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-08 05:35:12,533 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 592 transitions. [2025-03-08 05:35:12,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-08 05:35:12,535 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:35:12,535 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:35:12,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 05:35:12,535 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:35:12,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:35:12,536 INFO L85 PathProgramCache]: Analyzing trace with hash 2118470729, now seen corresponding path program 1 times [2025-03-08 05:35:12,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:35:12,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995794243] [2025-03-08 05:35:12,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:35:12,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:35:12,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-08 05:35:12,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-08 05:35:12,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:35:12,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:35:12,697 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-08 05:35:12,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:35:12,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995794243] [2025-03-08 05:35:12,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995794243] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:35:12,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [79427859] [2025-03-08 05:35:12,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:35:12,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:35:12,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:35:12,700 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:35:12,702 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:35:12,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-08 05:35:12,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-08 05:35:12,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:35:12,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:35:12,939 INFO L256 TraceCheckSpWp]: Trace formula consists of 1064 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 05:35:12,942 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:35:12,981 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-08 05:35:12,981 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:35:13,070 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-08 05:35:13,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [79427859] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:35:13,071 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:35:13,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 11 [2025-03-08 05:35:13,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899840994] [2025-03-08 05:35:13,071 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:35:13,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 05:35:13,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:35:13,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 05:35:13,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-08 05:35:13,072 INFO L87 Difference]: Start difference. First operand 386 states and 592 transitions. Second operand has 11 states, 10 states have (on average 13.0) internal successors, (130), 11 states have internal predecessors, (130), 4 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (28), 3 states have call predecessors, (28), 4 states have call successors, (28) [2025-03-08 05:35:13,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:35:13,648 INFO L93 Difference]: Finished difference Result 1112 states and 1784 transitions. [2025-03-08 05:35:13,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 05:35:13,649 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 13.0) internal successors, (130), 11 states have internal predecessors, (130), 4 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (28), 3 states have call predecessors, (28), 4 states have call successors, (28) Word has length 128 [2025-03-08 05:35:13,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:35:13,654 INFO L225 Difference]: With dead ends: 1112 [2025-03-08 05:35:13,654 INFO L226 Difference]: Without dead ends: 754 [2025-03-08 05:35:13,656 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=400, Unknown=0, NotChecked=0, Total=506 [2025-03-08 05:35:13,657 INFO L435 NwaCegarLoop]: 484 mSDtfsCounter, 1137 mSDsluCounter, 3288 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1137 SdHoareTripleChecker+Valid, 3772 SdHoareTripleChecker+Invalid, 604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 05:35:13,658 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1137 Valid, 3772 Invalid, 604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 517 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 05:35:13,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2025-03-08 05:35:13,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 730. [2025-03-08 05:35:13,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 730 states, 576 states have (on average 1.5850694444444444) internal successors, (913), 582 states have internal predecessors, (913), 129 states have call successors, (129), 21 states have call predecessors, (129), 24 states have return successors, (150), 128 states have call predecessors, (150), 128 states have call successors, (150) [2025-03-08 05:35:13,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 730 states and 1192 transitions. [2025-03-08 05:35:13,706 INFO L78 Accepts]: Start accepts. Automaton has 730 states and 1192 transitions. Word has length 128 [2025-03-08 05:35:13,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:35:13,706 INFO L471 AbstractCegarLoop]: Abstraction has 730 states and 1192 transitions. [2025-03-08 05:35:13,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 13.0) internal successors, (130), 11 states have internal predecessors, (130), 4 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (28), 3 states have call predecessors, (28), 4 states have call successors, (28) [2025-03-08 05:35:13,706 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 1192 transitions. [2025-03-08 05:35:13,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-08 05:35:13,710 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:35:13,710 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:35:13,720 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-08 05:35:13,910 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:35:13,911 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:35:13,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:35:13,912 INFO L85 PathProgramCache]: Analyzing trace with hash 765448549, now seen corresponding path program 1 times [2025-03-08 05:35:13,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:35:13,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480953997] [2025-03-08 05:35:13,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:35:13,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:35:13,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 05:35:13,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 05:35:13,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:35:13,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:35:13,973 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-08 05:35:13,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:35:13,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480953997] [2025-03-08 05:35:13,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480953997] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:35:13,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:35:13,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:35:13,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722328134] [2025-03-08 05:35:13,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:35:13,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:35:13,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:35:13,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:35:13,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:35:13,975 INFO L87 Difference]: Start difference. First operand 730 states and 1192 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, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 05:35:14,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:35:14,012 INFO L93 Difference]: Finished difference Result 1705 states and 2832 transitions. [2025-03-08 05:35:14,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:35:14,012 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, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 132 [2025-03-08 05:35:14,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:35:14,018 INFO L225 Difference]: With dead ends: 1705 [2025-03-08 05:35:14,018 INFO L226 Difference]: Without dead ends: 1051 [2025-03-08 05:35:14,021 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:35:14,021 INFO L435 NwaCegarLoop]: 502 mSDtfsCounter, 112 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 977 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:35:14,021 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 977 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:35:14,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1051 states. [2025-03-08 05:35:14,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1051 to 1043. [2025-03-08 05:35:14,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1043 states, 825 states have (on average 1.6072727272727272) internal successors, (1326), 831 states have internal predecessors, (1326), 193 states have call successors, (193), 21 states have call predecessors, (193), 24 states have return successors, (224), 192 states have call predecessors, (224), 192 states have call successors, (224) [2025-03-08 05:35:14,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1043 states to 1043 states and 1743 transitions. [2025-03-08 05:35:14,076 INFO L78 Accepts]: Start accepts. Automaton has 1043 states and 1743 transitions. Word has length 132 [2025-03-08 05:35:14,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:35:14,077 INFO L471 AbstractCegarLoop]: Abstraction has 1043 states and 1743 transitions. [2025-03-08 05:35:14,077 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, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 05:35:14,077 INFO L276 IsEmpty]: Start isEmpty. Operand 1043 states and 1743 transitions. [2025-03-08 05:35:14,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-08 05:35:14,082 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:35:14,083 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:35:14,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 05:35:14,083 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:35:14,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:35:14,083 INFO L85 PathProgramCache]: Analyzing trace with hash -165759310, now seen corresponding path program 1 times [2025-03-08 05:35:14,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:35:14,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920628643] [2025-03-08 05:35:14,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:35:14,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:35:14,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 05:35:14,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 05:35:14,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:35:14,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:35:14,138 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-08 05:35:14,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:35:14,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920628643] [2025-03-08 05:35:14,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920628643] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:35:14,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:35:14,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:35:14,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526875249] [2025-03-08 05:35:14,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:35:14,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:35:14,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:35:14,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:35:14,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:35:14,140 INFO L87 Difference]: Start difference. First operand 1043 states and 1743 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, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 05:35:14,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:35:14,202 INFO L93 Difference]: Finished difference Result 2482 states and 4172 transitions. [2025-03-08 05:35:14,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:35:14,202 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, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 133 [2025-03-08 05:35:14,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:35:14,209 INFO L225 Difference]: With dead ends: 2482 [2025-03-08 05:35:14,209 INFO L226 Difference]: Without dead ends: 1564 [2025-03-08 05:35:14,212 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:35:14,212 INFO L435 NwaCegarLoop]: 483 mSDtfsCounter, 110 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 960 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:35:14,212 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 960 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:35:14,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1564 states. [2025-03-08 05:35:14,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1564 to 1556. [2025-03-08 05:35:14,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1556 states, 1243 states have (on average 1.6186645213193886) internal successors, (2012), 1249 states have internal predecessors, (2012), 288 states have call successors, (288), 21 states have call predecessors, (288), 24 states have return successors, (319), 287 states have call predecessors, (319), 287 states have call successors, (319) [2025-03-08 05:35:14,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1556 states to 1556 states and 2619 transitions. [2025-03-08 05:35:14,274 INFO L78 Accepts]: Start accepts. Automaton has 1556 states and 2619 transitions. Word has length 133 [2025-03-08 05:35:14,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:35:14,274 INFO L471 AbstractCegarLoop]: Abstraction has 1556 states and 2619 transitions. [2025-03-08 05:35:14,274 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, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 05:35:14,274 INFO L276 IsEmpty]: Start isEmpty. Operand 1556 states and 2619 transitions. [2025-03-08 05:35:14,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-08 05:35:14,281 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:35:14,281 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:35:14,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 05:35:14,282 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:35:14,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:35:14,282 INFO L85 PathProgramCache]: Analyzing trace with hash -84218556, now seen corresponding path program 1 times [2025-03-08 05:35:14,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:35:14,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432410851] [2025-03-08 05:35:14,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:35:14,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:35:14,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-08 05:35:14,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-08 05:35:14,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:35:14,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:35:14,332 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-08 05:35:14,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:35:14,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432410851] [2025-03-08 05:35:14,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432410851] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:35:14,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:35:14,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:35:14,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944033889] [2025-03-08 05:35:14,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:35:14,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:35:14,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:35:14,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:35:14,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:35:14,334 INFO L87 Difference]: Start difference. First operand 1556 states and 2619 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, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 05:35:14,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:35:14,411 INFO L93 Difference]: Finished difference Result 3643 states and 6178 transitions. [2025-03-08 05:35:14,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:35:14,412 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, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 134 [2025-03-08 05:35:14,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:35:14,425 INFO L225 Difference]: With dead ends: 3643 [2025-03-08 05:35:14,425 INFO L226 Difference]: Without dead ends: 2340 [2025-03-08 05:35:14,430 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:35:14,431 INFO L435 NwaCegarLoop]: 483 mSDtfsCounter, 108 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 957 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:35:14,431 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 957 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:35:14,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2340 states. [2025-03-08 05:35:14,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2340 to 2332. [2025-03-08 05:35:14,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2332 states, 1896 states have (on average 1.6276371308016877) internal successors, (3086), 1902 states have internal predecessors, (3086), 411 states have call successors, (411), 21 states have call predecessors, (411), 24 states have return successors, (458), 410 states have call predecessors, (458), 410 states have call successors, (458) [2025-03-08 05:35:14,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2332 states to 2332 states and 3955 transitions. [2025-03-08 05:35:14,573 INFO L78 Accepts]: Start accepts. Automaton has 2332 states and 3955 transitions. Word has length 134 [2025-03-08 05:35:14,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:35:14,573 INFO L471 AbstractCegarLoop]: Abstraction has 2332 states and 3955 transitions. [2025-03-08 05:35:14,574 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, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 05:35:14,574 INFO L276 IsEmpty]: Start isEmpty. Operand 2332 states and 3955 transitions. [2025-03-08 05:35:14,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-08 05:35:14,586 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:35:14,586 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:35:14,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 05:35:14,586 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:35:14,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:35:14,587 INFO L85 PathProgramCache]: Analyzing trace with hash -932295565, now seen corresponding path program 1 times [2025-03-08 05:35:14,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:35:14,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383273466] [2025-03-08 05:35:14,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:35:14,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:35:14,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-08 05:35:14,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-08 05:35:14,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:35:14,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:35:14,649 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-08 05:35:14,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:35:14,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383273466] [2025-03-08 05:35:14,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383273466] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:35:14,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:35:14,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:35:14,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400005512] [2025-03-08 05:35:14,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:35:14,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:35:14,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:35:14,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:35:14,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:35:14,650 INFO L87 Difference]: Start difference. First operand 2332 states and 3955 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 05:35:14,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:35:14,762 INFO L93 Difference]: Finished difference Result 5450 states and 9304 transitions. [2025-03-08 05:35:14,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:35:14,762 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 135 [2025-03-08 05:35:14,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:35:14,815 INFO L225 Difference]: With dead ends: 5450 [2025-03-08 05:35:14,815 INFO L226 Difference]: Without dead ends: 3579 [2025-03-08 05:35:14,820 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:35:14,821 INFO L435 NwaCegarLoop]: 483 mSDtfsCounter, 106 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 957 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:35:14,821 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 957 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:35:14,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3579 states. [2025-03-08 05:35:14,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3579 to 3571. [2025-03-08 05:35:14,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3571 states, 2956 states have (on average 1.6336265223274695) internal successors, (4829), 2962 states have internal predecessors, (4829), 590 states have call successors, (590), 21 states have call predecessors, (590), 24 states have return successors, (663), 589 states have call predecessors, (663), 589 states have call successors, (663) [2025-03-08 05:35:14,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3571 states to 3571 states and 6082 transitions. [2025-03-08 05:35:14,998 INFO L78 Accepts]: Start accepts. Automaton has 3571 states and 6082 transitions. Word has length 135 [2025-03-08 05:35:14,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:35:14,998 INFO L471 AbstractCegarLoop]: Abstraction has 3571 states and 6082 transitions. [2025-03-08 05:35:14,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 05:35:14,999 INFO L276 IsEmpty]: Start isEmpty. Operand 3571 states and 6082 transitions. [2025-03-08 05:35:15,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-08 05:35:15,017 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:35:15,017 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:35:15,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 05:35:15,018 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:35:15,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:35:15,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1422185027, now seen corresponding path program 1 times [2025-03-08 05:35:15,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:35:15,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162997848] [2025-03-08 05:35:15,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:35:15,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:35:15,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-08 05:35:15,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-08 05:35:15,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:35:15,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:35:15,081 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-08 05:35:15,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:35:15,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162997848] [2025-03-08 05:35:15,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162997848] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:35:15,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:35:15,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:35:15,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499664208] [2025-03-08 05:35:15,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:35:15,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:35:15,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:35:15,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:35:15,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:35:15,083 INFO L87 Difference]: Start difference. First operand 3571 states and 6082 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 05:35:15,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:35:15,247 INFO L93 Difference]: Finished difference Result 8420 states and 14435 transitions. [2025-03-08 05:35:15,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:35:15,247 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 136 [2025-03-08 05:35:15,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:35:15,280 INFO L225 Difference]: With dead ends: 8420 [2025-03-08 05:35:15,280 INFO L226 Difference]: Without dead ends: 5626 [2025-03-08 05:35:15,292 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:35:15,293 INFO L435 NwaCegarLoop]: 500 mSDtfsCounter, 104 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 974 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:35:15,293 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 974 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:35:15,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5626 states. [2025-03-08 05:35:15,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5626 to 5618. [2025-03-08 05:35:15,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5618 states, 4627 states have (on average 1.6297817160146963) internal successors, (7541), 4633 states have internal predecessors, (7541), 966 states have call successors, (966), 21 states have call predecessors, (966), 24 states have return successors, (1083), 965 states have call predecessors, (1083), 965 states have call successors, (1083) [2025-03-08 05:35:15,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5618 states to 5618 states and 9590 transitions. [2025-03-08 05:35:15,593 INFO L78 Accepts]: Start accepts. Automaton has 5618 states and 9590 transitions. Word has length 136 [2025-03-08 05:35:15,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:35:15,593 INFO L471 AbstractCegarLoop]: Abstraction has 5618 states and 9590 transitions. [2025-03-08 05:35:15,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 05:35:15,593 INFO L276 IsEmpty]: Start isEmpty. Operand 5618 states and 9590 transitions. [2025-03-08 05:35:15,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-08 05:35:15,616 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:35:15,616 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:35:15,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 05:35:15,617 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:35:15,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:35:15,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1540601804, now seen corresponding path program 1 times [2025-03-08 05:35:15,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:35:15,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289386651] [2025-03-08 05:35:15,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:35:15,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:35:15,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-08 05:35:15,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-08 05:35:15,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:35:15,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:35:15,706 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-08 05:35:15,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:35:15,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289386651] [2025-03-08 05:35:15,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289386651] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:35:15,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:35:15,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:35:15,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643182948] [2025-03-08 05:35:15,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:35:15,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:35:15,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:35:15,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:35:15,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:35:15,709 INFO L87 Difference]: Start difference. First operand 5618 states and 9590 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 05:35:16,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:35:16,037 INFO L93 Difference]: Finished difference Result 13799 states and 23699 transitions. [2025-03-08 05:35:16,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:35:16,038 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 137 [2025-03-08 05:35:16,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:35:16,100 INFO L225 Difference]: With dead ends: 13799 [2025-03-08 05:35:16,100 INFO L226 Difference]: Without dead ends: 9338 [2025-03-08 05:35:16,124 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:35:16,124 INFO L435 NwaCegarLoop]: 492 mSDtfsCounter, 102 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 970 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:35:16,124 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 970 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:35:16,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9338 states. [2025-03-08 05:35:16,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9338 to 9330. [2025-03-08 05:35:16,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9330 states, 7733 states have (on average 1.6286046812362602) internal successors, (12594), 7739 states have internal predecessors, (12594), 1572 states have call successors, (1572), 21 states have call predecessors, (1572), 24 states have return successors, (1767), 1571 states have call predecessors, (1767), 1571 states have call successors, (1767) [2025-03-08 05:35:16,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9330 states to 9330 states and 15933 transitions. [2025-03-08 05:35:16,610 INFO L78 Accepts]: Start accepts. Automaton has 9330 states and 15933 transitions. Word has length 137 [2025-03-08 05:35:16,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:35:16,612 INFO L471 AbstractCegarLoop]: Abstraction has 9330 states and 15933 transitions. [2025-03-08 05:35:16,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 05:35:16,612 INFO L276 IsEmpty]: Start isEmpty. Operand 9330 states and 15933 transitions. [2025-03-08 05:35:16,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-08 05:35:16,652 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:35:16,652 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:35:16,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 05:35:16,652 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:35:16,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:35:16,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1641824610, now seen corresponding path program 1 times [2025-03-08 05:35:16,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:35:16,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846661255] [2025-03-08 05:35:16,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:35:16,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:35:16,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-08 05:35:16,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-08 05:35:16,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:35:16,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:35:16,723 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-08 05:35:16,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:35:16,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846661255] [2025-03-08 05:35:16,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846661255] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:35:16,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:35:16,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:35:16,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625424704] [2025-03-08 05:35:16,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:35:16,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:35:16,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:35:16,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:35:16,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:35:16,726 INFO L87 Difference]: Start difference. First operand 9330 states and 15933 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 05:35:17,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:35:17,133 INFO L93 Difference]: Finished difference Result 24068 states and 41259 transitions. [2025-03-08 05:35:17,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:35:17,134 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 138 [2025-03-08 05:35:17,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:35:17,205 INFO L225 Difference]: With dead ends: 24068 [2025-03-08 05:35:17,206 INFO L226 Difference]: Without dead ends: 16348 [2025-03-08 05:35:17,238 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:35:17,239 INFO L435 NwaCegarLoop]: 499 mSDtfsCounter, 100 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 980 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.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:35:17,239 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 980 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:35:17,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16348 states. [2025-03-08 05:35:17,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16348 to 16340. [2025-03-08 05:35:17,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16340 states, 13540 states have (on average 1.620162481536189) internal successors, (21937), 13546 states have internal predecessors, (21937), 2775 states have call successors, (2775), 21 states have call predecessors, (2775), 24 states have return successors, (3114), 2774 states have call predecessors, (3114), 2774 states have call successors, (3114) [2025-03-08 05:35:18,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16340 states to 16340 states and 27826 transitions. [2025-03-08 05:35:18,026 INFO L78 Accepts]: Start accepts. Automaton has 16340 states and 27826 transitions. Word has length 138 [2025-03-08 05:35:18,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:35:18,026 INFO L471 AbstractCegarLoop]: Abstraction has 16340 states and 27826 transitions. [2025-03-08 05:35:18,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 05:35:18,027 INFO L276 IsEmpty]: Start isEmpty. Operand 16340 states and 27826 transitions. [2025-03-08 05:35:18,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-08 05:35:18,070 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:35:18,070 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:35:18,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 05:35:18,071 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:35:18,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:35:18,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1143608181, now seen corresponding path program 1 times [2025-03-08 05:35:18,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:35:18,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820769636] [2025-03-08 05:35:18,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:35:18,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:35:18,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-08 05:35:18,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-08 05:35:18,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:35:18,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:35:18,140 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-08 05:35:18,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:35:18,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820769636] [2025-03-08 05:35:18,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820769636] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:35:18,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:35:18,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:35:18,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620445402] [2025-03-08 05:35:18,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:35:18,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:35:18,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:35:18,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:35:18,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:35:18,142 INFO L87 Difference]: Start difference. First operand 16340 states and 27826 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 05:35:18,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:35:18,762 INFO L93 Difference]: Finished difference Result 43209 states and 73897 transitions. [2025-03-08 05:35:18,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:35:18,763 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 139 [2025-03-08 05:35:18,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:35:18,891 INFO L225 Difference]: With dead ends: 43209 [2025-03-08 05:35:18,891 INFO L226 Difference]: Without dead ends: 29119 [2025-03-08 05:35:18,942 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:35:18,943 INFO L435 NwaCegarLoop]: 483 mSDtfsCounter, 98 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 960 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:35:18,943 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 960 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:35:18,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29119 states. [2025-03-08 05:35:19,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29119 to 29111. [2025-03-08 05:35:19,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29111 states, 24272 states have (on average 1.616306855636124) internal successors, (39231), 24278 states have internal predecessors, (39231), 4814 states have call successors, (4814), 21 states have call predecessors, (4814), 24 states have return successors, (5427), 4813 states have call predecessors, (5427), 4813 states have call successors, (5427) [2025-03-08 05:35:20,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29111 states to 29111 states and 49472 transitions. [2025-03-08 05:35:20,103 INFO L78 Accepts]: Start accepts. Automaton has 29111 states and 49472 transitions. Word has length 139 [2025-03-08 05:35:20,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:35:20,104 INFO L471 AbstractCegarLoop]: Abstraction has 29111 states and 49472 transitions. [2025-03-08 05:35:20,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 05:35:20,104 INFO L276 IsEmpty]: Start isEmpty. Operand 29111 states and 49472 transitions. [2025-03-08 05:35:20,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-08 05:35:20,152 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:35:20,152 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:35:20,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 05:35:20,153 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:35:20,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:35:20,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1043011489, now seen corresponding path program 1 times [2025-03-08 05:35:20,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:35:20,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012912054] [2025-03-08 05:35:20,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:35:20,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:35:20,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-08 05:35:20,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-08 05:35:20,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:35:20,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:35:20,205 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-08 05:35:20,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:35:20,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012912054] [2025-03-08 05:35:20,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012912054] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:35:20,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:35:20,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:35:20,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709495170] [2025-03-08 05:35:20,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:35:20,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:35:20,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:35:20,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:35:20,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:35:20,207 INFO L87 Difference]: Start difference. First operand 29111 states and 49472 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 05:35:21,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:35:21,743 INFO L93 Difference]: Finished difference Result 79331 states and 135274 transitions. [2025-03-08 05:35:21,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:35:21,744 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 140 [2025-03-08 05:35:21,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:35:22,015 INFO L225 Difference]: With dead ends: 79331 [2025-03-08 05:35:22,015 INFO L226 Difference]: Without dead ends: 53236 [2025-03-08 05:35:22,125 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:35:22,125 INFO L435 NwaCegarLoop]: 490 mSDtfsCounter, 96 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 968 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:35:22,126 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 968 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:35:22,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53236 states. [2025-03-08 05:35:24,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53236 to 53228. [2025-03-08 05:35:24,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53228 states, 44674 states have (on average 1.6110041634955454) internal successors, (71970), 44680 states have internal predecessors, (71970), 8529 states have call successors, (8529), 21 states have call predecessors, (8529), 24 states have return successors, (9674), 8528 states have call predecessors, (9674), 8528 states have call successors, (9674) [2025-03-08 05:35:24,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53228 states to 53228 states and 90173 transitions. [2025-03-08 05:35:24,365 INFO L78 Accepts]: Start accepts. Automaton has 53228 states and 90173 transitions. Word has length 140 [2025-03-08 05:35:24,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:35:24,366 INFO L471 AbstractCegarLoop]: Abstraction has 53228 states and 90173 transitions. [2025-03-08 05:35:24,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 05:35:24,366 INFO L276 IsEmpty]: Start isEmpty. Operand 53228 states and 90173 transitions. [2025-03-08 05:35:24,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-08 05:35:24,423 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:35:24,423 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:35:24,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 05:35:24,423 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:35:24,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:35:24,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1732201302, now seen corresponding path program 1 times [2025-03-08 05:35:24,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:35:24,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017494014] [2025-03-08 05:35:24,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:35:24,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:35:24,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-08 05:35:24,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-08 05:35:24,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:35:24,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:35:24,479 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-08 05:35:24,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:35:24,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017494014] [2025-03-08 05:35:24,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017494014] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:35:24,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:35:24,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:35:24,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727741915] [2025-03-08 05:35:24,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:35:24,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:35:24,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:35:24,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:35:24,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:35:24,482 INFO L87 Difference]: Start difference. First operand 53228 states and 90173 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 05:35:27,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:35:27,219 INFO L93 Difference]: Finished difference Result 99358 states and 168662 transitions. [2025-03-08 05:35:27,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:35:27,219 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 141 [2025-03-08 05:35:27,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:35:27,761 INFO L225 Difference]: With dead ends: 99358 [2025-03-08 05:35:27,761 INFO L226 Difference]: Without dead ends: 99189 [2025-03-08 05:35:27,841 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:35:27,841 INFO L435 NwaCegarLoop]: 485 mSDtfsCounter, 91 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 966 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:35:27,841 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 966 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:35:27,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99189 states. [2025-03-08 05:35:30,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99189 to 99181. [2025-03-08 05:35:30,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99181 states, 83828 states have (on average 1.6042372476976667) internal successors, (134480), 83834 states have internal predecessors, (134480), 15328 states have call successors, (15328), 21 states have call predecessors, (15328), 24 states have return successors, (17519), 15327 states have call predecessors, (17519), 15327 states have call successors, (17519) [2025-03-08 05:35:31,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99181 states to 99181 states and 167327 transitions. [2025-03-08 05:35:31,071 INFO L78 Accepts]: Start accepts. Automaton has 99181 states and 167327 transitions. Word has length 141 [2025-03-08 05:35:31,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:35:31,072 INFO L471 AbstractCegarLoop]: Abstraction has 99181 states and 167327 transitions. [2025-03-08 05:35:31,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 05:35:31,072 INFO L276 IsEmpty]: Start isEmpty. Operand 99181 states and 167327 transitions. [2025-03-08 05:35:31,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-08 05:35:31,146 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:35:31,146 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:35:31,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 05:35:31,146 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:35:31,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:35:31,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1185187232, now seen corresponding path program 1 times [2025-03-08 05:35:31,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:35:31,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726988039] [2025-03-08 05:35:31,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:35:31,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:35:31,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-08 05:35:31,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-08 05:35:31,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:35:31,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:35:31,392 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-08 05:35:31,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:35:31,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726988039] [2025-03-08 05:35:31,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726988039] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:35:31,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1724425084] [2025-03-08 05:35:31,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:35:31,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:35:31,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:35:31,395 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:35:31,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 05:35:31,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-08 05:35:31,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-08 05:35:31,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:35:31,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:35:31,716 INFO L256 TraceCheckSpWp]: Trace formula consists of 1103 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-08 05:35:31,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:35:32,100 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 05:35:32,101 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:35:32,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1724425084] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:35:32,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:35:32,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [12] total 22 [2025-03-08 05:35:32,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207143319] [2025-03-08 05:35:32,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:35:32,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 05:35:32,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:35:32,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 05:35:32,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2025-03-08 05:35:32,104 INFO L87 Difference]: Start difference. First operand 99181 states and 167327 transitions. Second operand has 12 states, 11 states have (on average 9.454545454545455) internal successors, (104), 9 states have internal predecessors, (104), 5 states have call successors, (17), 5 states have call predecessors, (17), 5 states have return successors, (15), 6 states have call predecessors, (15), 5 states have call successors, (15) [2025-03-08 05:35:37,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:35:37,177 INFO L93 Difference]: Finished difference Result 197707 states and 339015 transitions. [2025-03-08 05:35:37,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 05:35:37,179 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 9.454545454545455) internal successors, (104), 9 states have internal predecessors, (104), 5 states have call successors, (17), 5 states have call predecessors, (17), 5 states have return successors, (15), 6 states have call predecessors, (15), 5 states have call successors, (15) Word has length 142 [2025-03-08 05:35:37,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:35:38,107 INFO L225 Difference]: With dead ends: 197707 [2025-03-08 05:35:38,108 INFO L226 Difference]: Without dead ends: 197544 [2025-03-08 05:35:38,205 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=160, Invalid=896, Unknown=0, NotChecked=0, Total=1056 [2025-03-08 05:35:38,206 INFO L435 NwaCegarLoop]: 601 mSDtfsCounter, 799 mSDsluCounter, 4592 mSDsCounter, 0 mSdLazyCounter, 1233 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 803 SdHoareTripleChecker+Valid, 5193 SdHoareTripleChecker+Invalid, 1343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 1233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 05:35:38,206 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [803 Valid, 5193 Invalid, 1343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 1233 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 05:35:38,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197544 states. [2025-03-08 05:35:44,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197544 to 197514. [2025-03-08 05:35:44,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197514 states, 167001 states have (on average 1.604996377267202) internal successors, (268036), 166903 states have internal predecessors, (268036), 30453 states have call successors, (30453), 53 states have call predecessors, (30453), 59 states have return successors, (38109), 30563 states have call predecessors, (38109), 30450 states have call successors, (38109) [2025-03-08 05:35:45,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197514 states to 197514 states and 336598 transitions. [2025-03-08 05:35:45,891 INFO L78 Accepts]: Start accepts. Automaton has 197514 states and 336598 transitions. Word has length 142 [2025-03-08 05:35:45,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:35:45,892 INFO L471 AbstractCegarLoop]: Abstraction has 197514 states and 336598 transitions. [2025-03-08 05:35:45,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 9.454545454545455) internal successors, (104), 9 states have internal predecessors, (104), 5 states have call successors, (17), 5 states have call predecessors, (17), 5 states have return successors, (15), 6 states have call predecessors, (15), 5 states have call successors, (15) [2025-03-08 05:35:45,892 INFO L276 IsEmpty]: Start isEmpty. Operand 197514 states and 336598 transitions. [2025-03-08 05:35:46,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-08 05:35:46,114 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:35:46,115 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:35:46,126 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-08 05:35:46,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:35:46,315 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:35:46,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:35:46,316 INFO L85 PathProgramCache]: Analyzing trace with hash 848202170, now seen corresponding path program 1 times [2025-03-08 05:35:46,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:35:46,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488530984] [2025-03-08 05:35:46,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:35:46,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:35:46,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 05:35:46,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 05:35:46,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:35:46,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:35:46,432 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-08 05:35:46,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:35:46,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488530984] [2025-03-08 05:35:46,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488530984] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:35:46,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:35:46,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:35:46,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357933963] [2025-03-08 05:35:46,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:35:46,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:35:46,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:35:46,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:35:46,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:35:46,434 INFO L87 Difference]: Start difference. First operand 197514 states and 336598 transitions. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15)