./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec3_product24.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/email_spec3_product24.cil.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d6572e4842c262533bee65d100c3a8328a4505c101a30c259390a3fe459f824d --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 15:43:55,031 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 15:43:55,107 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 15:43:55,112 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 15:43:55,115 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 15:43:55,135 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 15:43:55,136 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 15:43:55,136 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 15:43:55,136 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 15:43:55,136 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 15:43:55,137 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 15:43:55,137 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 15:43:55,137 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 15:43:55,137 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 15:43:55,138 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 15:43:55,138 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 15:43:55,138 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 15:43:55,138 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 15:43:55,138 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 15:43:55,138 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 15:43:55,138 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 15:43:55,138 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 15:43:55,139 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 15:43:55,139 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 15:43:55,139 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 15:43:55,139 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 15:43:55,139 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 15:43:55,139 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 15:43:55,139 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 15:43:55,139 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 15:43:55,139 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 15:43:55,139 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 15:43:55,139 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:43:55,140 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 15:43:55,140 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 15:43:55,140 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 15:43:55,140 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 15:43:55,140 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 15:43:55,140 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 15:43:55,140 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 15:43:55,140 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 15:43:55,140 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 15:43:55,140 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 15:43:55,141 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d6572e4842c262533bee65d100c3a8328a4505c101a30c259390a3fe459f824d [2025-02-05 15:43:55,931 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 15:43:55,943 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 15:43:55,945 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 15:43:55,949 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 15:43:55,949 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 15:43:55,950 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec3_product24.cil.c [2025-02-05 15:43:57,849 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8f3703fcc/98b8138485f441f0ac117efcdf027af7/FLAG4b036d12f [2025-02-05 15:43:58,356 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 15:43:58,361 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec3_product24.cil.c [2025-02-05 15:43:58,377 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8f3703fcc/98b8138485f441f0ac117efcdf027af7/FLAG4b036d12f [2025-02-05 15:43:58,391 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8f3703fcc/98b8138485f441f0ac117efcdf027af7 [2025-02-05 15:43:58,393 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 15:43:58,394 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 15:43:58,395 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 15:43:58,396 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 15:43:58,398 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 15:43:58,399 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:43:58" (1/1) ... [2025-02-05 15:43:58,399 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@184cb39e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:43:58, skipping insertion in model container [2025-02-05 15:43:58,399 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:43:58" (1/1) ... [2025-02-05 15:43:58,456 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 15:43:59,123 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec3_product24.cil.c[52737,52750] [2025-02-05 15:43:59,154 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:43:59,161 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 15:43:59,167 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [48] [2025-02-05 15:43:59,168 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [97] [2025-02-05 15:43:59,168 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [410] [2025-02-05 15:43:59,168 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [517] [2025-02-05 15:43:59,168 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [1588] [2025-02-05 15:43:59,168 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [1807] [2025-02-05 15:43:59,168 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [2211] [2025-02-05 15:43:59,168 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [2536] [2025-02-05 15:43:59,168 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [2545] [2025-02-05 15:43:59,168 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [2911] [2025-02-05 15:43:59,168 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"SignVerify_spec.i","") [2928] [2025-02-05 15:43:59,231 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec3_product24.cil.c[52737,52750] [2025-02-05 15:43:59,244 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:43:59,264 INFO L204 MainTranslator]: Completed translation [2025-02-05 15:43:59,265 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:43:59 WrapperNode [2025-02-05 15:43:59,265 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 15:43:59,266 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 15:43:59,266 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 15:43:59,266 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 15:43:59,287 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:43:59" (1/1) ... [2025-02-05 15:43:59,349 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:43:59" (1/1) ... [2025-02-05 15:43:59,399 INFO L138 Inliner]: procedures = 131, calls = 200, calls flagged for inlining = 62, calls inlined = 57, statements flattened = 1026 [2025-02-05 15:43:59,400 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 15:43:59,400 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 15:43:59,400 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 15:43:59,400 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 15:43:59,406 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:43:59" (1/1) ... [2025-02-05 15:43:59,406 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:43:59" (1/1) ... [2025-02-05 15:43:59,410 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:43:59" (1/1) ... [2025-02-05 15:43:59,424 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 4, 4, 4]. 29 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 4, 4, 4]. The 0 writes are split as follows [0, 0, 0, 0]. [2025-02-05 15:43:59,424 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:43:59" (1/1) ... [2025-02-05 15:43:59,424 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:43:59" (1/1) ... [2025-02-05 15:43:59,435 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:43:59" (1/1) ... [2025-02-05 15:43:59,437 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:43:59" (1/1) ... [2025-02-05 15:43:59,438 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:43:59" (1/1) ... [2025-02-05 15:43:59,442 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:43:59" (1/1) ... [2025-02-05 15:43:59,445 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 15:43:59,446 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 15:43:59,446 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 15:43:59,446 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 15:43:59,447 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:43:59" (1/1) ... [2025-02-05 15:43:59,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:43:59,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:43:59,478 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 15:43:59,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 15:43:59,514 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-02-05 15:43:59,514 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-02-05 15:43:59,514 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-02-05 15:43:59,514 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-02-05 15:43:59,514 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2025-02-05 15:43:59,514 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2025-02-05 15:43:59,514 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-02-05 15:43:59,515 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-02-05 15:43:59,515 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2025-02-05 15:43:59,515 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2025-02-05 15:43:59,515 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-02-05 15:43:59,515 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-02-05 15:43:59,515 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-02-05 15:43:59,516 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-02-05 15:43:59,516 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2025-02-05 15:43:59,516 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2025-02-05 15:43:59,517 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-02-05 15:43:59,517 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-02-05 15:43:59,517 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 15:43:59,517 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2025-02-05 15:43:59,517 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2025-02-05 15:43:59,517 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2025-02-05 15:43:59,517 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2025-02-05 15:43:59,517 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-02-05 15:43:59,517 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-02-05 15:43:59,517 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2025-02-05 15:43:59,517 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2025-02-05 15:43:59,517 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-02-05 15:43:59,517 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-02-05 15:43:59,517 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-02-05 15:43:59,517 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-02-05 15:43:59,517 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2025-02-05 15:43:59,517 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2025-02-05 15:43:59,517 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-02-05 15:43:59,517 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-02-05 15:43:59,519 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-02-05 15:43:59,519 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-02-05 15:43:59,519 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-02-05 15:43:59,519 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-02-05 15:43:59,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 15:43:59,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-05 15:43:59,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-05 15:43:59,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-05 15:43:59,519 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-02-05 15:43:59,519 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-02-05 15:43:59,519 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 15:43:59,519 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 15:43:59,684 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 15:43:59,687 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 15:44:00,057 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2192-1: isVerified_#res#1 := isVerified_~retValue_acc~33#1; [2025-02-05 15:44:00,061 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1565-1: getClientId_#res#1 := getClientId_~retValue_acc~22#1; [2025-02-05 15:44:00,061 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1855-1: getEmailId_#res#1 := getEmailId_~retValue_acc~24#1; [2025-02-05 15:44:00,061 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1518-1: getClientForwardReceiver_#res#1 := getClientForwardReceiver_~retValue_acc~21#1; [2025-02-05 15:44:00,061 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1130-1: getClientPrivateKey_#res#1 := getClientPrivateKey_~retValue_acc~15#1; [2025-02-05 15:44:00,061 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1083-1: getClientAutoResponse_#res#1 := getClientAutoResponse_~retValue_acc~14#1; [2025-02-05 15:44:00,068 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2118: #res := ~retValue_acc~31; [2025-02-05 15:44:00,078 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2421: #res := ~retValue_acc~38; [2025-02-05 15:44:00,103 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1177-1: getClientKeyringSize_#res#1 := getClientKeyringSize_~retValue_acc~16#1; [2025-02-05 15:44:00,103 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1222: #res#1 := ~retValue_acc~17#1; [2025-02-05 15:44:00,121 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1446: #res := ~retValue_acc~20; [2025-02-05 15:44:00,130 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L514-1: createEmail_#res#1 := createEmail_~retValue_acc~5#1; [2025-02-05 15:44:00,137 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2155: #res := ~retValue_acc~32; [2025-02-05 15:44:00,158 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1929: #res := ~retValue_acc~26; [2025-02-05 15:44:00,496 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L94-1: valid_product_#res#1 := valid_product_~retValue_acc~1#1; [2025-02-05 15:44:00,496 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1392-1: getClientKeyringPublicKey_#res#1 := getClientKeyringPublicKey_~retValue_acc~19#1; [2025-02-05 15:44:00,496 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1285-1: getClientKeyringUser_#res#1 := getClientKeyringUser_~retValue_acc~18#1; [2025-02-05 15:44:00,496 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2378-1: is_queue_empty_#res#1 := is_queue_empty_~retValue_acc~35#1; [2025-02-05 15:44:00,496 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2387-1: get_queued_client_#res#1 := get_queued_client_~retValue_acc~36#1; [2025-02-05 15:44:00,496 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2396-1: get_queued_email_#res#1 := get_queued_email_~retValue_acc~37#1; [2025-02-05 15:44:00,504 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1892: #res := ~retValue_acc~25; [2025-02-05 15:44:00,506 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L490: #res := ~retValue_acc~3; [2025-02-05 15:44:00,700 INFO L? ?]: Removed 457 outVars from TransFormulas that were not future-live. [2025-02-05 15:44:00,700 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 15:44:00,721 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 15:44:00,721 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 15:44:00,721 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:44:00 BoogieIcfgContainer [2025-02-05 15:44:00,723 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 15:44:00,725 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 15:44:00,725 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 15:44:00,783 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 15:44:00,790 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 03:43:58" (1/3) ... [2025-02-05 15:44:00,791 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@458ff143 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:44:00, skipping insertion in model container [2025-02-05 15:44:00,791 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:43:59" (2/3) ... [2025-02-05 15:44:00,791 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@458ff143 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:44:00, skipping insertion in model container [2025-02-05 15:44:00,791 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:44:00" (3/3) ... [2025-02-05 15:44:00,792 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec3_product24.cil.c [2025-02-05 15:44:00,814 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 15:44:00,818 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec3_product24.cil.c that has 21 procedures, 341 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 15:44:00,885 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 15:44:00,896 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;@44b006ac, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 15:44:00,901 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 15:44:00,904 INFO L276 IsEmpty]: Start isEmpty. Operand has 341 states, 265 states have (on average 1.5169811320754718) internal successors, (402), 269 states have internal predecessors, (402), 54 states have call successors, (54), 20 states have call predecessors, (54), 20 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2025-02-05 15:44:00,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-02-05 15:44:00,929 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:44:00,930 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:44:00,930 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:44:00,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:44:00,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1900212966, now seen corresponding path program 1 times [2025-02-05 15:44:00,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:44:00,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522755286] [2025-02-05 15:44:00,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:44:00,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:44:01,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-05 15:44:01,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-05 15:44:01,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:44:01,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:44:01,737 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-05 15:44:01,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:44:01,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522755286] [2025-02-05 15:44:01,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522755286] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:44:01,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1229029132] [2025-02-05 15:44:01,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:44:01,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:44:01,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:44:01,757 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:44:01,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 15:44:02,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-05 15:44:02,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-05 15:44:02,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:44:02,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:44:02,162 INFO L256 TraceCheckSpWp]: Trace formula consists of 1022 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 15:44:02,169 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:44:02,184 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-05 15:44:02,186 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:44:02,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1229029132] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:44:02,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:44:02,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 5 [2025-02-05 15:44:02,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143693178] [2025-02-05 15:44:02,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:44:02,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 15:44:02,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:44:02,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 15:44:02,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:44:02,210 INFO L87 Difference]: Start difference. First operand has 341 states, 265 states have (on average 1.5169811320754718) internal successors, (402), 269 states have internal predecessors, (402), 54 states have call successors, (54), 20 states have call predecessors, (54), 20 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) Second operand has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-05 15:44:02,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:44:02,260 INFO L93 Difference]: Finished difference Result 523 states and 768 transitions. [2025-02-05 15:44:02,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 15:44:02,262 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 103 [2025-02-05 15:44:02,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:44:02,271 INFO L225 Difference]: With dead ends: 523 [2025-02-05 15:44:02,272 INFO L226 Difference]: Without dead ends: 333 [2025-02-05 15:44:02,275 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:44:02,279 INFO L435 NwaCegarLoop]: 505 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, 505 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:44:02,280 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 505 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:44:02,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2025-02-05 15:44:02,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 333. [2025-02-05 15:44:02,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 259 states have (on average 1.5135135135135136) internal successors, (392), 261 states have internal predecessors, (392), 54 states have call successors, (54), 20 states have call predecessors, (54), 19 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2025-02-05 15:44:02,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 497 transitions. [2025-02-05 15:44:02,363 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 497 transitions. Word has length 103 [2025-02-05 15:44:02,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:44:02,364 INFO L471 AbstractCegarLoop]: Abstraction has 333 states and 497 transitions. [2025-02-05 15:44:02,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-05 15:44:02,364 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 497 transitions. [2025-02-05 15:44:02,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-02-05 15:44:02,369 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:44:02,369 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:44:02,387 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 15:44:02,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-05 15:44:02,573 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:44:02,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:44:02,576 INFO L85 PathProgramCache]: Analyzing trace with hash 640322236, now seen corresponding path program 1 times [2025-02-05 15:44:02,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:44:02,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136259968] [2025-02-05 15:44:02,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:44:02,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:44:02,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-05 15:44:02,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-05 15:44:02,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:44:02,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:44:02,861 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-05 15:44:02,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:44:02,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136259968] [2025-02-05 15:44:02,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136259968] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:44:02,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [549473518] [2025-02-05 15:44:02,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:44:02,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:44:02,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:44:02,864 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:44:02,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 15:44:03,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-05 15:44:03,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-05 15:44:03,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:44:03,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:44:03,188 INFO L256 TraceCheckSpWp]: Trace formula consists of 1023 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 15:44:03,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:44:03,241 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-05 15:44:03,249 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:44:03,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [549473518] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:44:03,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:44:03,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-02-05 15:44:03,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202252493] [2025-02-05 15:44:03,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:44:03,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:44:03,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:44:03,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:44:03,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:44:03,251 INFO L87 Difference]: Start difference. First operand 333 states and 497 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-05 15:44:03,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:44:03,316 INFO L93 Difference]: Finished difference Result 511 states and 745 transitions. [2025-02-05 15:44:03,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:44:03,319 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 104 [2025-02-05 15:44:03,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:44:03,321 INFO L225 Difference]: With dead ends: 511 [2025-02-05 15:44:03,324 INFO L226 Difference]: Without dead ends: 335 [2025-02-05 15:44:03,326 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:44:03,326 INFO L435 NwaCegarLoop]: 496 mSDtfsCounter, 0 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 990 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:44:03,326 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 990 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:44:03,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2025-02-05 15:44:03,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 335. [2025-02-05 15:44:03,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 261 states have (on average 1.5095785440613028) internal successors, (394), 263 states have internal predecessors, (394), 54 states have call successors, (54), 20 states have call predecessors, (54), 19 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2025-02-05 15:44:03,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 499 transitions. [2025-02-05 15:44:03,365 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 499 transitions. Word has length 104 [2025-02-05 15:44:03,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:44:03,365 INFO L471 AbstractCegarLoop]: Abstraction has 335 states and 499 transitions. [2025-02-05 15:44:03,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-05 15:44:03,365 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 499 transitions. [2025-02-05 15:44:03,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-02-05 15:44:03,368 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:44:03,368 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:44:03,376 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 15:44:03,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:44:03,569 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:44:03,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:44:03,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1497663720, now seen corresponding path program 1 times [2025-02-05 15:44:03,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:44:03,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995957006] [2025-02-05 15:44:03,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:44:03,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:44:03,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-05 15:44:03,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-05 15:44:03,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:44:03,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:44:03,807 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-05 15:44:03,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:44:03,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995957006] [2025-02-05 15:44:03,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995957006] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:44:03,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [644883503] [2025-02-05 15:44:03,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:44:03,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:44:03,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:44:03,812 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:44:03,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 15:44:03,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-05 15:44:04,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-05 15:44:04,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:44:04,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:44:04,052 INFO L256 TraceCheckSpWp]: Trace formula consists of 1048 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 15:44:04,059 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:44:04,104 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-05 15:44:04,105 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:44:04,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [644883503] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:44:04,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:44:04,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-02-05 15:44:04,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738734621] [2025-02-05 15:44:04,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:44:04,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:44:04,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:44:04,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:44:04,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:44:04,110 INFO L87 Difference]: Start difference. First operand 335 states and 499 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-05 15:44:04,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:44:04,212 INFO L93 Difference]: Finished difference Result 704 states and 1064 transitions. [2025-02-05 15:44:04,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:44:04,216 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 112 [2025-02-05 15:44:04,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:44:04,218 INFO L225 Difference]: With dead ends: 704 [2025-02-05 15:44:04,218 INFO L226 Difference]: Without dead ends: 396 [2025-02-05 15:44:04,233 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:44:04,238 INFO L435 NwaCegarLoop]: 510 mSDtfsCounter, 115 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 960 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:44:04,240 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 960 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:44:04,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2025-02-05 15:44:04,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 388. [2025-02-05 15:44:04,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 303 states have (on average 1.528052805280528) internal successors, (463), 305 states have internal predecessors, (463), 65 states have call successors, (65), 20 states have call predecessors, (65), 19 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2025-02-05 15:44:04,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 590 transitions. [2025-02-05 15:44:04,312 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 590 transitions. Word has length 112 [2025-02-05 15:44:04,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:44:04,312 INFO L471 AbstractCegarLoop]: Abstraction has 388 states and 590 transitions. [2025-02-05 15:44:04,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-05 15:44:04,312 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 590 transitions. [2025-02-05 15:44:04,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-02-05 15:44:04,317 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:44:04,317 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:44:04,360 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-05 15:44:04,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:44:04,529 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:44:04,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:44:04,533 INFO L85 PathProgramCache]: Analyzing trace with hash -77373188, now seen corresponding path program 1 times [2025-02-05 15:44:04,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:44:04,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477508228] [2025-02-05 15:44:04,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:44:04,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:44:04,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-02-05 15:44:04,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-02-05 15:44:04,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:44:04,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:44:04,848 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-05 15:44:04,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:44:04,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477508228] [2025-02-05 15:44:04,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477508228] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:44:04,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1693733165] [2025-02-05 15:44:04,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:44:04,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:44:04,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:44:04,852 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:44:04,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-05 15:44:05,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-02-05 15:44:05,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-02-05 15:44:05,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:44:05,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:44:05,106 INFO L256 TraceCheckSpWp]: Trace formula consists of 1053 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-05 15:44:05,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:44:05,156 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-05 15:44:05,156 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:44:05,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1693733165] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:44:05,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:44:05,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-02-05 15:44:05,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522687114] [2025-02-05 15:44:05,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:44:05,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:44:05,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:44:05,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:44:05,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:44:05,158 INFO L87 Difference]: Start difference. First operand 388 states and 590 transitions. Second operand has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-02-05 15:44:05,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:44:05,229 INFO L93 Difference]: Finished difference Result 767 states and 1170 transitions. [2025-02-05 15:44:05,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:44:05,234 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 113 [2025-02-05 15:44:05,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:44:05,237 INFO L225 Difference]: With dead ends: 767 [2025-02-05 15:44:05,239 INFO L226 Difference]: Without dead ends: 390 [2025-02-05 15:44:05,240 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:44:05,242 INFO L435 NwaCegarLoop]: 489 mSDtfsCounter, 2 mSDsluCounter, 1456 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1945 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:44:05,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1945 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:44:05,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2025-02-05 15:44:05,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 390. [2025-02-05 15:44:05,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 304 states have (on average 1.5263157894736843) internal successors, (464), 307 states have internal predecessors, (464), 65 states have call successors, (65), 20 states have call predecessors, (65), 20 states have return successors, (64), 62 states have call predecessors, (64), 62 states have call successors, (64) [2025-02-05 15:44:05,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 593 transitions. [2025-02-05 15:44:05,263 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 593 transitions. Word has length 113 [2025-02-05 15:44:05,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:44:05,264 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 593 transitions. [2025-02-05 15:44:05,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-02-05 15:44:05,265 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 593 transitions. [2025-02-05 15:44:05,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-02-05 15:44:05,268 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:44:05,268 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:44:05,275 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-05 15:44:05,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:44:05,470 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:44:05,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:44:05,471 INFO L85 PathProgramCache]: Analyzing trace with hash -1233556523, now seen corresponding path program 1 times [2025-02-05 15:44:05,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:44:05,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483866429] [2025-02-05 15:44:05,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:44:05,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:44:05,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-02-05 15:44:05,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-02-05 15:44:05,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:44:05,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:44:05,980 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-05 15:44:05,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:44:05,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483866429] [2025-02-05 15:44:05,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483866429] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:44:05,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [504336678] [2025-02-05 15:44:05,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:44:05,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:44:05,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:44:05,983 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:44:06,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-05 15:44:06,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-02-05 15:44:06,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-02-05 15:44:06,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:44:06,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:44:06,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 1054 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 15:44:06,263 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:44:06,296 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-05 15:44:06,296 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:44:06,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [504336678] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:44:06,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:44:06,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-02-05 15:44:06,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864989234] [2025-02-05 15:44:06,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:44:06,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:44:06,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:44:06,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:44:06,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-02-05 15:44:06,298 INFO L87 Difference]: Start difference. First operand 390 states and 593 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-02-05 15:44:06,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:44:06,358 INFO L93 Difference]: Finished difference Result 769 states and 1175 transitions. [2025-02-05 15:44:06,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:44:06,359 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 114 [2025-02-05 15:44:06,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:44:06,361 INFO L225 Difference]: With dead ends: 769 [2025-02-05 15:44:06,361 INFO L226 Difference]: Without dead ends: 392 [2025-02-05 15:44:06,362 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-02-05 15:44:06,363 INFO L435 NwaCegarLoop]: 487 mSDtfsCounter, 2 mSDsluCounter, 1444 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1931 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:44:06,363 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1931 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:44:06,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2025-02-05 15:44:06,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2025-02-05 15:44:06,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 305 states have (on average 1.5245901639344261) internal successors, (465), 309 states have internal predecessors, (465), 65 states have call successors, (65), 20 states have call predecessors, (65), 21 states have return successors, (69), 62 states have call predecessors, (69), 62 states have call successors, (69) [2025-02-05 15:44:06,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 599 transitions. [2025-02-05 15:44:06,382 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 599 transitions. Word has length 114 [2025-02-05 15:44:06,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:44:06,382 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 599 transitions. [2025-02-05 15:44:06,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-02-05 15:44:06,382 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 599 transitions. [2025-02-05 15:44:06,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-02-05 15:44:06,384 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:44:06,384 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:44:06,392 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-05 15:44:06,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:44:06,585 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:44:06,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:44:06,586 INFO L85 PathProgramCache]: Analyzing trace with hash -1214512727, now seen corresponding path program 1 times [2025-02-05 15:44:06,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:44:06,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344745398] [2025-02-05 15:44:06,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:44:06,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:44:06,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-02-05 15:44:06,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-02-05 15:44:06,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:44:06,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:44:06,724 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-05 15:44:06,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:44:06,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344745398] [2025-02-05 15:44:06,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344745398] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:44:06,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:44:06,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:44:06,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213898077] [2025-02-05 15:44:06,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:44:06,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:44:06,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:44:06,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:44:06,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:44:06,727 INFO L87 Difference]: Start difference. First operand 392 states and 599 transitions. Second operand has 5 states, 4 states have (on average 18.75) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-02-05 15:44:06,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:44:06,773 INFO L93 Difference]: Finished difference Result 761 states and 1166 transitions. [2025-02-05 15:44:06,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:44:06,774 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 18.75) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 115 [2025-02-05 15:44:06,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:44:06,778 INFO L225 Difference]: With dead ends: 761 [2025-02-05 15:44:06,778 INFO L226 Difference]: Without dead ends: 392 [2025-02-05 15:44:06,779 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:44:06,781 INFO L435 NwaCegarLoop]: 490 mSDtfsCounter, 2 mSDsluCounter, 1459 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1949 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:44:06,781 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1949 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:44:06,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2025-02-05 15:44:06,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2025-02-05 15:44:06,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 305 states have (on average 1.5245901639344261) internal successors, (465), 309 states have internal predecessors, (465), 65 states have call successors, (65), 20 states have call predecessors, (65), 21 states have return successors, (68), 62 states have call predecessors, (68), 62 states have call successors, (68) [2025-02-05 15:44:06,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 598 transitions. [2025-02-05 15:44:06,804 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 598 transitions. Word has length 115 [2025-02-05 15:44:06,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:44:06,804 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 598 transitions. [2025-02-05 15:44:06,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 18.75) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-02-05 15:44:06,804 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 598 transitions. [2025-02-05 15:44:06,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-02-05 15:44:06,808 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:44:06,808 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:44:06,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 15:44:06,808 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:44:06,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:44:06,809 INFO L85 PathProgramCache]: Analyzing trace with hash 873660068, now seen corresponding path program 2 times [2025-02-05 15:44:06,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:44:06,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129463649] [2025-02-05 15:44:06,809 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 15:44:06,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:44:06,828 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 116 statements into 2 equivalence classes. [2025-02-05 15:44:06,838 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 116 of 116 statements. [2025-02-05 15:44:06,839 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 15:44:06,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:44:06,919 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-05 15:44:06,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:44:06,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129463649] [2025-02-05 15:44:06,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129463649] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:44:06,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:44:06,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:44:06,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401030620] [2025-02-05 15:44:06,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:44:06,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:44:06,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:44:06,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:44:06,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:44:06,921 INFO L87 Difference]: Start difference. First operand 392 states and 598 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-02-05 15:44:06,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:44:06,987 INFO L93 Difference]: Finished difference Result 759 states and 1161 transitions. [2025-02-05 15:44:06,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:44:06,988 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 116 [2025-02-05 15:44:06,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:44:06,992 INFO L225 Difference]: With dead ends: 759 [2025-02-05 15:44:06,992 INFO L226 Difference]: Without dead ends: 392 [2025-02-05 15:44:06,994 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:44:06,995 INFO L435 NwaCegarLoop]: 488 mSDtfsCounter, 2 mSDsluCounter, 1447 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1935 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:44:06,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1935 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:44:06,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2025-02-05 15:44:07,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2025-02-05 15:44:07,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 305 states have (on average 1.5245901639344261) internal successors, (465), 309 states have internal predecessors, (465), 65 states have call successors, (65), 20 states have call predecessors, (65), 21 states have return successors, (67), 62 states have call predecessors, (67), 62 states have call successors, (67) [2025-02-05 15:44:07,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 597 transitions. [2025-02-05 15:44:07,020 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 597 transitions. Word has length 116 [2025-02-05 15:44:07,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:44:07,020 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 597 transitions. [2025-02-05 15:44:07,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-02-05 15:44:07,021 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 597 transitions. [2025-02-05 15:44:07,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-02-05 15:44:07,022 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:44:07,022 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:44:07,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 15:44:07,023 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:44:07,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:44:07,023 INFO L85 PathProgramCache]: Analyzing trace with hash 2114605914, now seen corresponding path program 3 times [2025-02-05 15:44:07,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:44:07,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393674736] [2025-02-05 15:44:07,024 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 15:44:07,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:44:07,058 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 117 statements into 3 equivalence classes. [2025-02-05 15:44:07,077 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 105 of 117 statements. [2025-02-05 15:44:07,078 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-05 15:44:07,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:44:07,311 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-02-05 15:44:07,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:44:07,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393674736] [2025-02-05 15:44:07,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393674736] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:44:07,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:44:07,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:44:07,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611478134] [2025-02-05 15:44:07,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:44:07,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:44:07,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:44:07,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:44:07,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:44:07,315 INFO L87 Difference]: Start difference. First operand 392 states and 597 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (13), 4 states have call predecessors, (13), 3 states have call successors, (13) [2025-02-05 15:44:07,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:44:07,598 INFO L93 Difference]: Finished difference Result 915 states and 1331 transitions. [2025-02-05 15:44:07,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-05 15:44:07,598 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (13), 4 states have call predecessors, (13), 3 states have call successors, (13) Word has length 117 [2025-02-05 15:44:07,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:44:07,604 INFO L225 Difference]: With dead ends: 915 [2025-02-05 15:44:07,604 INFO L226 Difference]: Without dead ends: 746 [2025-02-05 15:44:07,606 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-02-05 15:44:07,606 INFO L435 NwaCegarLoop]: 756 mSDtfsCounter, 738 mSDsluCounter, 2330 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 742 SdHoareTripleChecker+Valid, 3086 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 15:44:07,606 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [742 Valid, 3086 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 15:44:07,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2025-02-05 15:44:07,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 736. [2025-02-05 15:44:07,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 736 states, 575 states have (on average 1.48) internal successors, (851), 582 states have internal predecessors, (851), 111 states have call successors, (111), 44 states have call predecessors, (111), 49 states have return successors, (120), 109 states have call predecessors, (120), 106 states have call successors, (120) [2025-02-05 15:44:07,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 1082 transitions. [2025-02-05 15:44:07,640 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 1082 transitions. Word has length 117 [2025-02-05 15:44:07,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:44:07,640 INFO L471 AbstractCegarLoop]: Abstraction has 736 states and 1082 transitions. [2025-02-05 15:44:07,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (13), 4 states have call predecessors, (13), 3 states have call successors, (13) [2025-02-05 15:44:07,640 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 1082 transitions. [2025-02-05 15:44:07,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-02-05 15:44:07,643 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:44:07,643 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:44:07,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 15:44:07,643 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:44:07,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:44:07,643 INFO L85 PathProgramCache]: Analyzing trace with hash 209590697, now seen corresponding path program 1 times [2025-02-05 15:44:07,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:44:07,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639806504] [2025-02-05 15:44:07,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:44:07,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:44:07,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-05 15:44:07,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-05 15:44:07,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:44:07,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:44:07,902 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-05 15:44:07,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:44:07,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639806504] [2025-02-05 15:44:07,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639806504] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:44:07,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:44:07,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:44:07,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642053526] [2025-02-05 15:44:07,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:44:07,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:44:07,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:44:07,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:44:07,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:44:07,904 INFO L87 Difference]: Start difference. First operand 736 states and 1082 transitions. Second operand has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-02-05 15:44:07,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:44:07,954 INFO L93 Difference]: Finished difference Result 1451 states and 2137 transitions. [2025-02-05 15:44:07,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:44:07,954 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 118 [2025-02-05 15:44:07,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:44:07,959 INFO L225 Difference]: With dead ends: 1451 [2025-02-05 15:44:07,959 INFO L226 Difference]: Without dead ends: 738 [2025-02-05 15:44:07,962 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:44:07,964 INFO L435 NwaCegarLoop]: 491 mSDtfsCounter, 1 mSDsluCounter, 1461 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1952 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:44:07,964 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1952 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:44:07,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2025-02-05 15:44:08,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 738. [2025-02-05 15:44:08,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 738 states, 576 states have (on average 1.4791666666666667) internal successors, (852), 584 states have internal predecessors, (852), 111 states have call successors, (111), 44 states have call predecessors, (111), 50 states have return successors, (122), 109 states have call predecessors, (122), 106 states have call successors, (122) [2025-02-05 15:44:08,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 1085 transitions. [2025-02-05 15:44:08,027 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 1085 transitions. Word has length 118 [2025-02-05 15:44:08,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:44:08,027 INFO L471 AbstractCegarLoop]: Abstraction has 738 states and 1085 transitions. [2025-02-05 15:44:08,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-02-05 15:44:08,027 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 1085 transitions. [2025-02-05 15:44:08,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-02-05 15:44:08,033 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:44:08,033 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:44:08,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 15:44:08,033 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:44:08,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:44:08,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1053086673, now seen corresponding path program 1 times [2025-02-05 15:44:08,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:44:08,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196666972] [2025-02-05 15:44:08,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:44:08,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:44:08,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-05 15:44:08,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-05 15:44:08,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:44:08,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:44:08,344 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-05 15:44:08,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:44:08,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196666972] [2025-02-05 15:44:08,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196666972] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:44:08,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:44:08,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 15:44:08,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145030846] [2025-02-05 15:44:08,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:44:08,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 15:44:08,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:44:08,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 15:44:08,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:44:08,351 INFO L87 Difference]: Start difference. First operand 738 states and 1085 transitions. Second operand has 8 states, 7 states have (on average 11.714285714285714) internal successors, (82), 8 states have internal predecessors, (82), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2025-02-05 15:44:08,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:44:08,777 INFO L93 Difference]: Finished difference Result 1456 states and 2146 transitions. [2025-02-05 15:44:08,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 15:44:08,778 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 11.714285714285714) internal successors, (82), 8 states have internal predecessors, (82), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) Word has length 119 [2025-02-05 15:44:08,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:44:08,786 INFO L225 Difference]: With dead ends: 1456 [2025-02-05 15:44:08,787 INFO L226 Difference]: Without dead ends: 743 [2025-02-05 15:44:08,793 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-02-05 15:44:08,794 INFO L435 NwaCegarLoop]: 483 mSDtfsCounter, 5 mSDsluCounter, 2869 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 3352 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 15:44:08,798 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 3352 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 15:44:08,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2025-02-05 15:44:08,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 743. [2025-02-05 15:44:08,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 743 states, 580 states have (on average 1.4775862068965517) internal successors, (857), 588 states have internal predecessors, (857), 111 states have call successors, (111), 45 states have call predecessors, (111), 51 states have return successors, (127), 109 states have call predecessors, (127), 106 states have call successors, (127) [2025-02-05 15:44:08,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 743 states and 1095 transitions. [2025-02-05 15:44:08,952 INFO L78 Accepts]: Start accepts. Automaton has 743 states and 1095 transitions. Word has length 119 [2025-02-05 15:44:08,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:44:08,969 INFO L471 AbstractCegarLoop]: Abstraction has 743 states and 1095 transitions. [2025-02-05 15:44:08,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 11.714285714285714) internal successors, (82), 8 states have internal predecessors, (82), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2025-02-05 15:44:08,978 INFO L276 IsEmpty]: Start isEmpty. Operand 743 states and 1095 transitions. [2025-02-05 15:44:08,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-02-05 15:44:08,991 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:44:08,991 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:44:08,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 15:44:08,991 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:44:08,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:44:08,996 INFO L85 PathProgramCache]: Analyzing trace with hash 217961492, now seen corresponding path program 1 times [2025-02-05 15:44:08,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:44:08,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072822821] [2025-02-05 15:44:08,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:44:08,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:44:09,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-02-05 15:44:09,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-02-05 15:44:09,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:44:09,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:44:09,338 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-02-05 15:44:09,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:44:09,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072822821] [2025-02-05 15:44:09,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072822821] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:44:09,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1230758310] [2025-02-05 15:44:09,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:44:09,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:44:09,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:44:09,359 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:44:09,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-05 15:44:09,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-02-05 15:44:09,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-02-05 15:44:09,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:44:09,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:44:09,613 INFO L256 TraceCheckSpWp]: Trace formula consists of 1060 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 15:44:09,617 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:44:09,655 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:44:09,658 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:44:09,734 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:44:09,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1230758310] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:44:09,735 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:44:09,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 11 [2025-02-05 15:44:09,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738783809] [2025-02-05 15:44:09,735 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:44:09,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 15:44:09,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:44:09,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 15:44:09,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-02-05 15:44:09,737 INFO L87 Difference]: Start difference. First operand 743 states and 1095 transitions. Second operand has 11 states, 10 states have (on average 13.1) internal successors, (131), 11 states have internal predecessors, (131), 4 states have call successors, (27), 2 states have call predecessors, (27), 3 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) [2025-02-05 15:44:10,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:44:10,368 INFO L93 Difference]: Finished difference Result 1864 states and 2833 transitions. [2025-02-05 15:44:10,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 15:44:10,368 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 13.1) internal successors, (131), 11 states have internal predecessors, (131), 4 states have call successors, (27), 2 states have call predecessors, (27), 3 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) Word has length 120 [2025-02-05 15:44:10,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:44:10,376 INFO L225 Difference]: With dead ends: 1864 [2025-02-05 15:44:10,376 INFO L226 Difference]: Without dead ends: 1153 [2025-02-05 15:44:10,381 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 237 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-02-05 15:44:10,382 INFO L435 NwaCegarLoop]: 485 mSDtfsCounter, 1224 mSDsluCounter, 3324 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1224 SdHoareTripleChecker+Valid, 3809 SdHoareTripleChecker+Invalid, 604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 15:44:10,382 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1224 Valid, 3809 Invalid, 604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 15:44:10,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1153 states. [2025-02-05 15:44:10,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1153 to 1093. [2025-02-05 15:44:10,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1093 states, 866 states have (on average 1.5300230946882216) internal successors, (1325), 873 states have internal predecessors, (1325), 175 states have call successors, (175), 46 states have call predecessors, (175), 51 states have return successors, (201), 173 states have call predecessors, (201), 170 states have call successors, (201) [2025-02-05 15:44:10,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1093 states to 1093 states and 1701 transitions. [2025-02-05 15:44:10,438 INFO L78 Accepts]: Start accepts. Automaton has 1093 states and 1701 transitions. Word has length 120 [2025-02-05 15:44:10,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:44:10,438 INFO L471 AbstractCegarLoop]: Abstraction has 1093 states and 1701 transitions. [2025-02-05 15:44:10,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 13.1) internal successors, (131), 11 states have internal predecessors, (131), 4 states have call successors, (27), 2 states have call predecessors, (27), 3 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) [2025-02-05 15:44:10,438 INFO L276 IsEmpty]: Start isEmpty. Operand 1093 states and 1701 transitions. [2025-02-05 15:44:10,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-05 15:44:10,441 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:44:10,442 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:44:10,453 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-05 15:44:10,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-02-05 15:44:10,643 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:44:10,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:44:10,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1340705323, now seen corresponding path program 1 times [2025-02-05 15:44:10,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:44:10,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183114815] [2025-02-05 15:44:10,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:44:10,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:44:10,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-05 15:44:10,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-05 15:44:10,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:44:10,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:44:10,697 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:44:10,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:44:10,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183114815] [2025-02-05 15:44:10,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183114815] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:44:10,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:44:10,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:44:10,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85882492] [2025-02-05 15:44:10,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:44:10,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:44:10,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:44:10,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:44:10,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:44:10,699 INFO L87 Difference]: Start difference. First operand 1093 states and 1701 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-05 15:44:10,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:44:10,748 INFO L93 Difference]: Finished difference Result 2445 states and 3865 transitions. [2025-02-05 15:44:10,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:44:10,749 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 123 [2025-02-05 15:44:10,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:44:10,756 INFO L225 Difference]: With dead ends: 2445 [2025-02-05 15:44:10,757 INFO L226 Difference]: Without dead ends: 1433 [2025-02-05 15:44:10,761 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:44:10,761 INFO L435 NwaCegarLoop]: 504 mSDtfsCounter, 112 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 989 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:44:10,761 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 989 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:44:10,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1433 states. [2025-02-05 15:44:10,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1433 to 1413. [2025-02-05 15:44:10,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1413 states, 1122 states have (on average 1.5552584670231728) internal successors, (1745), 1129 states have internal predecessors, (1745), 239 states have call successors, (239), 46 states have call predecessors, (239), 51 states have return successors, (275), 237 states have call predecessors, (275), 234 states have call successors, (275) [2025-02-05 15:44:10,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1413 states to 1413 states and 2259 transitions. [2025-02-05 15:44:10,872 INFO L78 Accepts]: Start accepts. Automaton has 1413 states and 2259 transitions. Word has length 123 [2025-02-05 15:44:10,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:44:10,872 INFO L471 AbstractCegarLoop]: Abstraction has 1413 states and 2259 transitions. [2025-02-05 15:44:10,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-05 15:44:10,872 INFO L276 IsEmpty]: Start isEmpty. Operand 1413 states and 2259 transitions. [2025-02-05 15:44:10,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-02-05 15:44:10,883 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:44:10,884 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:44:10,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 15:44:10,884 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:44:10,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:44:10,884 INFO L85 PathProgramCache]: Analyzing trace with hash 377288812, now seen corresponding path program 1 times [2025-02-05 15:44:10,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:44:10,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313913594] [2025-02-05 15:44:10,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:44:10,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:44:10,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-05 15:44:10,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-05 15:44:10,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:44:10,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:44:10,978 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:44:10,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:44:10,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313913594] [2025-02-05 15:44:10,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313913594] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:44:10,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:44:10,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:44:10,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93943630] [2025-02-05 15:44:10,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:44:10,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:44:10,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:44:10,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:44:10,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:44:10,979 INFO L87 Difference]: Start difference. First operand 1413 states and 2259 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-05 15:44:11,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:44:11,110 INFO L93 Difference]: Finished difference Result 3239 states and 5222 transitions. [2025-02-05 15:44:11,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:44:11,111 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 124 [2025-02-05 15:44:11,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:44:11,130 INFO L225 Difference]: With dead ends: 3239 [2025-02-05 15:44:11,133 INFO L226 Difference]: Without dead ends: 1958 [2025-02-05 15:44:11,143 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:44:11,147 INFO L435 NwaCegarLoop]: 497 mSDtfsCounter, 110 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 986 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:44:11,147 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 986 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:44:11,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1958 states. [2025-02-05 15:44:11,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1958 to 1938. [2025-02-05 15:44:11,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1938 states, 1552 states have (on average 1.5740979381443299) internal successors, (2443), 1559 states have internal predecessors, (2443), 334 states have call successors, (334), 46 states have call predecessors, (334), 51 states have return successors, (370), 332 states have call predecessors, (370), 329 states have call successors, (370) [2025-02-05 15:44:11,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1938 states to 1938 states and 3147 transitions. [2025-02-05 15:44:11,229 INFO L78 Accepts]: Start accepts. Automaton has 1938 states and 3147 transitions. Word has length 124 [2025-02-05 15:44:11,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:44:11,231 INFO L471 AbstractCegarLoop]: Abstraction has 1938 states and 3147 transitions. [2025-02-05 15:44:11,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-05 15:44:11,231 INFO L276 IsEmpty]: Start isEmpty. Operand 1938 states and 3147 transitions. [2025-02-05 15:44:11,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-02-05 15:44:11,238 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:44:11,238 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:44:11,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 15:44:11,239 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:44:11,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:44:11,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1426337204, now seen corresponding path program 1 times [2025-02-05 15:44:11,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:44:11,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16267371] [2025-02-05 15:44:11,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:44:11,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:44:11,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-05 15:44:11,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-05 15:44:11,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:44:11,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:44:11,285 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:44:11,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:44:11,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16267371] [2025-02-05 15:44:11,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16267371] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:44:11,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:44:11,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:44:11,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693389543] [2025-02-05 15:44:11,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:44:11,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:44:11,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:44:11,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:44:11,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:44:11,287 INFO L87 Difference]: Start difference. First operand 1938 states and 3147 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-05 15:44:11,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:44:11,361 INFO L93 Difference]: Finished difference Result 4428 states and 7256 transitions. [2025-02-05 15:44:11,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:44:11,362 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 125 [2025-02-05 15:44:11,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:44:11,376 INFO L225 Difference]: With dead ends: 4428 [2025-02-05 15:44:11,377 INFO L226 Difference]: Without dead ends: 2754 [2025-02-05 15:44:11,383 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:44:11,384 INFO L435 NwaCegarLoop]: 495 mSDtfsCounter, 108 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 981 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:44:11,384 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 981 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:44:11,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2754 states. [2025-02-05 15:44:11,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2754 to 2734. [2025-02-05 15:44:11,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2734 states, 2225 states have (on average 1.5896629213483147) internal successors, (3537), 2232 states have internal predecessors, (3537), 457 states have call successors, (457), 46 states have call predecessors, (457), 51 states have return successors, (509), 455 states have call predecessors, (509), 452 states have call successors, (509) [2025-02-05 15:44:11,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2734 states to 2734 states and 4503 transitions. [2025-02-05 15:44:11,522 INFO L78 Accepts]: Start accepts. Automaton has 2734 states and 4503 transitions. Word has length 125 [2025-02-05 15:44:11,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:44:11,523 INFO L471 AbstractCegarLoop]: Abstraction has 2734 states and 4503 transitions. [2025-02-05 15:44:11,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-05 15:44:11,523 INFO L276 IsEmpty]: Start isEmpty. Operand 2734 states and 4503 transitions. [2025-02-05 15:44:11,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-02-05 15:44:11,530 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:44:11,531 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:44:11,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 15:44:11,531 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:44:11,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:44:11,531 INFO L85 PathProgramCache]: Analyzing trace with hash -1690197459, now seen corresponding path program 1 times [2025-02-05 15:44:11,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:44:11,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478862584] [2025-02-05 15:44:11,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:44:11,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:44:11,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-02-05 15:44:11,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-02-05 15:44:11,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:44:11,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:44:11,573 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:44:11,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:44:11,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478862584] [2025-02-05 15:44:11,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478862584] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:44:11,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:44:11,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:44:11,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907767873] [2025-02-05 15:44:11,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:44:11,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:44:11,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:44:11,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:44:11,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:44:11,575 INFO L87 Difference]: Start difference. First operand 2734 states and 4503 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-05 15:44:11,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:44:11,666 INFO L93 Difference]: Finished difference Result 6281 states and 10428 transitions. [2025-02-05 15:44:11,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:44:11,667 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 126 [2025-02-05 15:44:11,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:44:11,683 INFO L225 Difference]: With dead ends: 6281 [2025-02-05 15:44:11,684 INFO L226 Difference]: Without dead ends: 4026 [2025-02-05 15:44:11,692 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:44:11,693 INFO L435 NwaCegarLoop]: 495 mSDtfsCounter, 106 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 981 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:44:11,693 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 981 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:44:11,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4026 states. [2025-02-05 15:44:11,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4026 to 4006. [2025-02-05 15:44:11,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4006 states, 3318 states have (on average 1.6012658227848102) internal successors, (5313), 3325 states have internal predecessors, (5313), 636 states have call successors, (636), 46 states have call predecessors, (636), 51 states have return successors, (714), 634 states have call predecessors, (714), 631 states have call successors, (714) [2025-02-05 15:44:11,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4006 states to 4006 states and 6663 transitions. [2025-02-05 15:44:11,881 INFO L78 Accepts]: Start accepts. Automaton has 4006 states and 6663 transitions. Word has length 126 [2025-02-05 15:44:11,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:44:11,882 INFO L471 AbstractCegarLoop]: Abstraction has 4006 states and 6663 transitions. [2025-02-05 15:44:11,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-05 15:44:11,882 INFO L276 IsEmpty]: Start isEmpty. Operand 4006 states and 6663 transitions. [2025-02-05 15:44:11,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-02-05 15:44:11,892 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:44:11,892 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:44:11,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 15:44:11,893 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:44:11,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:44:11,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1183824205, now seen corresponding path program 1 times [2025-02-05 15:44:11,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:44:11,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861562502] [2025-02-05 15:44:11,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:44:11,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:44:11,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-02-05 15:44:11,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-02-05 15:44:11,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:44:11,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:44:11,940 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:44:11,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:44:11,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861562502] [2025-02-05 15:44:11,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861562502] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:44:11,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:44:11,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:44:11,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953358070] [2025-02-05 15:44:11,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:44:11,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:44:11,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:44:11,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:44:11,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:44:11,942 INFO L87 Difference]: Start difference. First operand 4006 states and 6663 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, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-05 15:44:12,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:44:12,118 INFO L93 Difference]: Finished difference Result 9328 states and 15636 transitions. [2025-02-05 15:44:12,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:44:12,119 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, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 127 [2025-02-05 15:44:12,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:44:12,150 INFO L225 Difference]: With dead ends: 9328 [2025-02-05 15:44:12,151 INFO L226 Difference]: Without dead ends: 6128 [2025-02-05 15:44:12,162 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:44:12,164 INFO L435 NwaCegarLoop]: 509 mSDtfsCounter, 104 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 996 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:44:12,164 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 996 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:44:12,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6128 states. [2025-02-05 15:44:12,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6128 to 6108. [2025-02-05 15:44:12,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6108 states, 5044 states have (on average 1.6019032513877876) internal successors, (8080), 5051 states have internal predecessors, (8080), 1012 states have call successors, (1012), 46 states have call predecessors, (1012), 51 states have return successors, (1134), 1010 states have call predecessors, (1134), 1007 states have call successors, (1134) [2025-02-05 15:44:12,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6108 states to 6108 states and 10226 transitions. [2025-02-05 15:44:12,484 INFO L78 Accepts]: Start accepts. Automaton has 6108 states and 10226 transitions. Word has length 127 [2025-02-05 15:44:12,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:44:12,485 INFO L471 AbstractCegarLoop]: Abstraction has 6108 states and 10226 transitions. [2025-02-05 15:44:12,485 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, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-05 15:44:12,485 INFO L276 IsEmpty]: Start isEmpty. Operand 6108 states and 10226 transitions. [2025-02-05 15:44:12,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-02-05 15:44:12,502 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:44:12,502 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:44:12,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 15:44:12,503 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:44:12,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:44:12,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1152745966, now seen corresponding path program 1 times [2025-02-05 15:44:12,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:44:12,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204299700] [2025-02-05 15:44:12,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:44:12,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:44:12,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-02-05 15:44:12,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-02-05 15:44:12,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:44:12,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:44:12,551 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:44:12,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:44:12,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204299700] [2025-02-05 15:44:12,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204299700] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:44:12,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:44:12,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:44:12,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436314606] [2025-02-05 15:44:12,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:44:12,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:44:12,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:44:12,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:44:12,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:44:12,553 INFO L87 Difference]: Start difference. First operand 6108 states and 10226 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-05 15:44:12,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:44:12,872 INFO L93 Difference]: Finished difference Result 14840 states and 25033 transitions. [2025-02-05 15:44:12,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:44:12,873 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 128 [2025-02-05 15:44:12,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:44:12,946 INFO L225 Difference]: With dead ends: 14840 [2025-02-05 15:44:12,946 INFO L226 Difference]: Without dead ends: 9934 [2025-02-05 15:44:12,968 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:44:12,969 INFO L435 NwaCegarLoop]: 495 mSDtfsCounter, 102 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 984 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:44:12,970 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 984 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:44:12,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9934 states. [2025-02-05 15:44:13,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9934 to 9914. [2025-02-05 15:44:13,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9914 states, 8244 states have (on average 1.6044395924308588) internal successors, (13227), 8251 states have internal predecessors, (13227), 1618 states have call successors, (1618), 46 states have call predecessors, (1618), 51 states have return successors, (1818), 1616 states have call predecessors, (1818), 1613 states have call successors, (1818) [2025-02-05 15:44:13,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9914 states to 9914 states and 16663 transitions. [2025-02-05 15:44:13,460 INFO L78 Accepts]: Start accepts. Automaton has 9914 states and 16663 transitions. Word has length 128 [2025-02-05 15:44:13,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:44:13,461 INFO L471 AbstractCegarLoop]: Abstraction has 9914 states and 16663 transitions. [2025-02-05 15:44:13,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-05 15:44:13,461 INFO L276 IsEmpty]: Start isEmpty. Operand 9914 states and 16663 transitions. [2025-02-05 15:44:13,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-02-05 15:44:13,485 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:44:13,485 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:44:13,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 15:44:13,485 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:44:13,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:44:13,486 INFO L85 PathProgramCache]: Analyzing trace with hash 437961170, now seen corresponding path program 1 times [2025-02-05 15:44:13,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:44:13,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336842687] [2025-02-05 15:44:13,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:44:13,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:44:13,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-02-05 15:44:13,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-02-05 15:44:13,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:44:13,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:44:13,532 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:44:13,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:44:13,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336842687] [2025-02-05 15:44:13,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336842687] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:44:13,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:44:13,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:44:13,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066180626] [2025-02-05 15:44:13,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:44:13,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:44:13,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:44:13,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:44:13,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:44:13,533 INFO L87 Difference]: Start difference. First operand 9914 states and 16663 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-05 15:44:13,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:44:13,937 INFO L93 Difference]: Finished difference Result 25347 states and 42831 transitions. [2025-02-05 15:44:14,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:44:14,000 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 129 [2025-02-05 15:44:14,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:44:14,060 INFO L225 Difference]: With dead ends: 25347 [2025-02-05 15:44:14,060 INFO L226 Difference]: Without dead ends: 17110 [2025-02-05 15:44:14,089 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:44:14,089 INFO L435 NwaCegarLoop]: 501 mSDtfsCounter, 100 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 992 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:44:14,089 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 992 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:44:14,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17110 states. [2025-02-05 15:44:14,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17110 to 17090. [2025-02-05 15:44:14,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17090 states, 14217 states have (on average 1.5992122107336288) internal successors, (22736), 14224 states have internal predecessors, (22736), 2821 states have call successors, (2821), 46 states have call predecessors, (2821), 51 states have return successors, (3165), 2819 states have call predecessors, (3165), 2816 states have call successors, (3165) [2025-02-05 15:44:15,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17090 states to 17090 states and 28722 transitions. [2025-02-05 15:44:15,431 INFO L78 Accepts]: Start accepts. Automaton has 17090 states and 28722 transitions. Word has length 129 [2025-02-05 15:44:15,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:44:15,431 INFO L471 AbstractCegarLoop]: Abstraction has 17090 states and 28722 transitions. [2025-02-05 15:44:15,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-05 15:44:15,432 INFO L276 IsEmpty]: Start isEmpty. Operand 17090 states and 28722 transitions. [2025-02-05 15:44:15,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-02-05 15:44:15,499 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:44:15,499 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:44:15,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 15:44:15,499 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:44:15,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:44:15,499 INFO L85 PathProgramCache]: Analyzing trace with hash 637788463, now seen corresponding path program 1 times [2025-02-05 15:44:15,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:44:15,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931596117] [2025-02-05 15:44:15,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:44:15,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:44:15,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-02-05 15:44:15,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-02-05 15:44:15,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:44:15,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:44:15,629 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:44:15,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:44:15,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931596117] [2025-02-05 15:44:15,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931596117] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:44:15,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:44:15,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:44:15,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149843753] [2025-02-05 15:44:15,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:44:15,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:44:15,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:44:15,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:44:15,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:44:15,633 INFO L87 Difference]: Start difference. First operand 17090 states and 28722 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-05 15:44:16,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:44:16,926 INFO L93 Difference]: Finished difference Result 44928 states and 75909 transitions. [2025-02-05 15:44:16,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:44:16,927 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 130 [2025-02-05 15:44:16,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:44:17,495 INFO L225 Difference]: With dead ends: 44928 [2025-02-05 15:44:17,496 INFO L226 Difference]: Without dead ends: 30184 [2025-02-05 15:44:17,576 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:44:17,581 INFO L435 NwaCegarLoop]: 495 mSDtfsCounter, 98 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 984 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:44:17,581 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 984 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:44:17,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30184 states. [2025-02-05 15:44:19,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30184 to 30164. [2025-02-05 15:44:19,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30164 states, 25252 states have (on average 1.5972200221764612) internal successors, (40333), 25259 states have internal predecessors, (40333), 4860 states have call successors, (4860), 46 states have call predecessors, (4860), 51 states have return successors, (5478), 4858 states have call predecessors, (5478), 4855 states have call successors, (5478) [2025-02-05 15:44:19,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30164 states to 30164 states and 50671 transitions. [2025-02-05 15:44:19,886 INFO L78 Accepts]: Start accepts. Automaton has 30164 states and 50671 transitions. Word has length 130 [2025-02-05 15:44:19,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:44:19,886 INFO L471 AbstractCegarLoop]: Abstraction has 30164 states and 50671 transitions. [2025-02-05 15:44:19,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-05 15:44:19,887 INFO L276 IsEmpty]: Start isEmpty. Operand 30164 states and 50671 transitions. [2025-02-05 15:44:19,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-02-05 15:44:19,914 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:44:19,914 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:44:19,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 15:44:19,915 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:44:19,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:44:19,915 INFO L85 PathProgramCache]: Analyzing trace with hash 901889041, now seen corresponding path program 1 times [2025-02-05 15:44:19,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:44:19,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566876099] [2025-02-05 15:44:19,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:44:19,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:44:19,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-02-05 15:44:19,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-02-05 15:44:19,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:44:19,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:44:19,968 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:44:19,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:44:19,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566876099] [2025-02-05 15:44:19,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566876099] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:44:19,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:44:19,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:44:19,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405414375] [2025-02-05 15:44:19,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:44:19,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:44:19,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:44:19,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:44:19,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:44:19,970 INFO L87 Difference]: Start difference. First operand 30164 states and 50671 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-05 15:44:21,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:44:21,982 INFO L93 Difference]: Finished difference Result 81885 states and 138121 transitions. [2025-02-05 15:44:21,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:44:21,983 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 131 [2025-02-05 15:44:21,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:44:22,478 INFO L225 Difference]: With dead ends: 81885 [2025-02-05 15:44:22,479 INFO L226 Difference]: Without dead ends: 54870 [2025-02-05 15:44:22,930 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:44:22,930 INFO L435 NwaCegarLoop]: 498 mSDtfsCounter, 96 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 987 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:44:22,931 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 987 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:44:23,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54870 states. [2025-02-05 15:44:25,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54870 to 54850. [2025-02-05 15:44:25,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54850 states, 46223 states have (on average 1.593167903424702) internal successors, (73641), 46230 states have internal predecessors, (73641), 8575 states have call successors, (8575), 46 states have call predecessors, (8575), 51 states have return successors, (9725), 8573 states have call predecessors, (9725), 8570 states have call successors, (9725) [2025-02-05 15:44:25,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54850 states to 54850 states and 91941 transitions. [2025-02-05 15:44:26,025 INFO L78 Accepts]: Start accepts. Automaton has 54850 states and 91941 transitions. Word has length 131 [2025-02-05 15:44:26,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:44:26,025 INFO L471 AbstractCegarLoop]: Abstraction has 54850 states and 91941 transitions. [2025-02-05 15:44:26,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-05 15:44:26,025 INFO L276 IsEmpty]: Start isEmpty. Operand 54850 states and 91941 transitions. [2025-02-05 15:44:26,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-02-05 15:44:26,135 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:44:26,135 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:44:26,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 15:44:26,135 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:44:26,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:44:26,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1413235984, now seen corresponding path program 1 times [2025-02-05 15:44:26,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:44:26,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333564200] [2025-02-05 15:44:26,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:44:26,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:44:26,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-02-05 15:44:26,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-02-05 15:44:26,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:44:26,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:44:26,190 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:44:26,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:44:26,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333564200] [2025-02-05 15:44:26,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333564200] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:44:26,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:44:26,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:44:26,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508094483] [2025-02-05 15:44:26,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:44:26,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:44:26,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:44:26,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:44:26,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:44:26,191 INFO L87 Difference]: Start difference. First operand 54850 states and 91941 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-05 15:44:29,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:44:29,052 INFO L93 Difference]: Finished difference Result 102431 states and 172028 transitions. [2025-02-05 15:44:29,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:44:29,052 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 132 [2025-02-05 15:44:29,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:44:29,840 INFO L225 Difference]: With dead ends: 102431 [2025-02-05 15:44:29,841 INFO L226 Difference]: Without dead ends: 101911 [2025-02-05 15:44:29,872 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:44:29,874 INFO L435 NwaCegarLoop]: 504 mSDtfsCounter, 91 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 998 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:44:29,874 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 998 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:44:29,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101911 states. [2025-02-05 15:44:33,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101911 to 101891. [2025-02-05 15:44:33,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101891 states, 86465 states have (on average 1.5872202625339733) internal successors, (137239), 86472 states have internal predecessors, (137239), 15374 states have call successors, (15374), 46 states have call predecessors, (15374), 51 states have return successors, (17570), 15372 states have call predecessors, (17570), 15369 states have call successors, (17570) [2025-02-05 15:44:34,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101891 states to 101891 states and 170183 transitions. [2025-02-05 15:44:34,332 INFO L78 Accepts]: Start accepts. Automaton has 101891 states and 170183 transitions. Word has length 132 [2025-02-05 15:44:34,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:44:34,333 INFO L471 AbstractCegarLoop]: Abstraction has 101891 states and 170183 transitions. [2025-02-05 15:44:34,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-05 15:44:34,333 INFO L276 IsEmpty]: Start isEmpty. Operand 101891 states and 170183 transitions. [2025-02-05 15:44:34,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-02-05 15:44:34,373 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:44:34,373 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:44:34,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 15:44:34,374 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:44:34,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:44:34,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1936895504, now seen corresponding path program 1 times [2025-02-05 15:44:34,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:44:34,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918479750] [2025-02-05 15:44:34,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:44:34,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:44:34,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-02-05 15:44:34,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-02-05 15:44:34,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:44:34,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:44:34,583 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:44:34,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:44:34,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918479750] [2025-02-05 15:44:34,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918479750] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:44:34,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:44:34,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-05 15:44:34,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106591895] [2025-02-05 15:44:34,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:44:34,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 15:44:34,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:44:34,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 15:44:34,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-02-05 15:44:34,585 INFO L87 Difference]: Start difference. First operand 101891 states and 170183 transitions. Second operand has 11 states, 9 states have (on average 10.11111111111111) internal successors, (91), 10 states have internal predecessors, (91), 6 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (13), 4 states have call predecessors, (13), 5 states have call successors, (13) [2025-02-05 15:44:37,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:44:37,159 INFO L93 Difference]: Finished difference Result 102500 states and 171055 transitions. [2025-02-05 15:44:37,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 15:44:37,160 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 10.11111111111111) internal successors, (91), 10 states have internal predecessors, (91), 6 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (13), 4 states have call predecessors, (13), 5 states have call successors, (13) Word has length 133 [2025-02-05 15:44:37,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:44:38,395 INFO L225 Difference]: With dead ends: 102500 [2025-02-05 15:44:38,396 INFO L226 Difference]: Without dead ends: 101841 [2025-02-05 15:44:38,425 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2025-02-05 15:44:38,427 INFO L435 NwaCegarLoop]: 487 mSDtfsCounter, 136 mSDsluCounter, 4366 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 4853 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:44:38,429 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 4853 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:44:38,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101841 states. [2025-02-05 15:44:41,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101841 to 101833. [2025-02-05 15:44:41,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101833 states, 86421 states have (on average 1.5873340970366) internal successors, (137179), 86428 states have internal predecessors, (137179), 15364 states have call successors, (15364), 44 states have call predecessors, (15364), 47 states have return successors, (17559), 15360 states have call predecessors, (17559), 15360 states have call successors, (17559) [2025-02-05 15:44:42,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101833 states to 101833 states and 170102 transitions. [2025-02-05 15:44:42,252 INFO L78 Accepts]: Start accepts. Automaton has 101833 states and 170102 transitions. Word has length 133 [2025-02-05 15:44:42,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:44:42,253 INFO L471 AbstractCegarLoop]: Abstraction has 101833 states and 170102 transitions. [2025-02-05 15:44:42,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 10.11111111111111) internal successors, (91), 10 states have internal predecessors, (91), 6 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (13), 4 states have call predecessors, (13), 5 states have call successors, (13) [2025-02-05 15:44:42,253 INFO L276 IsEmpty]: Start isEmpty. Operand 101833 states and 170102 transitions. [2025-02-05 15:44:42,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-02-05 15:44:42,290 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:44:42,291 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:44:42,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-05 15:44:42,291 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:44:42,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:44:42,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1350347541, now seen corresponding path program 1 times [2025-02-05 15:44:42,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:44:42,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35614040] [2025-02-05 15:44:42,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:44:42,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:44:42,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-02-05 15:44:42,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-02-05 15:44:42,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:44:42,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:44:42,584 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-02-05 15:44:42,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:44:42,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35614040] [2025-02-05 15:44:42,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35614040] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:44:42,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [318557117] [2025-02-05 15:44:42,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:44:42,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:44:42,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:44:42,587 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:44:42,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-05 15:44:42,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-02-05 15:44:42,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-02-05 15:44:42,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:44:42,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:44:42,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 1121 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-02-05 15:44:42,833 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:44:43,343 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-05 15:44:43,343 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:44:43,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [318557117] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:44:43,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:44:43,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [16] total 27 [2025-02-05 15:44:43,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384142555] [2025-02-05 15:44:43,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:44:43,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 15:44:43,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:44:43,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 15:44:43,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=639, Unknown=0, NotChecked=0, Total=702 [2025-02-05 15:44:43,346 INFO L87 Difference]: Start difference. First operand 101833 states and 170102 transitions. Second operand has 13 states, 12 states have (on average 8.416666666666666) internal successors, (101), 11 states have internal predecessors, (101), 6 states have call successors, (16), 5 states have call predecessors, (16), 6 states have return successors, (13), 7 states have call predecessors, (13), 5 states have call successors, (13) [2025-02-05 15:44:47,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:44:47,093 INFO L93 Difference]: Finished difference Result 102569 states and 171136 transitions. [2025-02-05 15:44:47,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-05 15:44:47,093 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 8.416666666666666) internal successors, (101), 11 states have internal predecessors, (101), 6 states have call successors, (16), 5 states have call predecessors, (16), 6 states have return successors, (13), 7 states have call predecessors, (13), 5 states have call successors, (13) Word has length 136 [2025-02-05 15:44:47,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:44:47,397 INFO L225 Difference]: With dead ends: 102569 [2025-02-05 15:44:47,397 INFO L226 Difference]: Without dead ends: 102375 [2025-02-05 15:44:47,447 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=181, Invalid=1541, Unknown=0, NotChecked=0, Total=1722 [2025-02-05 15:44:47,450 INFO L435 NwaCegarLoop]: 558 mSDtfsCounter, 773 mSDsluCounter, 5026 mSDsCounter, 0 mSdLazyCounter, 518 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 779 SdHoareTripleChecker+Valid, 5584 SdHoareTripleChecker+Invalid, 628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 15:44:47,450 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [779 Valid, 5584 Invalid, 628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 518 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 15:44:47,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102375 states. [2025-02-05 15:44:51,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102375 to 102301. [2025-02-05 15:44:51,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102301 states, 86783 states have (on average 1.5866471543965983) internal successors, (137694), 86801 states have internal predecessors, (137694), 15429 states have call successors, (15429), 75 states have call predecessors, (15429), 88 states have return successors, (17645), 15424 states have call predecessors, (17645), 15423 states have call successors, (17645) [2025-02-05 15:44:51,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102301 states to 102301 states and 170768 transitions. [2025-02-05 15:44:51,766 INFO L78 Accepts]: Start accepts. Automaton has 102301 states and 170768 transitions. Word has length 136 [2025-02-05 15:44:51,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:44:51,768 INFO L471 AbstractCegarLoop]: Abstraction has 102301 states and 170768 transitions. [2025-02-05 15:44:51,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 8.416666666666666) internal successors, (101), 11 states have internal predecessors, (101), 6 states have call successors, (16), 5 states have call predecessors, (16), 6 states have return successors, (13), 7 states have call predecessors, (13), 5 states have call successors, (13) [2025-02-05 15:44:51,768 INFO L276 IsEmpty]: Start isEmpty. Operand 102301 states and 170768 transitions.