./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec0_product33.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_spec0_product33.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6a2f1102c08ad072b808cfc472937f1cd1560bb61fc22de7fb77e42f10991bfd --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 05:29:52,647 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 05:29:52,693 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 05:29:52,697 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 05:29:52,697 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 05:29:52,714 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 05:29:52,715 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 05:29:52,715 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 05:29:52,716 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 05:29:52,716 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 05:29:52,717 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 05:29:52,717 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 05:29:52,717 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 05:29:52,717 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 05:29:52,717 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 05:29:52,718 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 05:29:52,718 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 05:29:52,718 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 05:29:52,718 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 05:29:52,718 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 05:29:52,718 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 05:29:52,718 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 05:29:52,718 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 05:29:52,718 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 05:29:52,718 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 05:29:52,719 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 05:29:52,719 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 05:29:52,719 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 05:29:52,719 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 05:29:52,719 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 05:29:52,719 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 05:29:52,719 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 05:29:52,719 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:29:52,719 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 05:29:52,719 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 05:29:52,719 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 05:29:52,719 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 05:29:52,719 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 05:29:52,719 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 05:29:52,719 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 05:29:52,719 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 05:29:52,719 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 05:29:52,719 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 05:29:52,719 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 -> 6a2f1102c08ad072b808cfc472937f1cd1560bb61fc22de7fb77e42f10991bfd [2025-03-08 05:29:52,950 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 05:29:52,957 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 05:29:52,959 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 05:29:52,961 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 05:29:52,961 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 05:29:52,962 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec0_product33.cil.c [2025-03-08 05:29:54,090 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4588d517f/b3d19a661c23446c8d63e90e47a8d22b/FLAG32cebd5b9 [2025-03-08 05:29:54,427 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 05:29:54,427 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec0_product33.cil.c [2025-03-08 05:29:54,442 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4588d517f/b3d19a661c23446c8d63e90e47a8d22b/FLAG32cebd5b9 [2025-03-08 05:29:54,664 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4588d517f/b3d19a661c23446c8d63e90e47a8d22b [2025-03-08 05:29:54,666 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 05:29:54,667 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 05:29:54,668 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 05:29:54,668 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 05:29:54,671 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 05:29:54,672 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:29:54" (1/1) ... [2025-03-08 05:29:54,672 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57d4671 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:54, skipping insertion in model container [2025-03-08 05:29:54,672 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:29:54" (1/1) ... [2025-03-08 05:29:54,704 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 05:29:54,951 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_spec0_product33.cil.c[31228,31241] [2025-03-08 05:29:55,095 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:29:55,110 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 05:29:55,117 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [48] [2025-03-08 05:29:55,118 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [1128] [2025-03-08 05:29:55,118 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [1288] [2025-03-08 05:29:55,119 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [1326] [2025-03-08 05:29:55,119 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"DecryptForward_spec.i","") [1335] [2025-03-08 05:29:55,119 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [1355] [2025-03-08 05:29:55,119 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [1751] [2025-03-08 05:29:55,119 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [1768] [2025-03-08 05:29:55,119 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [2165] [2025-03-08 05:29:55,119 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [2531] [2025-03-08 05:29:55,119 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [2827] [2025-03-08 05:29:55,164 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_spec0_product33.cil.c[31228,31241] [2025-03-08 05:29:55,220 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:29:55,247 INFO L204 MainTranslator]: Completed translation [2025-03-08 05:29:55,248 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:55 WrapperNode [2025-03-08 05:29:55,248 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 05:29:55,249 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 05:29:55,249 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 05:29:55,249 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 05:29:55,254 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:29:55" (1/1) ... [2025-03-08 05:29:55,272 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:29:55" (1/1) ... [2025-03-08 05:29:55,309 INFO L138 Inliner]: procedures = 134, calls = 211, calls flagged for inlining = 65, calls inlined = 60, statements flattened = 1067 [2025-03-08 05:29:55,309 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 05:29:55,310 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 05:29:55,310 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 05:29:55,310 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 05:29:55,318 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:55" (1/1) ... [2025-03-08 05:29:55,319 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:55" (1/1) ... [2025-03-08 05:29:55,325 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:55" (1/1) ... [2025-03-08 05:29:55,347 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:29:55,348 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:55" (1/1) ... [2025-03-08 05:29:55,348 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:55" (1/1) ... [2025-03-08 05:29:55,366 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:55" (1/1) ... [2025-03-08 05:29:55,370 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:55" (1/1) ... [2025-03-08 05:29:55,381 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:55" (1/1) ... [2025-03-08 05:29:55,384 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:55" (1/1) ... [2025-03-08 05:29:55,392 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 05:29:55,393 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 05:29:55,393 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 05:29:55,394 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 05:29:55,394 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:55" (1/1) ... [2025-03-08 05:29:55,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:29:55,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:29:55,424 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:29:55,427 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:29:55,446 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2025-03-08 05:29:55,446 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2025-03-08 05:29:55,446 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2025-03-08 05:29:55,446 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2025-03-08 05:29:55,446 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2025-03-08 05:29:55,446 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2025-03-08 05:29:55,446 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-03-08 05:29:55,447 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-03-08 05:29:55,447 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-03-08 05:29:55,448 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-03-08 05:29:55,448 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2025-03-08 05:29:55,448 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2025-03-08 05:29:55,448 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-03-08 05:29:55,448 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-03-08 05:29:55,448 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2025-03-08 05:29:55,448 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2025-03-08 05:29:55,448 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2025-03-08 05:29:55,448 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2025-03-08 05:29:55,448 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-03-08 05:29:55,448 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-03-08 05:29:55,448 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-03-08 05:29:55,448 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-03-08 05:29:55,448 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2025-03-08 05:29:55,448 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2025-03-08 05:29:55,450 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-03-08 05:29:55,450 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-03-08 05:29:55,450 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 05:29:55,450 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2025-03-08 05:29:55,450 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2025-03-08 05:29:55,450 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2025-03-08 05:29:55,451 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2025-03-08 05:29:55,451 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-03-08 05:29:55,451 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-03-08 05:29:55,451 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-03-08 05:29:55,451 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-03-08 05:29:55,451 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-03-08 05:29:55,451 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-03-08 05:29:55,451 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2025-03-08 05:29:55,451 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2025-03-08 05:29:55,451 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-03-08 05:29:55,451 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-03-08 05:29:55,451 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2025-03-08 05:29:55,451 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2025-03-08 05:29:55,451 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-03-08 05:29:55,451 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-03-08 05:29:55,451 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-03-08 05:29:55,451 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-03-08 05:29:55,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 05:29:55,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 05:29:55,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 05:29:55,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 05:29:55,451 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-03-08 05:29:55,451 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-03-08 05:29:55,451 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 05:29:55,451 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 05:29:55,628 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 05:29:55,630 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 05:29:55,882 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L623-1: getClientAutoResponse_#res#1 := getClientAutoResponse_~retValue_acc~8#1; [2025-03-08 05:29:55,882 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1105-1: getClientId_#res#1 := getClientId_~retValue_acc~16#1; [2025-03-08 05:29:55,882 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2146-1: isVerified_#res#1 := isVerified_~retValue_acc~39#1; [2025-03-08 05:29:55,883 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1809-1: getEmailId_#res#1 := getEmailId_~retValue_acc~30#1; [2025-03-08 05:29:55,883 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1058-1: getClientForwardReceiver_#res#1 := getClientForwardReceiver_~retValue_acc~15#1; [2025-03-08 05:29:55,888 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2072: #res := ~retValue_acc~37; [2025-03-08 05:29:55,895 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1640: #res := ~retValue_acc~27; [2025-03-08 05:29:55,912 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L762: #res#1 := ~retValue_acc~11#1; [2025-03-08 05:29:55,912 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L717-1: getClientKeyringSize_#res#1 := getClientKeyringSize_~retValue_acc~10#1; [2025-03-08 05:29:55,928 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L986: #res := ~retValue_acc~14; [2025-03-08 05:29:55,935 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L670: #res := ~retValue_acc~9; [2025-03-08 05:29:55,943 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1285-1: createEmail_#res#1 := createEmail_~retValue_acc~20#1; [2025-03-08 05:29:55,952 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1998: #res := ~retValue_acc~35; [2025-03-08 05:29:55,961 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2035: #res := ~retValue_acc~36; [2025-03-08 05:29:55,965 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2109: #res := ~retValue_acc~38; [2025-03-08 05:29:55,981 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1883: #res := ~retValue_acc~32; [2025-03-08 05:29:56,197 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1597-1: is_queue_empty_#res#1 := is_queue_empty_~retValue_acc~24#1; [2025-03-08 05:29:56,197 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1606-1: get_queued_client_#res#1 := get_queued_client_~retValue_acc~25#1; [2025-03-08 05:29:56,197 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1615-1: get_queued_email_#res#1 := get_queued_email_~retValue_acc~26#1; [2025-03-08 05:29:56,197 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L932-1: getClientKeyringPublicKey_#res#1 := getClientKeyringPublicKey_~retValue_acc~13#1; [2025-03-08 05:29:56,197 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L825-1: getClientKeyringUser_#res#1 := getClientKeyringUser_~retValue_acc~12#1; [2025-03-08 05:29:56,198 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1323-1: valid_product_#res#1 := valid_product_~retValue_acc~22#1; [2025-03-08 05:29:56,203 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1846: #res := ~retValue_acc~31; [2025-03-08 05:29:56,213 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1261: #res#1 := ~retValue_acc~18#1; [2025-03-08 05:29:56,213 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1241-1: isReadable__wrappee__Keys_#res#1 := isReadable__wrappee__Keys_~retValue_acc~17#1; [2025-03-08 05:29:56,359 INFO L? ?]: Removed 497 outVars from TransFormulas that were not future-live. [2025-03-08 05:29:56,359 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 05:29:56,375 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 05:29:56,376 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 05:29:56,376 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:29:56 BoogieIcfgContainer [2025-03-08 05:29:56,376 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 05:29:56,378 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 05:29:56,378 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 05:29:56,381 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 05:29:56,382 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:29:54" (1/3) ... [2025-03-08 05:29:56,382 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ec5a05b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:29:56, skipping insertion in model container [2025-03-08 05:29:56,382 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:55" (2/3) ... [2025-03-08 05:29:56,382 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ec5a05b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:29:56, skipping insertion in model container [2025-03-08 05:29:56,383 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:29:56" (3/3) ... [2025-03-08 05:29:56,383 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec0_product33.cil.c [2025-03-08 05:29:56,395 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 05:29:56,397 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec0_product33.cil.c that has 25 procedures, 383 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 05:29:56,445 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 05:29:56,454 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;@6fc7d7e1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 05:29:56,454 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 05:29:56,457 INFO L276 IsEmpty]: Start isEmpty. Operand has 383 states, 295 states have (on average 1.5016949152542374) internal successors, (443), 299 states have internal predecessors, (443), 62 states have call successors, (62), 24 states have call predecessors, (62), 24 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2025-03-08 05:29:56,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-08 05:29:56,474 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:29:56,475 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 05:29:56,475 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:29:56,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:29:56,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1667583880, now seen corresponding path program 1 times [2025-03-08 05:29:56,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:29:56,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323387724] [2025-03-08 05:29:56,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:56,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:29:56,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-08 05:29:56,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-08 05:29:56,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:56,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:57,066 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-03-08 05:29:57,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:29:57,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323387724] [2025-03-08 05:29:57,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323387724] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:29:57,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1786780655] [2025-03-08 05:29:57,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:57,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:29:57,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:29:57,071 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:29:57,072 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:29:57,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-08 05:29:57,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-08 05:29:57,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:57,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:57,388 INFO L256 TraceCheckSpWp]: Trace formula consists of 1219 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 05:29:57,396 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:29:57,415 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-08 05:29:57,417 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:29:57,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1786780655] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:29:57,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:29:57,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 5 [2025-03-08 05:29:57,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029513607] [2025-03-08 05:29:57,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:29:57,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 05:29:57,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:29:57,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 05:29:57,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:29:57,437 INFO L87 Difference]: Start difference. First operand has 383 states, 295 states have (on average 1.5016949152542374) internal successors, (443), 299 states have internal predecessors, (443), 62 states have call successors, (62), 24 states have call predecessors, (62), 24 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) Second operand has 2 states, 2 states have (on average 39.0) internal successors, (78), 2 states have internal predecessors, (78), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 05:29:57,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:29:57,475 INFO L93 Difference]: Finished difference Result 609 states and 883 transitions. [2025-03-08 05:29:57,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 05:29:57,476 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 39.0) internal successors, (78), 2 states have internal predecessors, (78), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 149 [2025-03-08 05:29:57,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:29:57,485 INFO L225 Difference]: With dead ends: 609 [2025-03-08 05:29:57,485 INFO L226 Difference]: Without dead ends: 376 [2025-03-08 05:29:57,489 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 150 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:29:57,490 INFO L435 NwaCegarLoop]: 564 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:29:57,490 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 564 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:29:57,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2025-03-08 05:29:57,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 376. [2025-03-08 05:29:57,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 289 states have (on average 1.4982698961937717) internal successors, (433), 292 states have internal predecessors, (433), 62 states have call successors, (62), 24 states have call predecessors, (62), 24 states have return successors, (61), 61 states have call predecessors, (61), 61 states have call successors, (61) [2025-03-08 05:29:57,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 556 transitions. [2025-03-08 05:29:57,538 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 556 transitions. Word has length 149 [2025-03-08 05:29:57,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:29:57,539 INFO L471 AbstractCegarLoop]: Abstraction has 376 states and 556 transitions. [2025-03-08 05:29:57,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 39.0) internal successors, (78), 2 states have internal predecessors, (78), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 05:29:57,539 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 556 transitions. [2025-03-08 05:29:57,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-08 05:29:57,549 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:29:57,549 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 05:29:57,559 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 05:29:57,750 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:29:57,750 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:29:57,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:29:57,751 INFO L85 PathProgramCache]: Analyzing trace with hash -2004101814, now seen corresponding path program 1 times [2025-03-08 05:29:57,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:29:57,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271530102] [2025-03-08 05:29:57,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:57,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:29:57,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-08 05:29:57,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-08 05:29:57,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:57,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:58,004 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-03-08 05:29:58,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:29:58,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271530102] [2025-03-08 05:29:58,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271530102] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:29:58,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2124098259] [2025-03-08 05:29:58,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:58,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:29:58,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:29:58,007 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:29:58,008 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:29:58,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-08 05:29:58,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-08 05:29:58,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:58,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:58,306 INFO L256 TraceCheckSpWp]: Trace formula consists of 1219 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 05:29:58,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:29:58,344 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-08 05:29:58,344 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:29:58,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2124098259] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:29:58,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:29:58,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-08 05:29:58,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479058989] [2025-03-08 05:29:58,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:29:58,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:29:58,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:29:58,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:29:58,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:29:58,349 INFO L87 Difference]: Start difference. First operand 376 states and 556 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 05:29:58,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:29:58,384 INFO L93 Difference]: Finished difference Result 597 states and 863 transitions. [2025-03-08 05:29:58,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:29:58,385 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 149 [2025-03-08 05:29:58,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:29:58,388 INFO L225 Difference]: With dead ends: 597 [2025-03-08 05:29:58,388 INFO L226 Difference]: Without dead ends: 377 [2025-03-08 05:29:58,389 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 149 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:29:58,390 INFO L435 NwaCegarLoop]: 555 mSDtfsCounter, 0 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1108 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:29:58,390 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1108 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:29:58,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2025-03-08 05:29:58,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 377. [2025-03-08 05:29:58,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 290 states have (on average 1.4965517241379311) internal successors, (434), 293 states have internal predecessors, (434), 62 states have call successors, (62), 24 states have call predecessors, (62), 24 states have return successors, (61), 61 states have call predecessors, (61), 61 states have call successors, (61) [2025-03-08 05:29:58,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 557 transitions. [2025-03-08 05:29:58,412 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 557 transitions. Word has length 149 [2025-03-08 05:29:58,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:29:58,412 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 557 transitions. [2025-03-08 05:29:58,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 05:29:58,412 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 557 transitions. [2025-03-08 05:29:58,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-08 05:29:58,415 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:29:58,415 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1] [2025-03-08 05:29:58,423 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 05:29:58,619 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:29:58,619 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:29:58,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:29:58,619 INFO L85 PathProgramCache]: Analyzing trace with hash -772607077, now seen corresponding path program 1 times [2025-03-08 05:29:58,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:29:58,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394786013] [2025-03-08 05:29:58,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:58,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:29:58,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-08 05:29:58,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-08 05:29:58,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:58,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:58,854 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-08 05:29:58,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:29:58,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394786013] [2025-03-08 05:29:58,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394786013] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:29:58,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [141949065] [2025-03-08 05:29:58,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:58,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:29:58,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:29:58,857 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:29:58,859 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:29:59,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-08 05:29:59,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-08 05:29:59,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:59,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:59,138 INFO L256 TraceCheckSpWp]: Trace formula consists of 1243 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 05:29:59,144 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:29:59,160 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-08 05:29:59,160 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:29:59,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [141949065] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:29:59,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:29:59,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-08 05:29:59,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718370282] [2025-03-08 05:29:59,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:29:59,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:29:59,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:29:59,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:29:59,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:29:59,162 INFO L87 Difference]: Start difference. First operand 377 states and 557 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, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 05:29:59,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:29:59,190 INFO L93 Difference]: Finished difference Result 788 states and 1180 transitions. [2025-03-08 05:29:59,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:29:59,190 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, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 156 [2025-03-08 05:29:59,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:29:59,193 INFO L225 Difference]: With dead ends: 788 [2025-03-08 05:29:59,193 INFO L226 Difference]: Without dead ends: 437 [2025-03-08 05:29:59,195 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 156 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:29:59,195 INFO L435 NwaCegarLoop]: 571 mSDtfsCounter, 115 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 1081 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:29:59,195 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 1081 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:29:59,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2025-03-08 05:29:59,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 429. [2025-03-08 05:29:59,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 331 states have (on average 1.5166163141993958) internal successors, (502), 334 states have internal predecessors, (502), 73 states have call successors, (73), 24 states have call predecessors, (73), 24 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-08 05:29:59,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 647 transitions. [2025-03-08 05:29:59,212 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 647 transitions. Word has length 156 [2025-03-08 05:29:59,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:29:59,212 INFO L471 AbstractCegarLoop]: Abstraction has 429 states and 647 transitions. [2025-03-08 05:29:59,212 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, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 05:29:59,212 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 647 transitions. [2025-03-08 05:29:59,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-08 05:29:59,214 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:29:59,214 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1] [2025-03-08 05:29:59,222 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 05:29:59,415 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:29:59,415 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:29:59,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:29:59,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1444916341, now seen corresponding path program 1 times [2025-03-08 05:29:59,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:29:59,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861176658] [2025-03-08 05:29:59,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:59,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:29:59,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-08 05:29:59,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-08 05:29:59,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:59,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:59,564 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-08 05:29:59,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:29:59,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861176658] [2025-03-08 05:29:59,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861176658] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:29:59,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [379458710] [2025-03-08 05:29:59,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:59,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:29:59,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:29:59,567 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:29:59,570 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:29:59,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-08 05:29:59,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-08 05:29:59,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:59,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:59,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 1248 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 05:29:59,821 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:29:59,862 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-08 05:29:59,862 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:29:59,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [379458710] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:29:59,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:29:59,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-03-08 05:29:59,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189515606] [2025-03-08 05:29:59,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:29:59,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:29:59,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:29:59,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:29:59,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:29:59,864 INFO L87 Difference]: Start difference. First operand 429 states and 647 transitions. Second operand has 5 states, 4 states have (on average 23.75) internal successors, (95), 5 states have internal predecessors, (95), 3 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-08 05:29:59,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:29:59,918 INFO L93 Difference]: Finished difference Result 849 states and 1284 transitions. [2025-03-08 05:29:59,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:29:59,921 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 23.75) internal successors, (95), 5 states have internal predecessors, (95), 3 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) Word has length 157 [2025-03-08 05:29:59,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:29:59,923 INFO L225 Difference]: With dead ends: 849 [2025-03-08 05:29:59,923 INFO L226 Difference]: Without dead ends: 431 [2025-03-08 05:29:59,926 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 155 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:29:59,926 INFO L435 NwaCegarLoop]: 548 mSDtfsCounter, 2 mSDsluCounter, 1633 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2181 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:29:59,926 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2181 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:29:59,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2025-03-08 05:29:59,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 431. [2025-03-08 05:29:59,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 332 states have (on average 1.5150602409638554) internal successors, (503), 336 states have internal predecessors, (503), 73 states have call successors, (73), 24 states have call predecessors, (73), 25 states have return successors, (74), 72 states have call predecessors, (74), 72 states have call successors, (74) [2025-03-08 05:29:59,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 650 transitions. [2025-03-08 05:29:59,960 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 650 transitions. Word has length 157 [2025-03-08 05:29:59,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:29:59,961 INFO L471 AbstractCegarLoop]: Abstraction has 431 states and 650 transitions. [2025-03-08 05:29:59,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 23.75) internal successors, (95), 5 states have internal predecessors, (95), 3 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-08 05:29:59,961 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 650 transitions. [2025-03-08 05:29:59,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-08 05:29:59,964 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:29:59,965 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1] [2025-03-08 05:29:59,973 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:30:00,165 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:30:00,166 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:30:00,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:30:00,166 INFO L85 PathProgramCache]: Analyzing trace with hash 908561736, now seen corresponding path program 1 times [2025-03-08 05:30:00,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:30:00,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973445661] [2025-03-08 05:30:00,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:30:00,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:30:00,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-08 05:30:00,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-08 05:30:00,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:30:00,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:00,322 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-03-08 05:30:00,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:30:00,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973445661] [2025-03-08 05:30:00,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973445661] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:30:00,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1139474113] [2025-03-08 05:30:00,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:30:00,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:30:00,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:30:00,324 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:30:00,326 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:30:00,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-08 05:30:00,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-08 05:30:00,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:30:00,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:00,578 INFO L256 TraceCheckSpWp]: Trace formula consists of 1249 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 05:30:00,581 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:30:00,616 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-08 05:30:00,616 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:30:00,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1139474113] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:30:00,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:30:00,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-03-08 05:30:00,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435847907] [2025-03-08 05:30:00,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:30:00,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:30:00,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:30:00,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:30:00,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-08 05:30:00,618 INFO L87 Difference]: Start difference. First operand 431 states and 650 transitions. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 3 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-08 05:30:00,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:30:00,677 INFO L93 Difference]: Finished difference Result 851 states and 1289 transitions. [2025-03-08 05:30:00,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:30:00,678 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 3 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 158 [2025-03-08 05:30:00,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:30:00,680 INFO L225 Difference]: With dead ends: 851 [2025-03-08 05:30:00,680 INFO L226 Difference]: Without dead ends: 433 [2025-03-08 05:30:00,682 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 156 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:30:00,682 INFO L435 NwaCegarLoop]: 546 mSDtfsCounter, 2 mSDsluCounter, 1621 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2167 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:30:00,682 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2167 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:30:00,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2025-03-08 05:30:00,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 433. [2025-03-08 05:30:00,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 433 states, 333 states have (on average 1.5135135135135136) internal successors, (504), 338 states have internal predecessors, (504), 73 states have call successors, (73), 24 states have call predecessors, (73), 26 states have return successors, (79), 72 states have call predecessors, (79), 72 states have call successors, (79) [2025-03-08 05:30:00,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 656 transitions. [2025-03-08 05:30:00,703 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 656 transitions. Word has length 158 [2025-03-08 05:30:00,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:30:00,703 INFO L471 AbstractCegarLoop]: Abstraction has 433 states and 656 transitions. [2025-03-08 05:30:00,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 3 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-08 05:30:00,704 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 656 transitions. [2025-03-08 05:30:00,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-03-08 05:30:00,706 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:30:00,706 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:30:00,714 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:30:00,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:30:00,907 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:30:00,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:30:00,907 INFO L85 PathProgramCache]: Analyzing trace with hash 873679954, now seen corresponding path program 1 times [2025-03-08 05:30:00,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:30:00,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944995224] [2025-03-08 05:30:00,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:30:00,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:30:00,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-08 05:30:00,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-08 05:30:00,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:30:00,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:01,077 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-08 05:30:01,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:30:01,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944995224] [2025-03-08 05:30:01,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944995224] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:30:01,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:30:01,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:30:01,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776245725] [2025-03-08 05:30:01,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:30:01,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:30:01,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:30:01,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:30:01,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:30:01,080 INFO L87 Difference]: Start difference. First operand 433 states and 656 transitions. Second operand has 5 states, 4 states have (on average 23.25) internal successors, (93), 5 states have internal predecessors, (93), 3 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-08 05:30:01,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:30:01,117 INFO L93 Difference]: Finished difference Result 843 states and 1280 transitions. [2025-03-08 05:30:01,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:30:01,118 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 23.25) internal successors, (93), 5 states have internal predecessors, (93), 3 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) Word has length 159 [2025-03-08 05:30:01,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:30:01,121 INFO L225 Difference]: With dead ends: 843 [2025-03-08 05:30:01,121 INFO L226 Difference]: Without dead ends: 433 [2025-03-08 05:30:01,122 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:30:01,123 INFO L435 NwaCegarLoop]: 549 mSDtfsCounter, 2 mSDsluCounter, 1636 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2185 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:30:01,123 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2185 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:30:01,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2025-03-08 05:30:01,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 433. [2025-03-08 05:30:01,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 433 states, 333 states have (on average 1.5135135135135136) internal successors, (504), 338 states have internal predecessors, (504), 73 states have call successors, (73), 24 states have call predecessors, (73), 26 states have return successors, (78), 72 states have call predecessors, (78), 72 states have call successors, (78) [2025-03-08 05:30:01,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 655 transitions. [2025-03-08 05:30:01,144 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 655 transitions. Word has length 159 [2025-03-08 05:30:01,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:30:01,145 INFO L471 AbstractCegarLoop]: Abstraction has 433 states and 655 transitions. [2025-03-08 05:30:01,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 23.25) internal successors, (93), 5 states have internal predecessors, (93), 3 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-08 05:30:01,145 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 655 transitions. [2025-03-08 05:30:01,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-08 05:30:01,147 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:30:01,147 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1] [2025-03-08 05:30:01,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 05:30:01,147 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:30:01,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:30:01,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1154233457, now seen corresponding path program 2 times [2025-03-08 05:30:01,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:30:01,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993265732] [2025-03-08 05:30:01,148 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:30:01,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:30:01,169 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 160 statements into 2 equivalence classes. [2025-03-08 05:30:01,174 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 58 of 160 statements. [2025-03-08 05:30:01,174 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 05:30:01,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:01,312 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-03-08 05:30:01,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:30:01,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993265732] [2025-03-08 05:30:01,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993265732] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:30:01,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:30:01,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 05:30:01,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777836664] [2025-03-08 05:30:01,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:30:01,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 05:30:01,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:30:01,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 05:30:01,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:30:01,313 INFO L87 Difference]: Start difference. First operand 433 states and 655 transitions. Second operand has 8 states, 8 states have (on average 11.875) internal successors, (95), 7 states have internal predecessors, (95), 3 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (18), 4 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-08 05:30:01,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:30:01,761 INFO L93 Difference]: Finished difference Result 1237 states and 1852 transitions. [2025-03-08 05:30:01,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 05:30:01,761 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 7 states have internal predecessors, (95), 3 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (18), 4 states have call predecessors, (18), 3 states have call successors, (18) Word has length 160 [2025-03-08 05:30:01,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:30:01,770 INFO L225 Difference]: With dead ends: 1237 [2025-03-08 05:30:01,770 INFO L226 Difference]: Without dead ends: 1023 [2025-03-08 05:30:01,771 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-03-08 05:30:01,772 INFO L435 NwaCegarLoop]: 611 mSDtfsCounter, 1162 mSDsluCounter, 2851 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1188 SdHoareTripleChecker+Valid, 3462 SdHoareTripleChecker+Invalid, 515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 05:30:01,773 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1188 Valid, 3462 Invalid, 515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 05:30:01,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1023 states. [2025-03-08 05:30:01,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1023 to 861. [2025-03-08 05:30:01,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 861 states, 664 states have (on average 1.5180722891566265) internal successors, (1008), 671 states have internal predecessors, (1008), 144 states have call successors, (144), 49 states have call predecessors, (144), 52 states have return successors, (158), 144 states have call predecessors, (158), 142 states have call successors, (158) [2025-03-08 05:30:01,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 861 states and 1310 transitions. [2025-03-08 05:30:01,818 INFO L78 Accepts]: Start accepts. Automaton has 861 states and 1310 transitions. Word has length 160 [2025-03-08 05:30:01,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:30:01,818 INFO L471 AbstractCegarLoop]: Abstraction has 861 states and 1310 transitions. [2025-03-08 05:30:01,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 7 states have internal predecessors, (95), 3 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (18), 4 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-08 05:30:01,818 INFO L276 IsEmpty]: Start isEmpty. Operand 861 states and 1310 transitions. [2025-03-08 05:30:01,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-08 05:30:01,822 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:30:01,822 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:30:01,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 05:30:01,822 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:30:01,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:30:01,823 INFO L85 PathProgramCache]: Analyzing trace with hash -1253357990, now seen corresponding path program 1 times [2025-03-08 05:30:01,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:30:01,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846485739] [2025-03-08 05:30:01,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:30:01,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:30:01,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-08 05:30:01,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-08 05:30:01,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:30:01,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:01,942 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-08 05:30:01,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:30:01,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846485739] [2025-03-08 05:30:01,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846485739] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:30:01,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:30:01,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:30:01,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125610467] [2025-03-08 05:30:01,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:30:01,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:30:01,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:30:01,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:30:01,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:30:01,944 INFO L87 Difference]: Start difference. First operand 861 states and 1310 transitions. Second operand has 5 states, 4 states have (on average 24.0) internal successors, (96), 5 states have internal predecessors, (96), 3 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-08 05:30:01,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:30:01,995 INFO L93 Difference]: Finished difference Result 1691 states and 2580 transitions. [2025-03-08 05:30:01,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:30:01,995 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 24.0) internal successors, (96), 5 states have internal predecessors, (96), 3 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) Word has length 161 [2025-03-08 05:30:01,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:30:02,001 INFO L225 Difference]: With dead ends: 1691 [2025-03-08 05:30:02,001 INFO L226 Difference]: Without dead ends: 865 [2025-03-08 05:30:02,003 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:30:02,003 INFO L435 NwaCegarLoop]: 550 mSDtfsCounter, 1 mSDsluCounter, 1638 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2188 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:30:02,004 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2188 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:30:02,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2025-03-08 05:30:02,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 865. [2025-03-08 05:30:02,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 865 states, 666 states have (on average 1.5165165165165164) internal successors, (1010), 675 states have internal predecessors, (1010), 144 states have call successors, (144), 49 states have call predecessors, (144), 54 states have return successors, (161), 144 states have call predecessors, (161), 142 states have call successors, (161) [2025-03-08 05:30:02,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 865 states and 1315 transitions. [2025-03-08 05:30:02,038 INFO L78 Accepts]: Start accepts. Automaton has 865 states and 1315 transitions. Word has length 161 [2025-03-08 05:30:02,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:30:02,039 INFO L471 AbstractCegarLoop]: Abstraction has 865 states and 1315 transitions. [2025-03-08 05:30:02,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 24.0) internal successors, (96), 5 states have internal predecessors, (96), 3 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-08 05:30:02,039 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 1315 transitions. [2025-03-08 05:30:02,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-08 05:30:02,041 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:30:02,041 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:30:02,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 05:30:02,042 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:30:02,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:30:02,042 INFO L85 PathProgramCache]: Analyzing trace with hash -2004704810, now seen corresponding path program 1 times [2025-03-08 05:30:02,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:30:02,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752042078] [2025-03-08 05:30:02,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:30:02,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:30:02,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-08 05:30:02,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-08 05:30:02,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:30:02,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:02,205 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-03-08 05:30:02,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:30:02,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752042078] [2025-03-08 05:30:02,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752042078] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:30:02,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:30:02,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 05:30:02,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715484734] [2025-03-08 05:30:02,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:30:02,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 05:30:02,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:30:02,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 05:30:02,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:30:02,206 INFO L87 Difference]: Start difference. First operand 865 states and 1315 transitions. Second operand has 8 states, 7 states have (on average 14.285714285714286) internal successors, (100), 8 states have internal predecessors, (100), 4 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-08 05:30:02,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:30:02,334 INFO L93 Difference]: Finished difference Result 1690 states and 2573 transitions. [2025-03-08 05:30:02,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 05:30:02,334 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 14.285714285714286) internal successors, (100), 8 states have internal predecessors, (100), 4 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) Word has length 162 [2025-03-08 05:30:02,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:30:02,339 INFO L225 Difference]: With dead ends: 1690 [2025-03-08 05:30:02,339 INFO L226 Difference]: Without dead ends: 869 [2025-03-08 05:30:02,342 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-08 05:30:02,343 INFO L435 NwaCegarLoop]: 540 mSDtfsCounter, 7 mSDsluCounter, 3211 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 3751 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:30:02,343 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 3751 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:30:02,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 869 states. [2025-03-08 05:30:02,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 869 to 867. [2025-03-08 05:30:02,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 867 states, 668 states have (on average 1.5149700598802396) internal successors, (1012), 676 states have internal predecessors, (1012), 144 states have call successors, (144), 50 states have call predecessors, (144), 54 states have return successors, (159), 144 states have call predecessors, (159), 142 states have call successors, (159) [2025-03-08 05:30:02,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 867 states to 867 states and 1315 transitions. [2025-03-08 05:30:02,381 INFO L78 Accepts]: Start accepts. Automaton has 867 states and 1315 transitions. Word has length 162 [2025-03-08 05:30:02,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:30:02,381 INFO L471 AbstractCegarLoop]: Abstraction has 867 states and 1315 transitions. [2025-03-08 05:30:02,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 14.285714285714286) internal successors, (100), 8 states have internal predecessors, (100), 4 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-08 05:30:02,381 INFO L276 IsEmpty]: Start isEmpty. Operand 867 states and 1315 transitions. [2025-03-08 05:30:02,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-08 05:30:02,385 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:30:02,385 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:30:02,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 05:30:02,385 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:30:02,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:30:02,386 INFO L85 PathProgramCache]: Analyzing trace with hash -1971706574, now seen corresponding path program 2 times [2025-03-08 05:30:02,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:30:02,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332842013] [2025-03-08 05:30:02,386 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:30:02,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:30:02,404 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 163 statements into 2 equivalence classes. [2025-03-08 05:30:02,409 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 61 of 163 statements. [2025-03-08 05:30:02,409 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 05:30:02,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:02,509 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-03-08 05:30:02,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:30:02,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332842013] [2025-03-08 05:30:02,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332842013] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:30:02,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:30:02,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 05:30:02,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50035112] [2025-03-08 05:30:02,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:30:02,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 05:30:02,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:30:02,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 05:30:02,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:30:02,510 INFO L87 Difference]: Start difference. First operand 867 states and 1315 transitions. Second operand has 8 states, 8 states have (on average 12.375) internal successors, (99), 7 states have internal predecessors, (99), 3 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (18), 4 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-08 05:30:02,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:30:02,939 INFO L93 Difference]: Finished difference Result 2483 states and 3732 transitions. [2025-03-08 05:30:02,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 05:30:02,940 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.375) internal successors, (99), 7 states have internal predecessors, (99), 3 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (18), 4 states have call predecessors, (18), 3 states have call successors, (18) Word has length 163 [2025-03-08 05:30:02,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:30:02,950 INFO L225 Difference]: With dead ends: 2483 [2025-03-08 05:30:02,950 INFO L226 Difference]: Without dead ends: 2053 [2025-03-08 05:30:02,953 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-03-08 05:30:02,953 INFO L435 NwaCegarLoop]: 623 mSDtfsCounter, 710 mSDsluCounter, 3543 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 735 SdHoareTripleChecker+Valid, 4166 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 05:30:02,954 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [735 Valid, 4166 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 05:30:02,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2053 states. [2025-03-08 05:30:03,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2053 to 1731. [2025-03-08 05:30:03,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1731 states, 1334 states have (on average 1.5164917541229386) internal successors, (2023), 1352 states have internal predecessors, (2023), 284 states have call successors, (284), 100 states have call predecessors, (284), 112 states have return successors, (340), 286 states have call predecessors, (340), 280 states have call successors, (340) [2025-03-08 05:30:03,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1731 states to 1731 states and 2647 transitions. [2025-03-08 05:30:03,035 INFO L78 Accepts]: Start accepts. Automaton has 1731 states and 2647 transitions. Word has length 163 [2025-03-08 05:30:03,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:30:03,036 INFO L471 AbstractCegarLoop]: Abstraction has 1731 states and 2647 transitions. [2025-03-08 05:30:03,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.375) internal successors, (99), 7 states have internal predecessors, (99), 3 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (18), 4 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-08 05:30:03,036 INFO L276 IsEmpty]: Start isEmpty. Operand 1731 states and 2647 transitions. [2025-03-08 05:30:03,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-08 05:30:03,042 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:30:03,042 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:30:03,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 05:30:03,042 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:30:03,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:30:03,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1172050431, now seen corresponding path program 1 times [2025-03-08 05:30:03,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:30:03,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435585250] [2025-03-08 05:30:03,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:30:03,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:30:03,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-08 05:30:03,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-08 05:30:03,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:30:03,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:03,146 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2025-03-08 05:30:03,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:30:03,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435585250] [2025-03-08 05:30:03,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435585250] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:30:03,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2113011274] [2025-03-08 05:30:03,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:30:03,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:30:03,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:30:03,149 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:30:03,150 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:30:03,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-08 05:30:03,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-08 05:30:03,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:30:03,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:03,405 INFO L256 TraceCheckSpWp]: Trace formula consists of 1254 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 05:30:03,408 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:30:03,440 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-08 05:30:03,441 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:30:03,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2113011274] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:30:03,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:30:03,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-03-08 05:30:03,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182423597] [2025-03-08 05:30:03,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:30:03,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:30:03,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:30:03,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:30:03,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:30:03,442 INFO L87 Difference]: Start difference. First operand 1731 states and 2647 transitions. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 2 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 05:30:03,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:30:03,513 INFO L93 Difference]: Finished difference Result 2609 states and 3982 transitions. [2025-03-08 05:30:03,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:30:03,514 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 2 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 163 [2025-03-08 05:30:03,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:30:03,522 INFO L225 Difference]: With dead ends: 2609 [2025-03-08 05:30:03,522 INFO L226 Difference]: Without dead ends: 1735 [2025-03-08 05:30:03,525 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 161 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:30:03,526 INFO L435 NwaCegarLoop]: 549 mSDtfsCounter, 1 mSDsluCounter, 1629 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2178 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:30:03,526 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2178 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:30:03,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1735 states. [2025-03-08 05:30:03,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1735 to 1727. [2025-03-08 05:30:03,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1727 states, 1332 states have (on average 1.5165165165165164) internal successors, (2020), 1350 states have internal predecessors, (2020), 282 states have call successors, (282), 100 states have call predecessors, (282), 112 states have return successors, (338), 284 states have call predecessors, (338), 278 states have call successors, (338) [2025-03-08 05:30:03,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1727 states to 1727 states and 2640 transitions. [2025-03-08 05:30:03,634 INFO L78 Accepts]: Start accepts. Automaton has 1727 states and 2640 transitions. Word has length 163 [2025-03-08 05:30:03,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:30:03,634 INFO L471 AbstractCegarLoop]: Abstraction has 1727 states and 2640 transitions. [2025-03-08 05:30:03,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 2 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 05:30:03,634 INFO L276 IsEmpty]: Start isEmpty. Operand 1727 states and 2640 transitions. [2025-03-08 05:30:03,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-08 05:30:03,640 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:30:03,640 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:30:03,648 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-08 05:30:03,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:30:03,841 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:30:03,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:30:03,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1100069756, now seen corresponding path program 1 times [2025-03-08 05:30:03,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:30:03,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553477595] [2025-03-08 05:30:03,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:30:03,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:30:03,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-08 05:30:03,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-08 05:30:03,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:30:03,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:03,968 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-03-08 05:30:03,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:30:03,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553477595] [2025-03-08 05:30:03,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553477595] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:30:03,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:30:03,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 05:30:03,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221259523] [2025-03-08 05:30:03,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:30:03,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 05:30:03,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:30:03,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 05:30:03,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:30:03,969 INFO L87 Difference]: Start difference. First operand 1727 states and 2640 transitions. Second operand has 8 states, 7 states have (on average 14.571428571428571) internal successors, (102), 8 states have internal predecessors, (102), 4 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-08 05:30:04,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:30:04,101 INFO L93 Difference]: Finished difference Result 3395 states and 5196 transitions. [2025-03-08 05:30:04,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 05:30:04,102 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 14.571428571428571) internal successors, (102), 8 states have internal predecessors, (102), 4 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) Word has length 164 [2025-03-08 05:30:04,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:30:04,111 INFO L225 Difference]: With dead ends: 3395 [2025-03-08 05:30:04,111 INFO L226 Difference]: Without dead ends: 1735 [2025-03-08 05:30:04,116 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-08 05:30:04,116 INFO L435 NwaCegarLoop]: 542 mSDtfsCounter, 5 mSDsluCounter, 3223 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 3765 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:30:04,117 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 3765 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:30:04,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1735 states. [2025-03-08 05:30:04,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1735 to 1731. [2025-03-08 05:30:04,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1731 states, 1336 states have (on average 1.5149700598802396) internal successors, (2024), 1353 states have internal predecessors, (2024), 282 states have call successors, (282), 101 states have call predecessors, (282), 112 states have return successors, (334), 284 states have call predecessors, (334), 278 states have call successors, (334) [2025-03-08 05:30:04,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1731 states to 1731 states and 2640 transitions. [2025-03-08 05:30:04,176 INFO L78 Accepts]: Start accepts. Automaton has 1731 states and 2640 transitions. Word has length 164 [2025-03-08 05:30:04,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:30:04,177 INFO L471 AbstractCegarLoop]: Abstraction has 1731 states and 2640 transitions. [2025-03-08 05:30:04,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 14.571428571428571) internal successors, (102), 8 states have internal predecessors, (102), 4 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-08 05:30:04,177 INFO L276 IsEmpty]: Start isEmpty. Operand 1731 states and 2640 transitions. [2025-03-08 05:30:04,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-08 05:30:04,183 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:30:04,183 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:30:04,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 05:30:04,183 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:30:04,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:30:04,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1401415013, now seen corresponding path program 1 times [2025-03-08 05:30:04,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:30:04,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057207946] [2025-03-08 05:30:04,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:30:04,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:30:04,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 05:30:04,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 05:30:04,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:30:04,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:04,334 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-08 05:30:04,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:30:04,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057207946] [2025-03-08 05:30:04,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057207946] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:30:04,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1102596014] [2025-03-08 05:30:04,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:30:04,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:30:04,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:30:04,337 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:30:04,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-08 05:30:04,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 05:30:04,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 05:30:04,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:30:04,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:04,600 INFO L256 TraceCheckSpWp]: Trace formula consists of 1256 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 05:30:04,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:30:04,631 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-03-08 05:30:04,632 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:30:04,730 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-03-08 05:30:04,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1102596014] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:30:04,730 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:30:04,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 11 [2025-03-08 05:30:04,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550219695] [2025-03-08 05:30:04,730 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:30:04,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 05:30:04,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:30:04,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 05:30:04,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-08 05:30:04,731 INFO L87 Difference]: Start difference. First operand 1731 states and 2640 transitions. Second operand has 11 states, 10 states have (on average 15.2) internal successors, (152), 11 states have internal predecessors, (152), 4 states have call successors, (36), 2 states have call predecessors, (36), 3 states have return successors, (34), 3 states have call predecessors, (34), 4 states have call successors, (34) [2025-03-08 05:30:05,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:30:05,321 INFO L93 Difference]: Finished difference Result 4849 states and 7772 transitions. [2025-03-08 05:30:05,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 05:30:05,322 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 15.2) internal successors, (152), 11 states have internal predecessors, (152), 4 states have call successors, (36), 2 states have call predecessors, (36), 3 states have return successors, (34), 3 states have call predecessors, (34), 4 states have call successors, (34) Word has length 165 [2025-03-08 05:30:05,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:30:05,339 INFO L225 Difference]: With dead ends: 4849 [2025-03-08 05:30:05,339 INFO L226 Difference]: Without dead ends: 3197 [2025-03-08 05:30:05,346 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 327 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:30:05,347 INFO L435 NwaCegarLoop]: 542 mSDtfsCounter, 1182 mSDsluCounter, 4170 mSDsCounter, 0 mSdLazyCounter, 565 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1182 SdHoareTripleChecker+Valid, 4712 SdHoareTripleChecker+Invalid, 656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 05:30:05,347 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1182 Valid, 4712 Invalid, 656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 565 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 05:30:05,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3197 states. [2025-03-08 05:30:05,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3197 to 3101. [2025-03-08 05:30:05,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3101 states, 2450 states have (on average 1.5779591836734694) internal successors, (3866), 2466 states have internal predecessors, (3866), 538 states have call successors, (538), 102 states have call predecessors, (538), 112 states have return successors, (670), 540 states have call predecessors, (670), 534 states have call successors, (670) [2025-03-08 05:30:05,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3101 states to 3101 states and 5074 transitions. [2025-03-08 05:30:05,499 INFO L78 Accepts]: Start accepts. Automaton has 3101 states and 5074 transitions. Word has length 165 [2025-03-08 05:30:05,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:30:05,500 INFO L471 AbstractCegarLoop]: Abstraction has 3101 states and 5074 transitions. [2025-03-08 05:30:05,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 15.2) internal successors, (152), 11 states have internal predecessors, (152), 4 states have call successors, (36), 2 states have call predecessors, (36), 3 states have return successors, (34), 3 states have call predecessors, (34), 4 states have call successors, (34) [2025-03-08 05:30:05,500 INFO L276 IsEmpty]: Start isEmpty. Operand 3101 states and 5074 transitions. [2025-03-08 05:30:05,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-08 05:30:05,516 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:30:05,516 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:30:05,525 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-08 05:30:05,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:30:05,717 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:30:05,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:30:05,718 INFO L85 PathProgramCache]: Analyzing trace with hash -327078017, now seen corresponding path program 1 times [2025-03-08 05:30:05,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:30:05,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534940386] [2025-03-08 05:30:05,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:30:05,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:30:05,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-08 05:30:05,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-08 05:30:05,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:30:05,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:05,790 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-03-08 05:30:05,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:30:05,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534940386] [2025-03-08 05:30:05,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534940386] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:30:05,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:30:05,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:30:05,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799121391] [2025-03-08 05:30:05,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:30:05,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:30:05,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:30:05,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:30:05,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:30:05,792 INFO L87 Difference]: Start difference. First operand 3101 states and 5074 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 05:30:05,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:30:05,881 INFO L93 Difference]: Finished difference Result 7227 states and 12050 transitions. [2025-03-08 05:30:05,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:30:05,881 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 169 [2025-03-08 05:30:05,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:30:05,903 INFO L225 Difference]: With dead ends: 7227 [2025-03-08 05:30:05,903 INFO L226 Difference]: Without dead ends: 4385 [2025-03-08 05:30:05,915 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:30:05,916 INFO L435 NwaCegarLoop]: 573 mSDtfsCounter, 112 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 1119 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:30:05,916 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 1119 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:30:05,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4385 states. [2025-03-08 05:30:06,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4385 to 4353. [2025-03-08 05:30:06,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4353 states, 3446 states have (on average 1.6012768427161927) internal successors, (5518), 3462 states have internal predecessors, (5518), 794 states have call successors, (794), 102 states have call predecessors, (794), 112 states have return successors, (1006), 796 states have call predecessors, (1006), 790 states have call successors, (1006) [2025-03-08 05:30:06,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4353 states to 4353 states and 7318 transitions. [2025-03-08 05:30:06,120 INFO L78 Accepts]: Start accepts. Automaton has 4353 states and 7318 transitions. Word has length 169 [2025-03-08 05:30:06,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:30:06,120 INFO L471 AbstractCegarLoop]: Abstraction has 4353 states and 7318 transitions. [2025-03-08 05:30:06,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 05:30:06,124 INFO L276 IsEmpty]: Start isEmpty. Operand 4353 states and 7318 transitions. [2025-03-08 05:30:06,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-08 05:30:06,146 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:30:06,147 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:30:06,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 05:30:06,147 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:30:06,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:30:06,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1729512180, now seen corresponding path program 1 times [2025-03-08 05:30:06,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:30:06,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289932719] [2025-03-08 05:30:06,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:30:06,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:30:06,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-08 05:30:06,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-08 05:30:06,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:30:06,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:06,202 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-03-08 05:30:06,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:30:06,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289932719] [2025-03-08 05:30:06,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289932719] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:30:06,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:30:06,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:30:06,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217747258] [2025-03-08 05:30:06,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:30:06,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:30:06,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:30:06,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:30:06,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:30:06,203 INFO L87 Difference]: Start difference. First operand 4353 states and 7318 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 05:30:06,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:30:06,319 INFO L93 Difference]: Finished difference Result 10335 states and 17514 transitions. [2025-03-08 05:30:06,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:30:06,320 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 170 [2025-03-08 05:30:06,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:30:06,364 INFO L225 Difference]: With dead ends: 10335 [2025-03-08 05:30:06,364 INFO L226 Difference]: Without dead ends: 6437 [2025-03-08 05:30:06,378 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:30:06,379 INFO L435 NwaCegarLoop]: 561 mSDtfsCounter, 110 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 1110 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:30:06,379 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 1110 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:30:06,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6437 states. [2025-03-08 05:30:06,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6437 to 6405. [2025-03-08 05:30:06,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6405 states, 5118 states have (on average 1.6143024618991795) internal successors, (8262), 5134 states have internal predecessors, (8262), 1174 states have call successors, (1174), 102 states have call predecessors, (1174), 112 states have return successors, (1450), 1176 states have call predecessors, (1450), 1170 states have call successors, (1450) [2025-03-08 05:30:06,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6405 states to 6405 states and 10886 transitions. [2025-03-08 05:30:06,646 INFO L78 Accepts]: Start accepts. Automaton has 6405 states and 10886 transitions. Word has length 170 [2025-03-08 05:30:06,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:30:06,647 INFO L471 AbstractCegarLoop]: Abstraction has 6405 states and 10886 transitions. [2025-03-08 05:30:06,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 05:30:06,648 INFO L276 IsEmpty]: Start isEmpty. Operand 6405 states and 10886 transitions. [2025-03-08 05:30:06,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-03-08 05:30:06,675 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:30:06,675 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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:30:06,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 05:30:06,675 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:30:06,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:30:06,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1970861888, now seen corresponding path program 1 times [2025-03-08 05:30:06,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:30:06,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395041558] [2025-03-08 05:30:06,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:30:06,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:30:06,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-08 05:30:06,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-08 05:30:06,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:30:06,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:06,732 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-03-08 05:30:06,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:30:06,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395041558] [2025-03-08 05:30:06,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395041558] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:30:06,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:30:06,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:30:06,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150353763] [2025-03-08 05:30:06,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:30:06,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:30:06,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:30:06,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:30:06,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:30:06,734 INFO L87 Difference]: Start difference. First operand 6405 states and 10886 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 05:30:06,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:30:06,929 INFO L93 Difference]: Finished difference Result 14979 states and 25706 transitions. [2025-03-08 05:30:06,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:30:06,929 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 171 [2025-03-08 05:30:06,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:30:06,970 INFO L225 Difference]: With dead ends: 14979 [2025-03-08 05:30:06,971 INFO L226 Difference]: Without dead ends: 9541 [2025-03-08 05:30:06,990 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:30:06,991 INFO L435 NwaCegarLoop]: 554 mSDtfsCounter, 108 mSDsluCounter, 545 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 1099 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:30:06,991 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 1099 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:30:07,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9541 states. [2025-03-08 05:30:07,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9541 to 9509. [2025-03-08 05:30:07,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9509 states, 7730 states have (on average 1.6245795601552393) internal successors, (12558), 7746 states have internal predecessors, (12558), 1666 states have call successors, (1666), 102 states have call predecessors, (1666), 112 states have return successors, (2110), 1668 states have call predecessors, (2110), 1662 states have call successors, (2110) [2025-03-08 05:30:07,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9509 states to 9509 states and 16334 transitions. [2025-03-08 05:30:07,467 INFO L78 Accepts]: Start accepts. Automaton has 9509 states and 16334 transitions. Word has length 171 [2025-03-08 05:30:07,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:30:07,468 INFO L471 AbstractCegarLoop]: Abstraction has 9509 states and 16334 transitions. [2025-03-08 05:30:07,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 05:30:07,468 INFO L276 IsEmpty]: Start isEmpty. Operand 9509 states and 16334 transitions. [2025-03-08 05:30:07,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-08 05:30:07,514 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:30:07,515 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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:30:07,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 05:30:07,515 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:30:07,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:30:07,516 INFO L85 PathProgramCache]: Analyzing trace with hash 294835603, now seen corresponding path program 1 times [2025-03-08 05:30:07,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:30:07,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46458088] [2025-03-08 05:30:07,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:30:07,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:30:07,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-08 05:30:07,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-08 05:30:07,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:30:07,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:07,587 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-03-08 05:30:07,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:30:07,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46458088] [2025-03-08 05:30:07,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46458088] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:30:07,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:30:07,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:30:07,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324068879] [2025-03-08 05:30:07,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:30:07,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:30:07,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:30:07,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:30:07,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:30:07,591 INFO L87 Difference]: Start difference. First operand 9509 states and 16334 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 05:30:08,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:30:08,045 INFO L93 Difference]: Finished difference Result 22207 states and 38490 transitions. [2025-03-08 05:30:08,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:30:08,046 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 172 [2025-03-08 05:30:08,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:30:08,098 INFO L225 Difference]: With dead ends: 22207 [2025-03-08 05:30:08,098 INFO L226 Difference]: Without dead ends: 14497 [2025-03-08 05:30:08,117 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:30:08,118 INFO L435 NwaCegarLoop]: 554 mSDtfsCounter, 106 mSDsluCounter, 545 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 1099 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:30:08,118 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 1099 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:30:08,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14497 states. [2025-03-08 05:30:08,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14497 to 14465. [2025-03-08 05:30:08,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14465 states, 11970 states have (on average 1.631578947368421) internal successors, (19530), 11986 states have internal predecessors, (19530), 2382 states have call successors, (2382), 102 states have call predecessors, (2382), 112 states have return successors, (3106), 2384 states have call predecessors, (3106), 2378 states have call successors, (3106) [2025-03-08 05:30:08,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14465 states to 14465 states and 25018 transitions. [2025-03-08 05:30:08,654 INFO L78 Accepts]: Start accepts. Automaton has 14465 states and 25018 transitions. Word has length 172 [2025-03-08 05:30:08,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:30:08,655 INFO L471 AbstractCegarLoop]: Abstraction has 14465 states and 25018 transitions. [2025-03-08 05:30:08,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 05:30:08,655 INFO L276 IsEmpty]: Start isEmpty. Operand 14465 states and 25018 transitions. [2025-03-08 05:30:08,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-03-08 05:30:08,753 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:30:08,753 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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:30:08,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 05:30:08,754 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:30:08,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:30:08,754 INFO L85 PathProgramCache]: Analyzing trace with hash 645601761, now seen corresponding path program 1 times [2025-03-08 05:30:08,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:30:08,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459624295] [2025-03-08 05:30:08,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:30:08,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:30:08,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-08 05:30:08,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-08 05:30:08,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:30:08,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:08,813 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-03-08 05:30:08,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:30:08,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459624295] [2025-03-08 05:30:08,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459624295] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:30:08,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:30:08,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:30:08,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471235781] [2025-03-08 05:30:08,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:30:08,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:30:08,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:30:08,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:30:08,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:30:08,814 INFO L87 Difference]: Start difference. First operand 14465 states and 25018 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 05:30:09,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:30:09,237 INFO L93 Difference]: Finished difference Result 34087 states and 59502 transitions. [2025-03-08 05:30:09,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:30:09,238 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 173 [2025-03-08 05:30:09,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:30:09,321 INFO L225 Difference]: With dead ends: 34087 [2025-03-08 05:30:09,322 INFO L226 Difference]: Without dead ends: 22685 [2025-03-08 05:30:09,346 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:30:09,347 INFO L435 NwaCegarLoop]: 562 mSDtfsCounter, 104 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 1105 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:30:09,347 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 1105 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:30:09,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22685 states. [2025-03-08 05:30:10,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22685 to 22653. [2025-03-08 05:30:10,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22653 states, 18654 states have (on average 1.6284979092955933) internal successors, (30378), 18670 states have internal predecessors, (30378), 3886 states have call successors, (3886), 102 states have call predecessors, (3886), 112 states have return successors, (5098), 3888 states have call predecessors, (5098), 3882 states have call successors, (5098) [2025-03-08 05:30:10,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22653 states to 22653 states and 39362 transitions. [2025-03-08 05:30:10,235 INFO L78 Accepts]: Start accepts. Automaton has 22653 states and 39362 transitions. Word has length 173 [2025-03-08 05:30:10,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:30:10,235 INFO L471 AbstractCegarLoop]: Abstraction has 22653 states and 39362 transitions. [2025-03-08 05:30:10,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 05:30:10,235 INFO L276 IsEmpty]: Start isEmpty. Operand 22653 states and 39362 transitions. [2025-03-08 05:30:10,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-03-08 05:30:10,319 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:30:10,319 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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:30:10,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 05:30:10,319 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:30:10,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:30:10,320 INFO L85 PathProgramCache]: Analyzing trace with hash -1227173326, now seen corresponding path program 1 times [2025-03-08 05:30:10,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:30:10,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27323218] [2025-03-08 05:30:10,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:30:10,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:30:10,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-08 05:30:10,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-08 05:30:10,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:30:10,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:10,386 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-03-08 05:30:10,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:30:10,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27323218] [2025-03-08 05:30:10,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27323218] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:30:10,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:30:10,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:30:10,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063654634] [2025-03-08 05:30:10,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:30:10,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:30:10,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:30:10,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:30:10,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:30:10,389 INFO L87 Difference]: Start difference. First operand 22653 states and 39362 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 05:30:11,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:30:11,326 INFO L93 Difference]: Finished difference Result 55603 states and 97070 transitions. [2025-03-08 05:30:11,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:30:11,326 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 174 [2025-03-08 05:30:11,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:30:11,477 INFO L225 Difference]: With dead ends: 55603 [2025-03-08 05:30:11,477 INFO L226 Difference]: Without dead ends: 37533 [2025-03-08 05:30:11,524 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:30:11,525 INFO L435 NwaCegarLoop]: 554 mSDtfsCounter, 102 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 1102 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:30:11,525 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 1102 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:30:11,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37533 states. [2025-03-08 05:30:12,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37533 to 37501. [2025-03-08 05:30:12,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37501 states, 31078 states have (on average 1.627839629319776) internal successors, (50590), 31094 states have internal predecessors, (50590), 6310 states have call successors, (6310), 102 states have call predecessors, (6310), 112 states have return successors, (8122), 6312 states have call predecessors, (8122), 6306 states have call successors, (8122) [2025-03-08 05:30:12,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37501 states to 37501 states and 65022 transitions. [2025-03-08 05:30:12,860 INFO L78 Accepts]: Start accepts. Automaton has 37501 states and 65022 transitions. Word has length 174 [2025-03-08 05:30:12,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:30:12,861 INFO L471 AbstractCegarLoop]: Abstraction has 37501 states and 65022 transitions. [2025-03-08 05:30:12,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 05:30:12,861 INFO L276 IsEmpty]: Start isEmpty. Operand 37501 states and 65022 transitions. [2025-03-08 05:30:12,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-08 05:30:12,998 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:30:12,998 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 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:30:12,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 05:30:12,999 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:30:12,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:30:12,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1212249698, now seen corresponding path program 1 times [2025-03-08 05:30:12,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:30:13,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138138208] [2025-03-08 05:30:13,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:30:13,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:30:13,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-08 05:30:13,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-08 05:30:13,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:30:13,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:13,066 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-03-08 05:30:13,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:30:13,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138138208] [2025-03-08 05:30:13,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138138208] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:30:13,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:30:13,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:30:13,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580751243] [2025-03-08 05:30:13,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:30:13,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:30:13,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:30:13,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:30:13,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:30:13,068 INFO L87 Difference]: Start difference. First operand 37501 states and 65022 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 05:30:14,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:30:14,677 INFO L93 Difference]: Finished difference Result 96679 states and 168434 transitions. [2025-03-08 05:30:14,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:30:14,677 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 175 [2025-03-08 05:30:14,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:30:14,949 INFO L225 Difference]: With dead ends: 96679 [2025-03-08 05:30:14,949 INFO L226 Difference]: Without dead ends: 65573 [2025-03-08 05:30:15,032 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:30:15,036 INFO L435 NwaCegarLoop]: 568 mSDtfsCounter, 100 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 1121 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:30:15,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 1121 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:30:15,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65573 states. [2025-03-08 05:30:17,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65573 to 65541. [2025-03-08 05:30:17,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65541 states, 54306 states have (on average 1.619747357566383) internal successors, (87962), 54322 states have internal predecessors, (87962), 11122 states have call successors, (11122), 102 states have call predecessors, (11122), 112 states have return successors, (14346), 11124 states have call predecessors, (14346), 11118 states have call successors, (14346) [2025-03-08 05:30:17,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65541 states to 65541 states and 113430 transitions. [2025-03-08 05:30:17,488 INFO L78 Accepts]: Start accepts. Automaton has 65541 states and 113430 transitions. Word has length 175 [2025-03-08 05:30:17,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:30:17,489 INFO L471 AbstractCegarLoop]: Abstraction has 65541 states and 113430 transitions. [2025-03-08 05:30:17,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 05:30:17,489 INFO L276 IsEmpty]: Start isEmpty. Operand 65541 states and 113430 transitions. [2025-03-08 05:30:17,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-08 05:30:17,781 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:30:17,781 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 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:30:17,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 05:30:17,781 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:30:17,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:30:17,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1241825105, now seen corresponding path program 1 times [2025-03-08 05:30:17,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:30:17,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415315145] [2025-03-08 05:30:17,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:30:17,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:30:18,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-08 05:30:18,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-08 05:30:18,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:30:18,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:18,064 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-03-08 05:30:18,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:30:18,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415315145] [2025-03-08 05:30:18,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415315145] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:30:18,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:30:18,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:30:18,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110281238] [2025-03-08 05:30:18,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:30:18,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:30:18,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:30:18,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:30:18,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:30:18,066 INFO L87 Difference]: Start difference. First operand 65541 states and 113430 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 05:30:20,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:30:20,589 INFO L93 Difference]: Finished difference Result 173243 states and 301406 transitions. [2025-03-08 05:30:20,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:30:20,590 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 176 [2025-03-08 05:30:20,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:30:21,315 INFO L225 Difference]: With dead ends: 173243 [2025-03-08 05:30:21,316 INFO L226 Difference]: Without dead ends: 116657 [2025-03-08 05:30:21,495 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:30:21,496 INFO L435 NwaCegarLoop]: 554 mSDtfsCounter, 98 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 1102 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:30:21,496 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 1102 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:30:21,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116657 states. [2025-03-08 05:30:24,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116657 to 116625. [2025-03-08 05:30:25,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116625 states, 97234 states have (on average 1.6160807947837177) internal successors, (157138), 97250 states have internal predecessors, (157138), 19278 states have call successors, (19278), 102 states have call predecessors, (19278), 112 states have return successors, (25210), 19280 states have call predecessors, (25210), 19274 states have call successors, (25210) [2025-03-08 05:30:25,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116625 states to 116625 states and 201626 transitions. [2025-03-08 05:30:25,726 INFO L78 Accepts]: Start accepts. Automaton has 116625 states and 201626 transitions. Word has length 176 [2025-03-08 05:30:25,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:30:25,726 INFO L471 AbstractCegarLoop]: Abstraction has 116625 states and 201626 transitions. [2025-03-08 05:30:25,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 05:30:25,727 INFO L276 IsEmpty]: Start isEmpty. Operand 116625 states and 201626 transitions. [2025-03-08 05:30:26,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-03-08 05:30:26,318 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:30:26,319 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 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:30:26,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 05:30:26,319 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:30:26,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:30:26,319 INFO L85 PathProgramCache]: Analyzing trace with hash -243511357, now seen corresponding path program 1 times [2025-03-08 05:30:26,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:30:26,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920675888] [2025-03-08 05:30:26,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:30:26,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:30:26,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-08 05:30:26,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-08 05:30:26,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:30:26,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:26,388 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-03-08 05:30:26,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:30:26,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920675888] [2025-03-08 05:30:26,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920675888] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:30:26,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:30:26,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:30:26,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729255640] [2025-03-08 05:30:26,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:30:26,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:30:26,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:30:26,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:30:26,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:30:26,390 INFO L87 Difference]: Start difference. First operand 116625 states and 201626 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 05:30:31,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:30:31,064 INFO L93 Difference]: Finished difference Result 317731 states and 549374 transitions. [2025-03-08 05:30:31,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:30:31,065 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 177 [2025-03-08 05:30:31,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:30:31,942 INFO L225 Difference]: With dead ends: 317731 [2025-03-08 05:30:31,942 INFO L226 Difference]: Without dead ends: 213125 [2025-03-08 05:30:32,198 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:30:32,200 INFO L435 NwaCegarLoop]: 554 mSDtfsCounter, 96 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 1102 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:30:32,200 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 1102 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:30:32,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213125 states.