./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec3_product17.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_product17.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 ece4fa184f09e2184919c279a0198f8db6972fb16f8b142297bd588b2043b23f --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 15:43:43,761 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 15:43:43,822 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:43,831 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 15:43:43,832 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 15:43:43,856 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 15:43:43,857 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 15:43:43,857 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 15:43:43,857 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 15:43:43,857 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 15:43:43,857 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 15:43:43,858 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 15:43:43,858 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 15:43:43,858 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 15:43:43,859 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 15:43:43,859 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 15:43:43,859 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 15:43:43,859 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 15:43:43,859 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 15:43:43,859 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 15:43:43,859 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 15:43:43,859 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 15:43:43,859 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 15:43:43,859 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 15:43:43,859 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 15:43:43,859 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 15:43:43,860 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 15:43:43,860 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 15:43:43,860 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 15:43:43,860 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 15:43:43,860 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 15:43:43,860 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 15:43:43,860 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:43:43,860 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 15:43:43,860 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 15:43:43,860 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 15:43:43,860 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 15:43:43,861 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 15:43:43,861 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 15:43:43,861 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 15:43:43,861 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 15:43:43,861 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 15:43:43,861 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 15:43:43,861 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 -> ece4fa184f09e2184919c279a0198f8db6972fb16f8b142297bd588b2043b23f [2025-02-05 15:43:44,148 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 15:43:44,158 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 15:43:44,160 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 15:43:44,161 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 15:43:44,161 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 15:43:44,163 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec3_product17.cil.c [2025-02-05 15:43:45,548 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d21bdb9cf/da9fb52605754d0bad359aafefe7cb13/FLAG9754f110f [2025-02-05 15:43:45,953 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 15:43:45,954 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec3_product17.cil.c [2025-02-05 15:43:45,976 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d21bdb9cf/da9fb52605754d0bad359aafefe7cb13/FLAG9754f110f [2025-02-05 15:43:45,988 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d21bdb9cf/da9fb52605754d0bad359aafefe7cb13 [2025-02-05 15:43:45,990 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 15:43:45,991 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 15:43:45,992 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 15:43:45,993 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 15:43:45,997 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 15:43:45,998 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:43:45" (1/1) ... [2025-02-05 15:43:45,998 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79c7fe49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:43:45, skipping insertion in model container [2025-02-05 15:43:45,999 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:43:45" (1/1) ... [2025-02-05 15:43:46,048 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 15:43:46,642 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_product17.cil.c[63718,63731] [2025-02-05 15:43:46,646 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:43:46,668 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 15:43:46,676 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [48] [2025-02-05 15:43:46,678 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [368] [2025-02-05 15:43:46,678 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [403] [2025-02-05 15:43:46,678 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [769] [2025-02-05 15:43:46,678 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [985] [2025-02-05 15:43:46,678 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [1304] [2025-02-05 15:43:46,679 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"SignVerify_spec.i","") [1321] [2025-02-05 15:43:46,679 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [1380] [2025-02-05 15:43:46,679 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [2444] [2025-02-05 15:43:46,679 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [2543] [2025-02-05 15:43:46,679 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [2944] [2025-02-05 15:43:46,792 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_product17.cil.c[63718,63731] [2025-02-05 15:43:46,792 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:43:46,832 INFO L204 MainTranslator]: Completed translation [2025-02-05 15:43:46,833 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:43:46 WrapperNode [2025-02-05 15:43:46,834 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 15:43:46,836 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 15:43:46,836 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 15:43:46,837 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 15:43:46,844 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:46" (1/1) ... [2025-02-05 15:43:46,877 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:46" (1/1) ... [2025-02-05 15:43:46,938 INFO L138 Inliner]: procedures = 128, calls = 199, calls flagged for inlining = 52, calls inlined = 45, statements flattened = 891 [2025-02-05 15:43:46,938 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 15:43:46,939 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 15:43:46,939 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 15:43:46,939 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 15:43:46,954 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:46" (1/1) ... [2025-02-05 15:43:46,955 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:46" (1/1) ... [2025-02-05 15:43:46,961 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:46" (1/1) ... [2025-02-05 15:43:47,004 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:47,004 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:46" (1/1) ... [2025-02-05 15:43:47,004 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:46" (1/1) ... [2025-02-05 15:43:47,028 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:46" (1/1) ... [2025-02-05 15:43:47,038 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:46" (1/1) ... [2025-02-05 15:43:47,045 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:46" (1/1) ... [2025-02-05 15:43:47,051 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:46" (1/1) ... [2025-02-05 15:43:47,057 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 15:43:47,058 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 15:43:47,058 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 15:43:47,058 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 15:43:47,059 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:43:46" (1/1) ... [2025-02-05 15:43:47,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:43:47,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:43:47,093 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:47,098 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:47,123 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2025-02-05 15:43:47,123 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2025-02-05 15:43:47,123 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2025-02-05 15:43:47,124 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2025-02-05 15:43:47,124 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2025-02-05 15:43:47,124 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2025-02-05 15:43:47,124 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-02-05 15:43:47,124 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-02-05 15:43:47,124 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-02-05 15:43:47,124 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-02-05 15:43:47,125 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2025-02-05 15:43:47,125 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2025-02-05 15:43:47,125 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-02-05 15:43:47,125 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-02-05 15:43:47,125 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2025-02-05 15:43:47,125 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2025-02-05 15:43:47,125 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-02-05 15:43:47,125 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-02-05 15:43:47,126 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-02-05 15:43:47,126 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-02-05 15:43:47,126 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-02-05 15:43:47,127 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-02-05 15:43:47,127 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 15:43:47,127 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2025-02-05 15:43:47,127 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2025-02-05 15:43:47,127 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2025-02-05 15:43:47,127 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2025-02-05 15:43:47,127 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2025-02-05 15:43:47,127 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2025-02-05 15:43:47,127 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-02-05 15:43:47,127 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-02-05 15:43:47,127 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2025-02-05 15:43:47,127 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2025-02-05 15:43:47,127 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-02-05 15:43:47,127 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-02-05 15:43:47,127 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-02-05 15:43:47,127 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-02-05 15:43:47,127 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2025-02-05 15:43:47,127 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2025-02-05 15:43:47,127 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-02-05 15:43:47,127 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-02-05 15:43:47,127 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-02-05 15:43:47,127 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-02-05 15:43:47,127 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-02-05 15:43:47,127 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-02-05 15:43:47,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 15:43:47,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-05 15:43:47,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-05 15:43:47,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-05 15:43:47,128 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-02-05 15:43:47,128 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-02-05 15:43:47,128 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2025-02-05 15:43:47,128 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2025-02-05 15:43:47,128 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 15:43:47,128 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 15:43:47,336 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 15:43:47,338 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 15:43:47,458 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1986-1: getClientPrivateKey_#res#1 := getClientPrivateKey_~retValue_acc~21#1; [2025-02-05 15:43:47,473 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2851: #res := ~retValue_acc~40; [2025-02-05 15:43:47,483 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1209: #res := ~retValue_acc~10; [2025-02-05 15:43:47,545 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2078: #res#1 := ~retValue_acc~23#1; [2025-02-05 15:43:47,546 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2033-1: getClientKeyringSize_#res#1 := getClientKeyringSize_~retValue_acc~22#1; [2025-02-05 15:43:47,580 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2302: #res := ~retValue_acc~26; [2025-02-05 15:43:47,591 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2540-1: createEmail_#res#1 := createEmail_~retValue_acc~31#1; [2025-02-05 15:43:47,600 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1530: #res := ~retValue_acc~15; [2025-02-05 15:43:47,736 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2421-1: getClientId_#res#1 := getClientId_~retValue_acc~28#1; [2025-02-05 15:43:47,742 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2888: #res := ~retValue_acc~41; [2025-02-05 15:43:47,768 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2662: #res := ~retValue_acc~35; [2025-02-05 15:43:47,829 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1856: #res := ~retValue_acc~19; [2025-02-05 15:43:48,113 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2141-1: getClientKeyringUser_#res#1 := getClientKeyringUser_~retValue_acc~24#1; [2025-02-05 15:43:48,113 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1175-1: get_queued_client_#res#1 := get_queued_client_~retValue_acc~8#1; [2025-02-05 15:43:48,113 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1184-1: get_queued_email_#res#1 := get_queued_email_~retValue_acc~9#1; [2025-02-05 15:43:48,113 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L400-1: valid_product_#res#1 := valid_product_~retValue_acc~2#1; [2025-02-05 15:43:48,113 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1166-1: is_queue_empty_#res#1 := is_queue_empty_~retValue_acc~7#1; [2025-02-05 15:43:48,113 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2248-1: getClientKeyringPublicKey_#res#1 := getClientKeyringPublicKey_~retValue_acc~25#1; [2025-02-05 15:43:48,118 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2625: #res := ~retValue_acc~34; [2025-02-05 15:43:48,120 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2516: #res := ~retValue_acc~29; [2025-02-05 15:43:48,255 INFO L? ?]: Removed 466 outVars from TransFormulas that were not future-live. [2025-02-05 15:43:48,255 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 15:43:48,286 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 15:43:48,286 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 15:43:48,287 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:43:48 BoogieIcfgContainer [2025-02-05 15:43:48,287 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 15:43:48,290 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 15:43:48,290 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 15:43:48,294 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 15:43:48,295 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 03:43:45" (1/3) ... [2025-02-05 15:43:48,295 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70ae4c08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:43:48, skipping insertion in model container [2025-02-05 15:43:48,296 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:43:46" (2/3) ... [2025-02-05 15:43:48,298 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70ae4c08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:43:48, skipping insertion in model container [2025-02-05 15:43:48,298 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:43:48" (3/3) ... [2025-02-05 15:43:48,299 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec3_product17.cil.c [2025-02-05 15:43:48,314 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 15:43:48,318 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec3_product17.cil.c that has 25 procedures, 366 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 15:43:48,406 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 15:43:48,419 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;@7dabe9f4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 15:43:48,419 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 15:43:48,424 INFO L276 IsEmpty]: Start isEmpty. Operand has 366 states, 284 states have (on average 1.5704225352112675) internal successors, (446), 289 states have internal predecessors, (446), 56 states have call successors, (56), 24 states have call predecessors, (56), 24 states have return successors, (56), 54 states have call predecessors, (56), 56 states have call successors, (56) [2025-02-05 15:43:48,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-02-05 15:43:48,439 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:43:48,440 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:43:48,440 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:43:48,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:43:48,445 INFO L85 PathProgramCache]: Analyzing trace with hash 386824931, now seen corresponding path program 1 times [2025-02-05 15:43:48,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:43:48,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883625964] [2025-02-05 15:43:48,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:43:48,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:43:48,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-05 15:43:48,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-05 15:43:48,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:43:48,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:43:49,150 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:43:49,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:43:49,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883625964] [2025-02-05 15:43:49,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883625964] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:43:49,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2145669708] [2025-02-05 15:43:49,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:43:49,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:43:49,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:43:49,156 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:43:49,157 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:43:49,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-05 15:43:49,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-05 15:43:49,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:43:49,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:43:49,499 INFO L256 TraceCheckSpWp]: Trace formula consists of 1049 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 15:43:49,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:43:49,534 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:43:49,537 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:43:49,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2145669708] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:43:49,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:43:49,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 5 [2025-02-05 15:43:49,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146626393] [2025-02-05 15:43:49,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:43:49,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 15:43:49,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:43:49,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 15:43:49,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:43:49,569 INFO L87 Difference]: Start difference. First operand has 366 states, 284 states have (on average 1.5704225352112675) internal successors, (446), 289 states have internal predecessors, (446), 56 states have call successors, (56), 24 states have call predecessors, (56), 24 states have return successors, (56), 54 states have call predecessors, (56), 56 states have call successors, (56) Second operand has 2 states, 2 states have (on average 32.5) internal successors, (65), 2 states have internal predecessors, (65), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:43:49,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:43:49,631 INFO L93 Difference]: Finished difference Result 544 states and 816 transitions. [2025-02-05 15:43:49,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 15:43:49,635 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 32.5) internal successors, (65), 2 states have internal predecessors, (65), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 112 [2025-02-05 15:43:49,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:43:49,649 INFO L225 Difference]: With dead ends: 544 [2025-02-05 15:43:49,650 INFO L226 Difference]: Without dead ends: 358 [2025-02-05 15:43:49,655 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 113 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:43:49,658 INFO L435 NwaCegarLoop]: 553 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, 553 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:43:49,658 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 553 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:43:49,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2025-02-05 15:43:49,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 358. [2025-02-05 15:43:49,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 278 states have (on average 1.5683453237410072) internal successors, (436), 281 states have internal predecessors, (436), 56 states have call successors, (56), 24 states have call predecessors, (56), 23 states have return successors, (53), 52 states have call predecessors, (53), 53 states have call successors, (53) [2025-02-05 15:43:49,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 545 transitions. [2025-02-05 15:43:49,714 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 545 transitions. Word has length 112 [2025-02-05 15:43:49,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:43:49,715 INFO L471 AbstractCegarLoop]: Abstraction has 358 states and 545 transitions. [2025-02-05 15:43:49,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 32.5) internal successors, (65), 2 states have internal predecessors, (65), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:43:49,716 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 545 transitions. [2025-02-05 15:43:49,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-02-05 15:43:49,720 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:43:49,720 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:43:49,729 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:43:49,921 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:43:49,922 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:43:49,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:43:49,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1443405515, now seen corresponding path program 1 times [2025-02-05 15:43:49,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:43:49,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615875593] [2025-02-05 15:43:49,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:43:49,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:43:49,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-02-05 15:43:49,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-02-05 15:43:49,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:43:49,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:43:50,230 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:43:50,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:43:50,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615875593] [2025-02-05 15:43:50,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615875593] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:43:50,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1822695367] [2025-02-05 15:43:50,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:43:50,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:43:50,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:43:50,233 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:43:50,236 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:43:50,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-02-05 15:43:50,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-02-05 15:43:50,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:43:50,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:43:50,575 INFO L256 TraceCheckSpWp]: Trace formula consists of 1050 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 15:43:50,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:43:50,615 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:43:50,615 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:43:50,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1822695367] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:43:50,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:43:50,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-02-05 15:43:50,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813620725] [2025-02-05 15:43:50,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:43:50,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:43:50,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:43:50,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:43:50,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:43:50,620 INFO L87 Difference]: Start difference. First operand 358 states and 545 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:43:50,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:43:50,673 INFO L93 Difference]: Finished difference Result 532 states and 790 transitions. [2025-02-05 15:43:50,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:43:50,674 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 113 [2025-02-05 15:43:50,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:43:50,679 INFO L225 Difference]: With dead ends: 532 [2025-02-05 15:43:50,680 INFO L226 Difference]: Without dead ends: 360 [2025-02-05 15:43:50,681 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 113 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:43:50,682 INFO L435 NwaCegarLoop]: 544 mSDtfsCounter, 0 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1086 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:43:50,682 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1086 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:43:50,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2025-02-05 15:43:50,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 360. [2025-02-05 15:43:50,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 280 states have (on average 1.5642857142857143) internal successors, (438), 283 states have internal predecessors, (438), 56 states have call successors, (56), 24 states have call predecessors, (56), 23 states have return successors, (53), 52 states have call predecessors, (53), 53 states have call successors, (53) [2025-02-05 15:43:50,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 547 transitions. [2025-02-05 15:43:50,712 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 547 transitions. Word has length 113 [2025-02-05 15:43:50,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:43:50,712 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 547 transitions. [2025-02-05 15:43:50,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:43:50,712 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 547 transitions. [2025-02-05 15:43:50,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-02-05 15:43:50,715 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:43:50,715 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:43:50,726 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-05 15:43:50,916 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:43:50,916 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:43:50,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:43:50,917 INFO L85 PathProgramCache]: Analyzing trace with hash -290501115, now seen corresponding path program 1 times [2025-02-05 15:43:50,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:43:50,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257119833] [2025-02-05 15:43:50,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:43:50,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:43:50,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-02-05 15:43:50,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-02-05 15:43:50,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:43:50,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:43:51,201 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-02-05 15:43:51,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:43:51,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257119833] [2025-02-05 15:43:51,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257119833] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:43:51,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [232098070] [2025-02-05 15:43:51,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:43:51,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:43:51,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:43:51,208 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:43:51,210 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:43:51,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-02-05 15:43:51,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-02-05 15:43:51,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:43:51,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:43:51,562 INFO L256 TraceCheckSpWp]: Trace formula consists of 1140 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 15:43:51,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:43:51,598 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-02-05 15:43:51,599 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:43:51,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [232098070] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:43:51,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:43:51,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-02-05 15:43:51,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028921096] [2025-02-05 15:43:51,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:43:51,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:43:51,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:43:51,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:43:51,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:43:51,602 INFO L87 Difference]: Start difference. First operand 360 states and 547 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-05 15:43:51,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:43:51,661 INFO L93 Difference]: Finished difference Result 762 states and 1177 transitions. [2025-02-05 15:43:51,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:43:51,661 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 137 [2025-02-05 15:43:51,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:43:51,667 INFO L225 Difference]: With dead ends: 762 [2025-02-05 15:43:51,667 INFO L226 Difference]: Without dead ends: 429 [2025-02-05 15:43:51,670 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 137 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:43:51,674 INFO L435 NwaCegarLoop]: 556 mSDtfsCounter, 126 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 1053 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:43:51,675 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 1053 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:43:51,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2025-02-05 15:43:51,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 421. [2025-02-05 15:43:51,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 327 states have (on average 1.584097859327217) internal successors, (518), 330 states have internal predecessors, (518), 70 states have call successors, (70), 24 states have call predecessors, (70), 23 states have return successors, (67), 66 states have call predecessors, (67), 67 states have call successors, (67) [2025-02-05 15:43:51,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 655 transitions. [2025-02-05 15:43:51,718 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 655 transitions. Word has length 137 [2025-02-05 15:43:51,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:43:51,722 INFO L471 AbstractCegarLoop]: Abstraction has 421 states and 655 transitions. [2025-02-05 15:43:51,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-05 15:43:51,722 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 655 transitions. [2025-02-05 15:43:51,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-02-05 15:43:51,728 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:43:51,728 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, 1, 1, 1, 1, 1, 1] [2025-02-05 15:43:51,739 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:43:51,936 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:43:51,936 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:43:51,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:43:51,937 INFO L85 PathProgramCache]: Analyzing trace with hash -935574810, now seen corresponding path program 1 times [2025-02-05 15:43:51,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:43:51,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299954020] [2025-02-05 15:43:51,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:43:51,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:43:51,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-05 15:43:51,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-05 15:43:51,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:43:51,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:43:52,170 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:43:52,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:43:52,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299954020] [2025-02-05 15:43:52,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299954020] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:43:52,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2094001546] [2025-02-05 15:43:52,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:43:52,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:43:52,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:43:52,173 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:43:52,176 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:43:52,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-05 15:43:52,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-05 15:43:52,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:43:52,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:43:52,480 INFO L256 TraceCheckSpWp]: Trace formula consists of 1067 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-05 15:43:52,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:43:52,544 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:43:52,547 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:43:52,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2094001546] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:43:52,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:43:52,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-02-05 15:43:52,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570800827] [2025-02-05 15:43:52,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:43:52,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:43:52,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:43:52,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:43:52,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:43:52,550 INFO L87 Difference]: Start difference. First operand 421 states and 655 transitions. Second operand has 5 states, 4 states have (on average 20.0) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-02-05 15:43:52,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:43:52,624 INFO L93 Difference]: Finished difference Result 833 states and 1300 transitions. [2025-02-05 15:43:52,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:43:52,626 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.0) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) Word has length 119 [2025-02-05 15:43:52,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:43:52,630 INFO L225 Difference]: With dead ends: 833 [2025-02-05 15:43:52,630 INFO L226 Difference]: Without dead ends: 423 [2025-02-05 15:43:52,632 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 117 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:43:52,633 INFO L435 NwaCegarLoop]: 537 mSDtfsCounter, 2 mSDsluCounter, 1600 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2137 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:43:52,633 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2137 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:43:52,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2025-02-05 15:43:52,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 423. [2025-02-05 15:43:52,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 328 states have (on average 1.5823170731707317) internal successors, (519), 332 states have internal predecessors, (519), 70 states have call successors, (70), 24 states have call predecessors, (70), 24 states have return successors, (69), 66 states have call predecessors, (69), 67 states have call successors, (69) [2025-02-05 15:43:52,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 658 transitions. [2025-02-05 15:43:52,665 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 658 transitions. Word has length 119 [2025-02-05 15:43:52,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:43:52,665 INFO L471 AbstractCegarLoop]: Abstraction has 423 states and 658 transitions. [2025-02-05 15:43:52,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.0) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-02-05 15:43:52,666 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 658 transitions. [2025-02-05 15:43:52,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-02-05 15:43:52,669 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:43:52,669 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, 1, 1, 1, 1, 1, 1] [2025-02-05 15:43:52,679 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-05 15:43:52,869 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:43:52,870 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:43:52,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:43:52,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1661480275, now seen corresponding path program 1 times [2025-02-05 15:43:52,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:43:52,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955646776] [2025-02-05 15:43:52,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:43:52,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:43:52,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-02-05 15:43:52,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-02-05 15:43:52,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:43:52,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:43:53,056 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:43:53,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:43:53,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955646776] [2025-02-05 15:43:53,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955646776] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:43:53,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1859035592] [2025-02-05 15:43:53,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:43:53,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:43:53,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:43:53,061 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:43:53,062 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:43:53,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-02-05 15:43:53,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-02-05 15:43:53,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:43:53,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:43:53,382 INFO L256 TraceCheckSpWp]: Trace formula consists of 1068 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 15:43:53,386 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:43:53,447 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:43:53,447 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:43:53,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1859035592] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:43:53,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:43:53,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-02-05 15:43:53,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709056115] [2025-02-05 15:43:53,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:43:53,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:43:53,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:43:53,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:43:53,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-02-05 15:43:53,449 INFO L87 Difference]: Start difference. First operand 423 states and 658 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-02-05 15:43:53,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:43:53,564 INFO L93 Difference]: Finished difference Result 835 states and 1305 transitions. [2025-02-05 15:43:53,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:43:53,565 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 120 [2025-02-05 15:43:53,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:43:53,570 INFO L225 Difference]: With dead ends: 835 [2025-02-05 15:43:53,570 INFO L226 Difference]: Without dead ends: 425 [2025-02-05 15:43:53,572 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 118 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:43:53,573 INFO L435 NwaCegarLoop]: 535 mSDtfsCounter, 2 mSDsluCounter, 1588 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2123 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:43:53,574 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2123 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:43:53,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2025-02-05 15:43:53,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 425. [2025-02-05 15:43:53,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 329 states have (on average 1.580547112462006) internal successors, (520), 334 states have internal predecessors, (520), 70 states have call successors, (70), 24 states have call predecessors, (70), 25 states have return successors, (74), 66 states have call predecessors, (74), 67 states have call successors, (74) [2025-02-05 15:43:53,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 664 transitions. [2025-02-05 15:43:53,602 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 664 transitions. Word has length 120 [2025-02-05 15:43:53,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:43:53,602 INFO L471 AbstractCegarLoop]: Abstraction has 425 states and 664 transitions. [2025-02-05 15:43:53,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-02-05 15:43:53,603 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 664 transitions. [2025-02-05 15:43:53,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-02-05 15:43:53,607 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:43:53,607 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, 1] [2025-02-05 15:43:53,617 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-05 15:43:53,807 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:43:53,808 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:43:53,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:43:53,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1066910746, now seen corresponding path program 1 times [2025-02-05 15:43:53,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:43:53,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050876598] [2025-02-05 15:43:53,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:43:53,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:43:53,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-02-05 15:43:53,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-02-05 15:43:53,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:43:53,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:43:53,981 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:43:53,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:43:53,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050876598] [2025-02-05 15:43:53,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050876598] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:43:53,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:43:53,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:43:53,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844331986] [2025-02-05 15:43:53,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:43:53,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:43:53,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:43:53,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:43:53,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:43:53,984 INFO L87 Difference]: Start difference. First operand 425 states and 664 transitions. Second operand has 5 states, 4 states have (on average 19.5) internal successors, (78), 5 states have internal predecessors, (78), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-02-05 15:43:54,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:43:54,039 INFO L93 Difference]: Finished difference Result 827 states and 1296 transitions. [2025-02-05 15:43:54,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:43:54,039 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.5) internal successors, (78), 5 states have internal predecessors, (78), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) Word has length 121 [2025-02-05 15:43:54,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:43:54,044 INFO L225 Difference]: With dead ends: 827 [2025-02-05 15:43:54,045 INFO L226 Difference]: Without dead ends: 425 [2025-02-05 15:43:54,046 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:43:54,047 INFO L435 NwaCegarLoop]: 538 mSDtfsCounter, 2 mSDsluCounter, 1603 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2141 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:43:54,047 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2141 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:43:54,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2025-02-05 15:43:54,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 425. [2025-02-05 15:43:54,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 329 states have (on average 1.580547112462006) internal successors, (520), 334 states have internal predecessors, (520), 70 states have call successors, (70), 24 states have call predecessors, (70), 25 states have return successors, (73), 66 states have call predecessors, (73), 67 states have call successors, (73) [2025-02-05 15:43:54,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 663 transitions. [2025-02-05 15:43:54,078 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 663 transitions. Word has length 121 [2025-02-05 15:43:54,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:43:54,078 INFO L471 AbstractCegarLoop]: Abstraction has 425 states and 663 transitions. [2025-02-05 15:43:54,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.5) internal successors, (78), 5 states have internal predecessors, (78), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-02-05 15:43:54,078 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 663 transitions. [2025-02-05 15:43:54,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-02-05 15:43:54,082 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:43:54,083 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, 1, 1, 1] [2025-02-05 15:43:54,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 15:43:54,083 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:43:54,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:43:54,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1822107945, now seen corresponding path program 2 times [2025-02-05 15:43:54,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:43:54,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884594839] [2025-02-05 15:43:54,085 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 15:43:54,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:43:54,108 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 122 statements into 2 equivalence classes. [2025-02-05 15:43:54,122 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 122 of 122 statements. [2025-02-05 15:43:54,123 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 15:43:54,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:43:54,228 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:43:54,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:43:54,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884594839] [2025-02-05 15:43:54,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884594839] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:43:54,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:43:54,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:43:54,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159168706] [2025-02-05 15:43:54,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:43:54,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:43:54,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:43:54,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:43:54,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:43:54,231 INFO L87 Difference]: Start difference. First operand 425 states and 663 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-02-05 15:43:54,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:43:54,293 INFO L93 Difference]: Finished difference Result 825 states and 1291 transitions. [2025-02-05 15:43:54,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:43:54,294 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 122 [2025-02-05 15:43:54,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:43:54,299 INFO L225 Difference]: With dead ends: 825 [2025-02-05 15:43:54,299 INFO L226 Difference]: Without dead ends: 425 [2025-02-05 15:43:54,301 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:43:54,301 INFO L435 NwaCegarLoop]: 536 mSDtfsCounter, 2 mSDsluCounter, 1591 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2127 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:43:54,302 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2127 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:43:54,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2025-02-05 15:43:54,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 425. [2025-02-05 15:43:54,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 329 states have (on average 1.580547112462006) internal successors, (520), 334 states have internal predecessors, (520), 70 states have call successors, (70), 24 states have call predecessors, (70), 25 states have return successors, (72), 66 states have call predecessors, (72), 67 states have call successors, (72) [2025-02-05 15:43:54,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 662 transitions. [2025-02-05 15:43:54,329 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 662 transitions. Word has length 122 [2025-02-05 15:43:54,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:43:54,330 INFO L471 AbstractCegarLoop]: Abstraction has 425 states and 662 transitions. [2025-02-05 15:43:54,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-02-05 15:43:54,330 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 662 transitions. [2025-02-05 15:43:54,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-02-05 15:43:54,333 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:43:54,333 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:43:54,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 15:43:54,333 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:43:54,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:43:54,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1357481899, now seen corresponding path program 1 times [2025-02-05 15:43:54,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:43:54,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684305535] [2025-02-05 15:43:54,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:43:54,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:43:54,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-02-05 15:43:54,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-02-05 15:43:54,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:43:54,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:43:54,510 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-02-05 15:43:54,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:43:54,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684305535] [2025-02-05 15:43:54,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684305535] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:43:54,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:43:54,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:43:54,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103095848] [2025-02-05 15:43:54,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:43:54,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:43:54,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:43:54,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:43:54,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:43:54,512 INFO L87 Difference]: Start difference. First operand 425 states and 662 transitions. Second operand has 5 states, 4 states have (on average 21.5) internal successors, (86), 5 states have internal predecessors, (86), 3 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2025-02-05 15:43:54,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:43:54,558 INFO L93 Difference]: Finished difference Result 829 states and 1297 transitions. [2025-02-05 15:43:54,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:43:54,558 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.5) internal successors, (86), 5 states have internal predecessors, (86), 3 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) Word has length 142 [2025-02-05 15:43:54,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:43:54,561 INFO L225 Difference]: With dead ends: 829 [2025-02-05 15:43:54,562 INFO L226 Difference]: Without dead ends: 427 [2025-02-05 15:43:54,563 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:43:54,563 INFO L435 NwaCegarLoop]: 539 mSDtfsCounter, 1 mSDsluCounter, 1605 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2144 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:43:54,564 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2144 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:43:54,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2025-02-05 15:43:54,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 427. [2025-02-05 15:43:54,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 330 states have (on average 1.5787878787878789) internal successors, (521), 336 states have internal predecessors, (521), 70 states have call successors, (70), 24 states have call predecessors, (70), 26 states have return successors, (74), 66 states have call predecessors, (74), 67 states have call successors, (74) [2025-02-05 15:43:54,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 665 transitions. [2025-02-05 15:43:54,586 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 665 transitions. Word has length 142 [2025-02-05 15:43:54,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:43:54,586 INFO L471 AbstractCegarLoop]: Abstraction has 427 states and 665 transitions. [2025-02-05 15:43:54,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.5) internal successors, (86), 5 states have internal predecessors, (86), 3 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2025-02-05 15:43:54,587 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 665 transitions. [2025-02-05 15:43:54,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-02-05 15:43:54,589 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:43:54,589 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, 1, 1, 1, 1, 1] [2025-02-05 15:43:54,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 15:43:54,590 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:43:54,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:43:54,590 INFO L85 PathProgramCache]: Analyzing trace with hash 958300158, now seen corresponding path program 1 times [2025-02-05 15:43:54,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:43:54,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224306975] [2025-02-05 15:43:54,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:43:54,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:43:54,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-05 15:43:54,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-05 15:43:54,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:43:54,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:43:54,746 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:43:54,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:43:54,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224306975] [2025-02-05 15:43:54,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224306975] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:43:54,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:43:54,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 15:43:54,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004487366] [2025-02-05 15:43:54,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:43:54,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 15:43:54,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:43:54,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 15:43:54,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:43:54,748 INFO L87 Difference]: Start difference. First operand 427 states and 665 transitions. Second operand has 8 states, 7 states have (on average 12.0) internal successors, (84), 8 states have internal predecessors, (84), 4 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-02-05 15:43:54,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:43:54,901 INFO L93 Difference]: Finished difference Result 834 states and 1306 transitions. [2025-02-05 15:43:54,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 15:43:54,902 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 12.0) internal successors, (84), 8 states have internal predecessors, (84), 4 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) Word has length 124 [2025-02-05 15:43:54,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:43:54,905 INFO L225 Difference]: With dead ends: 834 [2025-02-05 15:43:54,906 INFO L226 Difference]: Without dead ends: 432 [2025-02-05 15:43:54,907 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:43:54,908 INFO L435 NwaCegarLoop]: 531 mSDtfsCounter, 5 mSDsluCounter, 3157 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 3688 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.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:43:54,908 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 3688 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:43:54,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2025-02-05 15:43:54,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 432. [2025-02-05 15:43:54,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 334 states have (on average 1.5748502994011977) internal successors, (526), 340 states have internal predecessors, (526), 70 states have call successors, (70), 25 states have call predecessors, (70), 27 states have return successors, (79), 66 states have call predecessors, (79), 67 states have call successors, (79) [2025-02-05 15:43:54,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 675 transitions. [2025-02-05 15:43:54,927 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 675 transitions. Word has length 124 [2025-02-05 15:43:54,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:43:54,927 INFO L471 AbstractCegarLoop]: Abstraction has 432 states and 675 transitions. [2025-02-05 15:43:54,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 12.0) internal successors, (84), 8 states have internal predecessors, (84), 4 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-02-05 15:43:54,927 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 675 transitions. [2025-02-05 15:43:54,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-02-05 15:43:54,930 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:43:54,930 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, 1, 1, 1, 1, 1] [2025-02-05 15:43:54,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 15:43:54,930 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:43:54,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:43:54,931 INFO L85 PathProgramCache]: Analyzing trace with hash -166552736, now seen corresponding path program 1 times [2025-02-05 15:43:54,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:43:54,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368147134] [2025-02-05 15:43:54,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:43:54,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:43:54,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-05 15:43:54,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-05 15:43:54,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:43:54,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:43:55,075 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:43:55,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:43:55,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368147134] [2025-02-05 15:43:55,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368147134] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:43:55,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1821676723] [2025-02-05 15:43:55,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:43:55,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:43:55,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:43:55,079 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:43:55,081 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:43:55,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-05 15:43:55,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-05 15:43:55,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:43:55,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:43:55,369 INFO L256 TraceCheckSpWp]: Trace formula consists of 1073 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 15:43:55,373 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:43:55,402 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:43:55,403 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:43:55,494 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:43:55,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1821676723] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:43:55,495 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:43:55,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-05 15:43:55,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707671452] [2025-02-05 15:43:55,495 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:43:55,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 15:43:55,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:43:55,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 15:43:55,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:43:55,496 INFO L87 Difference]: Start difference. First operand 432 states and 675 transitions. Second operand has 7 states, 7 states have (on average 16.285714285714285) internal successors, (114), 7 states have internal predecessors, (114), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-02-05 15:43:55,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:43:55,678 INFO L93 Difference]: Finished difference Result 1016 states and 1646 transitions. [2025-02-05 15:43:55,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:43:55,679 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.285714285714285) internal successors, (114), 7 states have internal predecessors, (114), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 125 [2025-02-05 15:43:55,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:43:55,685 INFO L225 Difference]: With dead ends: 1016 [2025-02-05 15:43:55,685 INFO L226 Difference]: Without dead ends: 844 [2025-02-05 15:43:55,686 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:43:55,687 INFO L435 NwaCegarLoop]: 579 mSDtfsCounter, 677 mSDsluCounter, 1488 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 731 SdHoareTripleChecker+Valid, 2067 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:43:55,687 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [731 Valid, 2067 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:43:55,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 844 states. [2025-02-05 15:43:55,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 844 to 820. [2025-02-05 15:43:55,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 820 states, 643 states have (on average 1.6391912908242612) internal successors, (1054), 649 states have internal predecessors, (1054), 149 states have call successors, (149), 25 states have call predecessors, (149), 27 states have return successors, (168), 145 states have call predecessors, (168), 146 states have call successors, (168) [2025-02-05 15:43:55,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 820 states to 820 states and 1371 transitions. [2025-02-05 15:43:55,725 INFO L78 Accepts]: Start accepts. Automaton has 820 states and 1371 transitions. Word has length 125 [2025-02-05 15:43:55,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:43:55,726 INFO L471 AbstractCegarLoop]: Abstraction has 820 states and 1371 transitions. [2025-02-05 15:43:55,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.285714285714285) internal successors, (114), 7 states have internal predecessors, (114), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-02-05 15:43:55,726 INFO L276 IsEmpty]: Start isEmpty. Operand 820 states and 1371 transitions. [2025-02-05 15:43:55,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-02-05 15:43:55,731 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:43:55,731 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:43:55,741 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-05 15:43:55,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-02-05 15:43:55,932 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:43:55,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:43:55,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1198663869, now seen corresponding path program 1 times [2025-02-05 15:43:55,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:43:55,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655781819] [2025-02-05 15:43:55,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:43:55,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:43:55,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-02-05 15:43:55,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-02-05 15:43:55,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:43:55,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:43:56,020 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-02-05 15:43:56,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:43:56,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655781819] [2025-02-05 15:43:56,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655781819] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:43:56,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:43:56,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:43:56,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040989621] [2025-02-05 15:43:56,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:43:56,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:43:56,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:43:56,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:43:56,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:43:56,022 INFO L87 Difference]: Start difference. First operand 820 states and 1371 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-05 15:43:56,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:43:56,067 INFO L93 Difference]: Finished difference Result 1964 states and 3332 transitions. [2025-02-05 15:43:56,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:43:56,068 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 150 [2025-02-05 15:43:56,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:43:56,076 INFO L225 Difference]: With dead ends: 1964 [2025-02-05 15:43:56,076 INFO L226 Difference]: Without dead ends: 1213 [2025-02-05 15:43:56,080 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:43:56,080 INFO L435 NwaCegarLoop]: 559 mSDtfsCounter, 124 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 1102 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:43:56,081 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 1102 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:43:56,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1213 states. [2025-02-05 15:43:56,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1213 to 1205. [2025-02-05 15:43:56,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1205 states, 949 states have (on average 1.6533192834562698) internal successors, (1569), 955 states have internal predecessors, (1569), 228 states have call successors, (228), 25 states have call predecessors, (228), 27 states have return successors, (257), 224 states have call predecessors, (257), 225 states have call successors, (257) [2025-02-05 15:43:56,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1205 states to 1205 states and 2054 transitions. [2025-02-05 15:43:56,171 INFO L78 Accepts]: Start accepts. Automaton has 1205 states and 2054 transitions. Word has length 150 [2025-02-05 15:43:56,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:43:56,171 INFO L471 AbstractCegarLoop]: Abstraction has 1205 states and 2054 transitions. [2025-02-05 15:43:56,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-05 15:43:56,172 INFO L276 IsEmpty]: Start isEmpty. Operand 1205 states and 2054 transitions. [2025-02-05 15:43:56,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-02-05 15:43:56,180 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:43:56,181 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:43:56,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 15:43:56,181 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:43:56,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:43:56,182 INFO L85 PathProgramCache]: Analyzing trace with hash -154822402, now seen corresponding path program 1 times [2025-02-05 15:43:56,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:43:56,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474074917] [2025-02-05 15:43:56,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:43:56,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:43:56,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-05 15:43:56,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-05 15:43:56,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:43:56,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:43:56,271 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-02-05 15:43:56,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:43:56,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474074917] [2025-02-05 15:43:56,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474074917] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:43:56,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:43:56,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:43:56,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776538895] [2025-02-05 15:43:56,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:43:56,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:43:56,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:43:56,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:43:56,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:43:56,273 INFO L87 Difference]: Start difference. First operand 1205 states and 2054 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-05 15:43:56,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:43:56,365 INFO L93 Difference]: Finished difference Result 2902 states and 4979 transitions. [2025-02-05 15:43:56,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:43:56,366 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 151 [2025-02-05 15:43:56,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:43:56,380 INFO L225 Difference]: With dead ends: 2902 [2025-02-05 15:43:56,380 INFO L226 Difference]: Without dead ends: 1817 [2025-02-05 15:43:56,386 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:43:56,387 INFO L435 NwaCegarLoop]: 544 mSDtfsCounter, 122 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 1082 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:43:56,387 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 1082 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:43:56,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1817 states. [2025-02-05 15:43:56,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1817 to 1809. [2025-02-05 15:43:56,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1809 states, 1434 states have (on average 1.6624825662482565) internal successors, (2384), 1440 states have internal predecessors, (2384), 347 states have call successors, (347), 25 states have call predecessors, (347), 27 states have return successors, (376), 343 states have call predecessors, (376), 344 states have call successors, (376) [2025-02-05 15:43:56,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1809 states to 1809 states and 3107 transitions. [2025-02-05 15:43:56,499 INFO L78 Accepts]: Start accepts. Automaton has 1809 states and 3107 transitions. Word has length 151 [2025-02-05 15:43:56,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:43:56,501 INFO L471 AbstractCegarLoop]: Abstraction has 1809 states and 3107 transitions. [2025-02-05 15:43:56,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-05 15:43:56,501 INFO L276 IsEmpty]: Start isEmpty. Operand 1809 states and 3107 transitions. [2025-02-05 15:43:56,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-02-05 15:43:56,513 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:43:56,513 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:43:56,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 15:43:56,513 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:43:56,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:43:56,514 INFO L85 PathProgramCache]: Analyzing trace with hash -31052193, now seen corresponding path program 1 times [2025-02-05 15:43:56,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:43:56,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026427596] [2025-02-05 15:43:56,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:43:56,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:43:56,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-02-05 15:43:56,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-02-05 15:43:56,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:43:56,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:43:56,580 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:43:56,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:43:56,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026427596] [2025-02-05 15:43:56,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026427596] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:43:56,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:43:56,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:43:56,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933773363] [2025-02-05 15:43:56,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:43:56,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:43:56,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:43:56,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:43:56,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:43:56,583 INFO L87 Difference]: Start difference. First operand 1809 states and 3107 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, (18), 2 states have call predecessors, (18), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:43:56,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:43:56,669 INFO L93 Difference]: Finished difference Result 4309 states and 7461 transitions. [2025-02-05 15:43:56,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:43:56,669 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, (18), 2 states have call predecessors, (18), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 133 [2025-02-05 15:43:56,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:43:56,688 INFO L225 Difference]: With dead ends: 4309 [2025-02-05 15:43:56,688 INFO L226 Difference]: Without dead ends: 2742 [2025-02-05 15:43:56,695 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:43:56,696 INFO L435 NwaCegarLoop]: 544 mSDtfsCounter, 120 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 1079 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:43:56,696 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 1079 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:43:56,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2742 states. [2025-02-05 15:43:56,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2742 to 2734. [2025-02-05 15:43:56,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2734 states, 2197 states have (on average 1.6700045516613564) internal successors, (3669), 2203 states have internal predecessors, (3669), 509 states have call successors, (509), 25 states have call predecessors, (509), 27 states have return successors, (554), 505 states have call predecessors, (554), 506 states have call successors, (554) [2025-02-05 15:43:56,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2734 states to 2734 states and 4732 transitions. [2025-02-05 15:43:56,887 INFO L78 Accepts]: Start accepts. Automaton has 2734 states and 4732 transitions. Word has length 133 [2025-02-05 15:43:56,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:43:56,887 INFO L471 AbstractCegarLoop]: Abstraction has 2734 states and 4732 transitions. [2025-02-05 15:43:56,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, (18), 2 states have call predecessors, (18), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:43:56,887 INFO L276 IsEmpty]: Start isEmpty. Operand 2734 states and 4732 transitions. [2025-02-05 15:43:56,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-05 15:43:56,905 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:43:56,905 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] [2025-02-05 15:43:56,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 15:43:56,905 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:43:56,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:43:56,905 INFO L85 PathProgramCache]: Analyzing trace with hash -711875424, now seen corresponding path program 1 times [2025-02-05 15:43:56,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:43:56,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800811486] [2025-02-05 15:43:56,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:43:56,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:43:56,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-05 15:43:56,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-05 15:43:56,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:43:56,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:43:56,974 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:43:56,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:43:56,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800811486] [2025-02-05 15:43:56,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800811486] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:43:56,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:43:56,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:43:56,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599390699] [2025-02-05 15:43:56,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:43:56,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:43:56,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:43:56,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:43:56,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:43:56,977 INFO L87 Difference]: Start difference. First operand 2734 states and 4732 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, (18), 2 states have call predecessors, (18), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:43:57,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:43:57,124 INFO L93 Difference]: Finished difference Result 6527 states and 11382 transitions. [2025-02-05 15:43:57,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:43:57,125 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, (18), 2 states have call predecessors, (18), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 134 [2025-02-05 15:43:57,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:43:57,159 INFO L225 Difference]: With dead ends: 6527 [2025-02-05 15:43:57,160 INFO L226 Difference]: Without dead ends: 4235 [2025-02-05 15:43:57,172 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:43:57,173 INFO L435 NwaCegarLoop]: 544 mSDtfsCounter, 118 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 1079 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:43:57,173 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 1079 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:43:57,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4235 states. [2025-02-05 15:43:57,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4235 to 4227. [2025-02-05 15:43:57,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4227 states, 3445 states have (on average 1.6754716981132076) internal successors, (5772), 3451 states have internal predecessors, (5772), 754 states have call successors, (754), 25 states have call predecessors, (754), 27 states have return successors, (825), 750 states have call predecessors, (825), 751 states have call successors, (825) [2025-02-05 15:43:57,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4227 states to 4227 states and 7351 transitions. [2025-02-05 15:43:57,487 INFO L78 Accepts]: Start accepts. Automaton has 4227 states and 7351 transitions. Word has length 134 [2025-02-05 15:43:57,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:43:57,488 INFO L471 AbstractCegarLoop]: Abstraction has 4227 states and 7351 transitions. [2025-02-05 15:43:57,488 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, (18), 2 states have call predecessors, (18), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:43:57,488 INFO L276 IsEmpty]: Start isEmpty. Operand 4227 states and 7351 transitions. [2025-02-05 15:43:57,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-02-05 15:43:57,512 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:43:57,512 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:43:57,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 15:43:57,512 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:43:57,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:43:57,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1710753311, now seen corresponding path program 1 times [2025-02-05 15:43:57,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:43:57,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371086400] [2025-02-05 15:43:57,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:43:57,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:43:57,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-02-05 15:43:57,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-02-05 15:43:57,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:43:57,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:43:57,594 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-02-05 15:43:57,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:43:57,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371086400] [2025-02-05 15:43:57,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371086400] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:43:57,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:43:57,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:43:57,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531235158] [2025-02-05 15:43:57,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:43:57,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:43:57,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:43:57,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:43:57,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:43:57,596 INFO L87 Difference]: Start difference. First operand 4227 states and 7351 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-05 15:43:57,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:43:57,803 INFO L93 Difference]: Finished difference Result 10487 states and 18338 transitions. [2025-02-05 15:43:57,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:43:57,804 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 154 [2025-02-05 15:43:57,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:43:57,853 INFO L225 Difference]: With dead ends: 10487 [2025-02-05 15:43:57,853 INFO L226 Difference]: Without dead ends: 6929 [2025-02-05 15:43:57,873 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:43:57,874 INFO L435 NwaCegarLoop]: 556 mSDtfsCounter, 116 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 1097 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:43:57,874 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 1097 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:43:57,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6929 states. [2025-02-05 15:43:58,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6929 to 6921. [2025-02-05 15:43:58,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6921 states, 5646 states have (on average 1.671625929861849) internal successors, (9438), 5652 states have internal predecessors, (9438), 1247 states have call successors, (1247), 25 states have call predecessors, (1247), 27 states have return successors, (1362), 1243 states have call predecessors, (1362), 1244 states have call successors, (1362) [2025-02-05 15:43:58,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6921 states to 6921 states and 12047 transitions. [2025-02-05 15:43:58,311 INFO L78 Accepts]: Start accepts. Automaton has 6921 states and 12047 transitions. Word has length 154 [2025-02-05 15:43:58,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:43:58,311 INFO L471 AbstractCegarLoop]: Abstraction has 6921 states and 12047 transitions. [2025-02-05 15:43:58,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-05 15:43:58,316 INFO L276 IsEmpty]: Start isEmpty. Operand 6921 states and 12047 transitions. [2025-02-05 15:43:58,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-02-05 15:43:58,356 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:43:58,357 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:43:58,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 15:43:58,357 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:43:58,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:43:58,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1765761313, now seen corresponding path program 1 times [2025-02-05 15:43:58,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:43:58,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680167008] [2025-02-05 15:43:58,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:43:58,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:43:58,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-02-05 15:43:58,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-02-05 15:43:58,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:43:58,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:43:58,434 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:43:58,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:43:58,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680167008] [2025-02-05 15:43:58,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680167008] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:43:58,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:43:58,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:43:58,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38924143] [2025-02-05 15:43:58,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:43:58,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:43:58,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:43:58,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:43:58,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:43:58,436 INFO L87 Difference]: Start difference. First operand 6921 states and 12047 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:43:58,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:43:58,859 INFO L93 Difference]: Finished difference Result 17522 states and 30694 transitions. [2025-02-05 15:43:58,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:43:58,860 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 136 [2025-02-05 15:43:58,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:43:58,939 INFO L225 Difference]: With dead ends: 17522 [2025-02-05 15:43:58,940 INFO L226 Difference]: Without dead ends: 11641 [2025-02-05 15:43:58,972 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:43:58,973 INFO L435 NwaCegarLoop]: 546 mSDtfsCounter, 114 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 1084 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:43:58,973 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 1084 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:43:58,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11641 states. [2025-02-05 15:43:59,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11641 to 11633. [2025-02-05 15:43:59,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11633 states, 9536 states have (on average 1.6719798657718121) internal successors, (15944), 9542 states have internal predecessors, (15944), 2069 states have call successors, (2069), 25 states have call predecessors, (2069), 27 states have return successors, (2262), 2065 states have call predecessors, (2262), 2066 states have call successors, (2262) [2025-02-05 15:43:59,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11633 states to 11633 states and 20275 transitions. [2025-02-05 15:43:59,608 INFO L78 Accepts]: Start accepts. Automaton has 11633 states and 20275 transitions. Word has length 136 [2025-02-05 15:43:59,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:43:59,609 INFO L471 AbstractCegarLoop]: Abstraction has 11633 states and 20275 transitions. [2025-02-05 15:43:59,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:43:59,609 INFO L276 IsEmpty]: Start isEmpty. Operand 11633 states and 20275 transitions. [2025-02-05 15:43:59,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-02-05 15:43:59,649 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:43:59,649 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, 1] [2025-02-05 15:43:59,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 15:43:59,649 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:43:59,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:43:59,650 INFO L85 PathProgramCache]: Analyzing trace with hash 871655677, now seen corresponding path program 1 times [2025-02-05 15:43:59,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:43:59,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921972786] [2025-02-05 15:43:59,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:43:59,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:43:59,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-02-05 15:43:59,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-02-05 15:43:59,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:43:59,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:43:59,717 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:43:59,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:43:59,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921972786] [2025-02-05 15:43:59,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921972786] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:43:59,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:43:59,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:43:59,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912018221] [2025-02-05 15:43:59,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:43:59,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:43:59,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:43:59,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:43:59,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:43:59,720 INFO L87 Difference]: Start difference. First operand 11633 states and 20275 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:44:00,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:44:00,169 INFO L93 Difference]: Finished difference Result 27753 states and 48336 transitions. [2025-02-05 15:44:00,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:44:00,170 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 137 [2025-02-05 15:44:00,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:44:00,257 INFO L225 Difference]: With dead ends: 27753 [2025-02-05 15:44:00,257 INFO L226 Difference]: Without dead ends: 18097 [2025-02-05 15:44:00,297 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:00,298 INFO L435 NwaCegarLoop]: 546 mSDtfsCounter, 112 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 1056 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:00,299 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 1056 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:00,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18097 states. [2025-02-05 15:44:01,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18097 to 18089. [2025-02-05 15:44:01,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18089 states, 14789 states have (on average 1.6480492257759145) internal successors, (24373), 14795 states have internal predecessors, (24373), 3272 states have call successors, (3272), 25 states have call predecessors, (3272), 27 states have return successors, (3609), 3268 states have call predecessors, (3609), 3269 states have call successors, (3609) [2025-02-05 15:44:01,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18089 states to 18089 states and 31254 transitions. [2025-02-05 15:44:01,145 INFO L78 Accepts]: Start accepts. Automaton has 18089 states and 31254 transitions. Word has length 137 [2025-02-05 15:44:01,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:44:01,146 INFO L471 AbstractCegarLoop]: Abstraction has 18089 states and 31254 transitions. [2025-02-05 15:44:01,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:44:01,146 INFO L276 IsEmpty]: Start isEmpty. Operand 18089 states and 31254 transitions. [2025-02-05 15:44:01,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-02-05 15:44:01,189 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:44:01,189 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:44:01,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 15:44:01,189 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:44:01,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:44:01,190 INFO L85 PathProgramCache]: Analyzing trace with hash -165101285, now seen corresponding path program 1 times [2025-02-05 15:44:01,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:44:01,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031647869] [2025-02-05 15:44:01,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:44:01,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:44:01,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-02-05 15:44:01,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-02-05 15:44:01,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:44:01,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:44:01,351 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-02-05 15:44:01,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:44:01,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031647869] [2025-02-05 15:44:01,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031647869] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:44:01,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:44:01,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:44:01,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679667049] [2025-02-05 15:44:01,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:44:01,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:44:01,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:44:01,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:44:01,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:44:01,353 INFO L87 Difference]: Start difference. First operand 18089 states and 31254 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-05 15:44:02,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:44:02,382 INFO L93 Difference]: Finished difference Result 47780 states and 82905 transitions. [2025-02-05 15:44:02,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:44:02,382 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 157 [2025-02-05 15:44:02,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:44:02,596 INFO L225 Difference]: With dead ends: 47780 [2025-02-05 15:44:02,597 INFO L226 Difference]: Without dead ends: 32267 [2025-02-05 15:44:02,679 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:02,680 INFO L435 NwaCegarLoop]: 544 mSDtfsCounter, 110 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 1082 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:02,680 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 1082 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:02,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32267 states. [2025-02-05 15:44:04,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32267 to 32259. [2025-02-05 15:44:04,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32259 states, 26509 states have (on average 1.6452525557357878) internal successors, (43614), 26515 states have internal predecessors, (43614), 5722 states have call successors, (5722), 25 states have call predecessors, (5722), 27 states have return successors, (6333), 5718 states have call predecessors, (6333), 5719 states have call successors, (6333) [2025-02-05 15:44:04,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32259 states to 32259 states and 55669 transitions. [2025-02-05 15:44:04,257 INFO L78 Accepts]: Start accepts. Automaton has 32259 states and 55669 transitions. Word has length 157 [2025-02-05 15:44:04,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:44:04,258 INFO L471 AbstractCegarLoop]: Abstraction has 32259 states and 55669 transitions. [2025-02-05 15:44:04,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-05 15:44:04,258 INFO L276 IsEmpty]: Start isEmpty. Operand 32259 states and 55669 transitions. [2025-02-05 15:44:04,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-02-05 15:44:04,313 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:44:04,313 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:44:04,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 15:44:04,314 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:44:04,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:44:04,314 INFO L85 PathProgramCache]: Analyzing trace with hash -784405503, now seen corresponding path program 1 times [2025-02-05 15:44:04,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:44:04,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373446478] [2025-02-05 15:44:04,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:44:04,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:44:04,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-02-05 15:44:04,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-02-05 15:44:04,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:44:04,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:44:04,391 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-02-05 15:44:04,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:44:04,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373446478] [2025-02-05 15:44:04,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373446478] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:44:04,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:44:04,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:44:04,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119825202] [2025-02-05 15:44:04,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:44:04,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:44:04,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:44:04,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:44:04,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:44:04,394 INFO L87 Difference]: Start difference. First operand 32259 states and 55669 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-05 15:44:05,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:44:05,974 INFO L93 Difference]: Finished difference Result 87897 states and 152227 transitions. [2025-02-05 15:44:05,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:44:05,975 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 158 [2025-02-05 15:44:05,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:44:06,320 INFO L225 Difference]: With dead ends: 87897 [2025-02-05 15:44:06,320 INFO L226 Difference]: Without dead ends: 59081 [2025-02-05 15:44:06,425 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:06,426 INFO L435 NwaCegarLoop]: 547 mSDtfsCounter, 108 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 1085 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:06,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 1085 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:06,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59081 states. [2025-02-05 15:44:08,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59081 to 59073. [2025-02-05 15:44:08,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59073 states, 48810 states have (on average 1.6413439868879327) internal successors, (80114), 48816 states have internal predecessors, (80114), 10235 states have call successors, (10235), 25 states have call predecessors, (10235), 27 states have return successors, (11378), 10231 states have call predecessors, (11378), 10232 states have call successors, (11378) [2025-02-05 15:44:09,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59073 states to 59073 states and 101727 transitions. [2025-02-05 15:44:09,168 INFO L78 Accepts]: Start accepts. Automaton has 59073 states and 101727 transitions. Word has length 158 [2025-02-05 15:44:09,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:44:09,169 INFO L471 AbstractCegarLoop]: Abstraction has 59073 states and 101727 transitions. [2025-02-05 15:44:09,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-05 15:44:09,169 INFO L276 IsEmpty]: Start isEmpty. Operand 59073 states and 101727 transitions. [2025-02-05 15:44:09,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-02-05 15:44:09,225 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:44:09,226 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, 1, 1, 1, 1] [2025-02-05 15:44:09,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 15:44:09,226 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:44:09,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:44:09,227 INFO L85 PathProgramCache]: Analyzing trace with hash 707568707, now seen corresponding path program 1 times [2025-02-05 15:44:09,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:44:09,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000301561] [2025-02-05 15:44:09,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:44:09,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:44:09,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-02-05 15:44:09,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-02-05 15:44:09,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:44:09,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:44:09,300 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:09,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:44:09,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000301561] [2025-02-05 15:44:09,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000301561] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:44:09,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:44:09,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:44:09,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128778394] [2025-02-05 15:44:09,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:44:09,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:44:09,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:44:09,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:44:09,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:44:09,302 INFO L87 Difference]: Start difference. First operand 59073 states and 101727 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:44:12,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:44:12,049 INFO L93 Difference]: Finished difference Result 110478 states and 190726 transitions. [2025-02-05 15:44:12,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:44:12,050 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 140 [2025-02-05 15:44:12,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:44:12,667 INFO L225 Difference]: With dead ends: 110478 [2025-02-05 15:44:12,668 INFO L226 Difference]: Without dead ends: 110306 [2025-02-05 15:44:12,757 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,761 INFO L435 NwaCegarLoop]: 553 mSDtfsCounter, 103 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 1096 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:12,761 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 1096 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:12,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110306 states. [2025-02-05 15:44:16,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110306 to 110298. [2025-02-05 15:44:16,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110298 states, 91667 states have (on average 1.6362267773571733) internal successors, (149988), 91673 states have internal predecessors, (149988), 18603 states have call successors, (18603), 25 states have call predecessors, (18603), 27 states have return successors, (20792), 18599 states have call predecessors, (20792), 18600 states have call successors, (20792) [2025-02-05 15:44:16,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110298 states to 110298 states and 189383 transitions. [2025-02-05 15:44:16,829 INFO L78 Accepts]: Start accepts. Automaton has 110298 states and 189383 transitions. Word has length 140 [2025-02-05 15:44:16,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:44:16,830 INFO L471 AbstractCegarLoop]: Abstraction has 110298 states and 189383 transitions. [2025-02-05 15:44:16,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:44:16,830 INFO L276 IsEmpty]: Start isEmpty. Operand 110298 states and 189383 transitions. [2025-02-05 15:44:16,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-02-05 15:44:16,909 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:44:16,909 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:44:16,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 15:44:16,909 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:44:16,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:44:16,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1203146334, now seen corresponding path program 1 times [2025-02-05 15:44:16,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:44:16,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145532565] [2025-02-05 15:44:16,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:44:16,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:44:16,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-05 15:44:16,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-05 15:44:16,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:44:16,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:44:17,094 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-02-05 15:44:17,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:44:17,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145532565] [2025-02-05 15:44:17,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145532565] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:44:17,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:44:17,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:44:17,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558924600] [2025-02-05 15:44:17,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:44:17,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:44:17,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:44:17,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:44:17,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:44:17,097 INFO L87 Difference]: Start difference. First operand 110298 states and 189383 transitions. Second operand has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 5 states have internal predecessors, (103), 2 states have call successors, (21), 3 states have call predecessors, (21), 2 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-05 15:44:21,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:44:21,876 INFO L93 Difference]: Finished difference Result 212277 states and 366041 transitions. [2025-02-05 15:44:21,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 15:44:21,877 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 5 states have internal predecessors, (103), 2 states have call successors, (21), 3 states have call predecessors, (21), 2 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) Word has length 160 [2025-02-05 15:44:21,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:44:22,972 INFO L225 Difference]: With dead ends: 212277 [2025-02-05 15:44:22,972 INFO L226 Difference]: Without dead ends: 212113 [2025-02-05 15:44:23,087 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-05 15:44:23,088 INFO L435 NwaCegarLoop]: 602 mSDtfsCounter, 491 mSDsluCounter, 2196 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 492 SdHoareTripleChecker+Valid, 2798 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 15:44:23,088 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [492 Valid, 2798 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 15:44:23,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212113 states. [2025-02-05 15:44:29,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212113 to 212103. [2025-02-05 15:44:29,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212103 states, 176346 states have (on average 1.6397196420672995) internal successors, (289158), 176298 states have internal predecessors, (289158), 35706 states have call successors, (35706), 47 states have call predecessors, (35706), 50 states have return successors, (38987), 35757 states have call predecessors, (38987), 35702 states have call successors, (38987) [2025-02-05 15:44:30,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212103 states to 212103 states and 363851 transitions. [2025-02-05 15:44:30,948 INFO L78 Accepts]: Start accepts. Automaton has 212103 states and 363851 transitions. Word has length 160 [2025-02-05 15:44:30,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:44:30,949 INFO L471 AbstractCegarLoop]: Abstraction has 212103 states and 363851 transitions. [2025-02-05 15:44:30,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 5 states have internal predecessors, (103), 2 states have call successors, (21), 3 states have call predecessors, (21), 2 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-05 15:44:30,950 INFO L276 IsEmpty]: Start isEmpty. Operand 212103 states and 363851 transitions. [2025-02-05 15:44:31,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-02-05 15:44:31,023 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:44:31,023 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, 1, 1, 1, 1, 1] [2025-02-05 15:44:31,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 15:44:31,024 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:44:31,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:44:31,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1734654267, now seen corresponding path program 1 times [2025-02-05 15:44:31,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:44:31,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893301805] [2025-02-05 15:44:31,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:44:31,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:44:31,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-02-05 15:44:31,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-02-05 15:44:31,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:44:31,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:44:31,225 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:31,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:44:31,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893301805] [2025-02-05 15:44:31,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893301805] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:44:31,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:44:31,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:44:31,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498342617] [2025-02-05 15:44:31,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:44:31,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:44:31,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:44:31,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:44:31,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:44:31,227 INFO L87 Difference]: Start difference. First operand 212103 states and 363851 transitions. Second operand has 6 states, 6 states have (on average 16.0) internal successors, (96), 5 states have internal predecessors, (96), 3 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (14), 4 states have call predecessors, (14), 3 states have call successors, (14)