./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec27_product18.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_spec27_product18.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 e1a1a15d818854b6fd39e860ed8f86805463715275e4ae9feedab248e5877daf --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 15:42:37,994 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 15:42:38,049 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:42:38,055 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 15:42:38,058 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 15:42:38,074 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 15:42:38,074 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 15:42:38,074 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 15:42:38,075 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 15:42:38,075 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 15:42:38,075 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 15:42:38,075 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 15:42:38,075 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 15:42:38,075 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 15:42:38,075 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 15:42:38,075 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 15:42:38,076 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 15:42:38,076 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 15:42:38,076 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 15:42:38,076 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 15:42:38,076 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 15:42:38,076 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 15:42:38,076 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 15:42:38,076 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 15:42:38,076 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 15:42:38,076 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 15:42:38,076 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 15:42:38,077 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 15:42:38,077 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 15:42:38,077 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 15:42:38,077 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 15:42:38,077 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 15:42:38,077 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:42:38,077 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 15:42:38,077 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 15:42:38,077 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 15:42:38,077 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 15:42:38,077 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 15:42:38,078 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 15:42:38,078 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 15:42:38,078 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 15:42:38,078 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 15:42:38,078 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 15:42:38,078 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 -> e1a1a15d818854b6fd39e860ed8f86805463715275e4ae9feedab248e5877daf [2025-02-05 15:42:38,316 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 15:42:38,322 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 15:42:38,324 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 15:42:38,325 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 15:42:38,325 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 15:42:38,326 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec27_product18.cil.c [2025-02-05 15:42:39,459 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3e4806150/abcfffa942914cf88145b3df4ce79ef2/FLAG09507d802 [2025-02-05 15:42:39,838 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 15:42:39,839 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec27_product18.cil.c [2025-02-05 15:42:39,858 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3e4806150/abcfffa942914cf88145b3df4ce79ef2/FLAG09507d802 [2025-02-05 15:42:40,050 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3e4806150/abcfffa942914cf88145b3df4ce79ef2 [2025-02-05 15:42:40,052 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 15:42:40,053 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 15:42:40,054 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 15:42:40,054 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 15:42:40,057 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 15:42:40,057 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:42:40" (1/1) ... [2025-02-05 15:42:40,058 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@662350ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:42:40, skipping insertion in model container [2025-02-05 15:42:40,058 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:42:40" (1/1) ... [2025-02-05 15:42:40,110 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 15:42:40,422 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_spec27_product18.cil.c[62382,62395] [2025-02-05 15:42:40,425 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:42:40,436 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 15:42:40,443 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [48] [2025-02-05 15:42:40,444 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [363] [2025-02-05 15:42:40,444 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [729] [2025-02-05 15:42:40,444 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [1801] [2025-02-05 15:42:40,444 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [1908] [2025-02-05 15:42:40,444 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [1925] [2025-02-05 15:42:40,444 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [2329] [2025-02-05 15:42:40,445 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [2545] [2025-02-05 15:42:40,445 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"VerifyForward_spec.i","") [2831] [2025-02-05 15:42:40,445 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [2863] [2025-02-05 15:42:40,445 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [2898] [2025-02-05 15:42:40,527 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_spec27_product18.cil.c[62382,62395] [2025-02-05 15:42:40,527 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:42:40,552 INFO L204 MainTranslator]: Completed translation [2025-02-05 15:42:40,553 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:42:40 WrapperNode [2025-02-05 15:42:40,553 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 15:42:40,554 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 15:42:40,554 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 15:42:40,554 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 15:42:40,558 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:42:40" (1/1) ... [2025-02-05 15:42:40,572 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:42:40" (1/1) ... [2025-02-05 15:42:40,603 INFO L138 Inliner]: procedures = 127, calls = 186, calls flagged for inlining = 57, calls inlined = 49, statements flattened = 874 [2025-02-05 15:42:40,604 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 15:42:40,604 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 15:42:40,604 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 15:42:40,604 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 15:42:40,612 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:42:40" (1/1) ... [2025-02-05 15:42:40,612 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:42:40" (1/1) ... [2025-02-05 15:42:40,620 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:42:40" (1/1) ... [2025-02-05 15:42:40,641 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:42:40,641 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:42:40" (1/1) ... [2025-02-05 15:42:40,641 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:42:40" (1/1) ... [2025-02-05 15:42:40,655 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:42:40" (1/1) ... [2025-02-05 15:42:40,660 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:42:40" (1/1) ... [2025-02-05 15:42:40,666 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:42:40" (1/1) ... [2025-02-05 15:42:40,668 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:42:40" (1/1) ... [2025-02-05 15:42:40,675 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 15:42:40,676 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 15:42:40,676 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 15:42:40,676 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 15:42:40,677 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:42:40" (1/1) ... [2025-02-05 15:42:40,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:42:40,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:42:40,715 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:42:40,724 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:42:40,744 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-02-05 15:42:40,745 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-02-05 15:42:40,745 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-02-05 15:42:40,745 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-02-05 15:42:40,745 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2025-02-05 15:42:40,745 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2025-02-05 15:42:40,745 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-02-05 15:42:40,745 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-02-05 15:42:40,746 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2025-02-05 15:42:40,746 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2025-02-05 15:42:40,746 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-02-05 15:42:40,746 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-02-05 15:42:40,746 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-02-05 15:42:40,747 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-02-05 15:42:40,747 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-02-05 15:42:40,747 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-02-05 15:42:40,747 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 15:42:40,747 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2025-02-05 15:42:40,748 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2025-02-05 15:42:40,748 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-02-05 15:42:40,748 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-02-05 15:42:40,748 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-02-05 15:42:40,748 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-02-05 15:42:40,748 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-02-05 15:42:40,748 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-02-05 15:42:40,748 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2025-02-05 15:42:40,748 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2025-02-05 15:42:40,748 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2025-02-05 15:42:40,748 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2025-02-05 15:42:40,748 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-02-05 15:42:40,748 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-02-05 15:42:40,749 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-02-05 15:42:40,749 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-02-05 15:42:40,749 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-02-05 15:42:40,749 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-02-05 15:42:40,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 15:42:40,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-05 15:42:40,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-05 15:42:40,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-05 15:42:40,750 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-02-05 15:42:40,751 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-02-05 15:42:40,751 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 15:42:40,751 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 15:42:40,942 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 15:42:40,946 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 15:42:40,984 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2273: #res := ~retValue_acc~34; [2025-02-05 15:42:41,179 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1778-1: getClientId_#res#1 := getClientId_~retValue_acc~20#1; [2025-02-05 15:42:41,180 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1343-1: getClientPrivateKey_#res#1 := getClientPrivateKey_~retValue_acc~13#1; [2025-02-05 15:42:41,180 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1296-1: getClientAutoResponse_#res#1 := getClientAutoResponse_~retValue_acc~12#1; [2025-02-05 15:42:41,180 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2734-1: isKeyPairValid_#res#1 := isKeyPairValid_~retValue_acc~40#1; [2025-02-05 15:42:41,186 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2236: #res := ~retValue_acc~33; [2025-02-05 15:42:41,212 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2310: #res := ~retValue_acc~35; [2025-02-05 15:42:41,231 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2047: #res := ~retValue_acc~28; [2025-02-05 15:42:41,269 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1435: #res#1 := ~retValue_acc~15#1; [2025-02-05 15:42:41,269 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1390-1: getClientKeyringSize_#res#1 := getClientKeyringSize_~retValue_acc~14#1; [2025-02-05 15:42:41,301 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1659: #res := ~retValue_acc~18; [2025-02-05 15:42:41,336 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1905-1: createEmail_#res#1 := createEmail_~retValue_acc~23#1; [2025-02-05 15:42:41,609 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1605-1: getClientKeyringPublicKey_#res#1 := getClientKeyringPublicKey_~retValue_acc~17#1; [2025-02-05 15:42:41,609 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1498-1: getClientKeyringUser_#res#1 := getClientKeyringUser_~retValue_acc~16#1; [2025-02-05 15:42:41,609 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2895-1: valid_product_#res#1 := valid_product_~retValue_acc~42#1; [2025-02-05 15:42:41,609 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2691-1: is_queue_empty_#res#1 := is_queue_empty_~retValue_acc~37#1; [2025-02-05 15:42:41,609 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2700-1: get_queued_client_#res#1 := get_queued_client_~retValue_acc~38#1; [2025-02-05 15:42:41,609 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2709-1: get_queued_email_#res#1 := get_queued_email_~retValue_acc~39#1; [2025-02-05 15:42:41,616 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2010: #res := ~retValue_acc~27; [2025-02-05 15:42:41,620 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1881: #res := ~retValue_acc~21; [2025-02-05 15:42:41,743 INFO L? ?]: Removed 399 outVars from TransFormulas that were not future-live. [2025-02-05 15:42:41,743 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 15:42:41,757 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 15:42:41,761 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 15:42:41,761 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:42:41 BoogieIcfgContainer [2025-02-05 15:42:41,761 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 15:42:41,763 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 15:42:41,766 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 15:42:41,770 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 15:42:41,771 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 03:42:40" (1/3) ... [2025-02-05 15:42:41,772 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cdb8d3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:42:41, skipping insertion in model container [2025-02-05 15:42:41,772 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:42:40" (2/3) ... [2025-02-05 15:42:41,772 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cdb8d3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:42:41, skipping insertion in model container [2025-02-05 15:42:41,772 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:42:41" (3/3) ... [2025-02-05 15:42:41,773 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec27_product18.cil.c [2025-02-05 15:42:41,788 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 15:42:41,793 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec27_product18.cil.c that has 19 procedures, 297 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 15:42:41,849 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 15:42:41,858 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;@2b79befd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 15:42:41,859 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 15:42:41,862 INFO L276 IsEmpty]: Start isEmpty. Operand has 297 states, 236 states have (on average 1.5381355932203389) internal successors, (363), 238 states have internal predecessors, (363), 41 states have call successors, (41), 18 states have call predecessors, (41), 18 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2025-02-05 15:42:41,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-02-05 15:42:41,872 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:42:41,872 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] [2025-02-05 15:42:41,873 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:42:41,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:42:41,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1942348145, now seen corresponding path program 1 times [2025-02-05 15:42:41,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:42:41,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561377111] [2025-02-05 15:42:41,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:42:41,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:42:41,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-05 15:42:42,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-05 15:42:42,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:42:42,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:42:42,564 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:42:42,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:42:42,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561377111] [2025-02-05 15:42:42,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561377111] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:42:42,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [787222409] [2025-02-05 15:42:42,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:42:42,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:42:42,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:42:42,568 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:42:42,570 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:42:42,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-05 15:42:42,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-05 15:42:42,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:42:42,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:42:42,853 INFO L256 TraceCheckSpWp]: Trace formula consists of 1028 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 15:42:42,861 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:42:42,877 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:42:42,880 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:42:42,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [787222409] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:42:42,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:42:42,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 5 [2025-02-05 15:42:42,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567400981] [2025-02-05 15:42:42,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:42:42,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 15:42:42,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:42:42,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 15:42:42,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:42:42,906 INFO L87 Difference]: Start difference. First operand has 297 states, 236 states have (on average 1.5381355932203389) internal successors, (363), 238 states have internal predecessors, (363), 41 states have call successors, (41), 18 states have call predecessors, (41), 18 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) Second operand has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:42:42,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:42:42,951 INFO L93 Difference]: Finished difference Result 441 states and 646 transitions. [2025-02-05 15:42:42,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 15:42:42,953 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 108 [2025-02-05 15:42:42,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:42:42,966 INFO L225 Difference]: With dead ends: 441 [2025-02-05 15:42:42,968 INFO L226 Difference]: Without dead ends: 290 [2025-02-05 15:42:42,973 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 109 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:42:42,976 INFO L435 NwaCegarLoop]: 442 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, 442 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:42:42,978 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:42:42,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2025-02-05 15:42:43,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 290. [2025-02-05 15:42:43,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 230 states have (on average 1.5347826086956522) internal successors, (353), 231 states have internal predecessors, (353), 41 states have call successors, (41), 18 states have call predecessors, (41), 18 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-02-05 15:42:43,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 434 transitions. [2025-02-05 15:42:43,028 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 434 transitions. Word has length 108 [2025-02-05 15:42:43,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:42:43,029 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 434 transitions. [2025-02-05 15:42:43,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:42:43,029 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 434 transitions. [2025-02-05 15:42:43,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-02-05 15:42:43,033 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:42:43,033 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] [2025-02-05 15:42:43,041 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:42:43,234 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:42:43,234 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:42:43,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:42:43,235 INFO L85 PathProgramCache]: Analyzing trace with hash 400406023, now seen corresponding path program 1 times [2025-02-05 15:42:43,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:42:43,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555598376] [2025-02-05 15:42:43,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:42:43,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:42:43,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-05 15:42:43,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-05 15:42:43,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:42:43,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:42:43,430 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:42:43,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:42:43,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555598376] [2025-02-05 15:42:43,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555598376] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:42:43,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [521755206] [2025-02-05 15:42:43,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:42:43,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:42:43,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:42:43,433 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:42:43,436 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:42:43,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-05 15:42:43,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-05 15:42:43,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:42:43,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:42:43,701 INFO L256 TraceCheckSpWp]: Trace formula consists of 1029 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 15:42:43,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:42:43,737 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:42:43,741 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:42:43,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [521755206] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:42:43,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:42:43,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-02-05 15:42:43,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366113603] [2025-02-05 15:42:43,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:42:43,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:42:43,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:42:43,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:42:43,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:42:43,747 INFO L87 Difference]: Start difference. First operand 290 states and 434 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:42:43,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:42:43,773 INFO L93 Difference]: Finished difference Result 430 states and 627 transitions. [2025-02-05 15:42:43,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:42:43,774 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 109 [2025-02-05 15:42:43,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:42:43,776 INFO L225 Difference]: With dead ends: 430 [2025-02-05 15:42:43,776 INFO L226 Difference]: Without dead ends: 292 [2025-02-05 15:42:43,777 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 109 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:42:43,778 INFO L435 NwaCegarLoop]: 433 mSDtfsCounter, 0 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 864 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:42:43,778 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 864 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:42:43,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2025-02-05 15:42:43,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 292. [2025-02-05 15:42:43,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 232 states have (on average 1.5301724137931034) internal successors, (355), 233 states have internal predecessors, (355), 41 states have call successors, (41), 18 states have call predecessors, (41), 18 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-02-05 15:42:43,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 436 transitions. [2025-02-05 15:42:43,817 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 436 transitions. Word has length 109 [2025-02-05 15:42:43,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:42:43,818 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 436 transitions. [2025-02-05 15:42:43,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:42:43,818 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 436 transitions. [2025-02-05 15:42:43,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-02-05 15:42:43,821 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:42:43,821 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] [2025-02-05 15:42:43,832 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:42:44,022 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:42:44,022 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:42:44,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:42:44,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1379022539, now seen corresponding path program 1 times [2025-02-05 15:42:44,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:42:44,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280585544] [2025-02-05 15:42:44,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:42:44,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:42:44,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-02-05 15:42:44,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-02-05 15:42:44,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:42:44,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:42:44,199 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:42:44,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:42:44,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280585544] [2025-02-05 15:42:44,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280585544] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:42:44,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [488511514] [2025-02-05 15:42:44,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:42:44,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:42:44,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:42:44,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:42:44,213 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:42:44,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-02-05 15:42:44,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-02-05 15:42:44,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:42:44,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:42:44,442 INFO L256 TraceCheckSpWp]: Trace formula consists of 1054 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 15:42:44,450 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:42:44,511 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-05 15:42:44,512 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:42:44,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [488511514] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:42:44,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:42:44,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-02-05 15:42:44,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755579801] [2025-02-05 15:42:44,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:42:44,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:42:44,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:42:44,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:42:44,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:42:44,513 INFO L87 Difference]: Start difference. First operand 292 states and 436 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:42:44,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:42:44,538 INFO L93 Difference]: Finished difference Result 613 states and 930 transitions. [2025-02-05 15:42:44,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:42:44,541 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 117 [2025-02-05 15:42:44,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:42:44,543 INFO L225 Difference]: With dead ends: 613 [2025-02-05 15:42:44,543 INFO L226 Difference]: Without dead ends: 348 [2025-02-05 15:42:44,545 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 117 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:42:44,545 INFO L435 NwaCegarLoop]: 444 mSDtfsCounter, 107 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 832 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:42:44,546 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 832 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:42:44,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2025-02-05 15:42:44,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 340. [2025-02-05 15:42:44,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 269 states have (on average 1.546468401486989) internal successors, (416), 270 states have internal predecessors, (416), 52 states have call successors, (52), 18 states have call predecessors, (52), 18 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2025-02-05 15:42:44,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 519 transitions. [2025-02-05 15:42:44,561 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 519 transitions. Word has length 117 [2025-02-05 15:42:44,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:42:44,562 INFO L471 AbstractCegarLoop]: Abstraction has 340 states and 519 transitions. [2025-02-05 15:42:44,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:42:44,562 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 519 transitions. [2025-02-05 15:42:44,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-02-05 15:42:44,564 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:42:44,564 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] [2025-02-05 15:42:44,571 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-05 15:42:44,764 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:42:44,765 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:42:44,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:42:44,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1084086775, now seen corresponding path program 1 times [2025-02-05 15:42:44,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:42:44,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639345988] [2025-02-05 15:42:44,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:42:44,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:42:44,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-05 15:42:44,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-05 15:42:44,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:42:44,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:42:44,945 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:42:44,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:42:44,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639345988] [2025-02-05 15:42:44,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639345988] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:42:44,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1962751324] [2025-02-05 15:42:44,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:42:44,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:42:44,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:42:44,950 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:42:44,951 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:42:45,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-05 15:42:45,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-05 15:42:45,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:42:45,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:42:45,210 INFO L256 TraceCheckSpWp]: Trace formula consists of 1059 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-05 15:42:45,215 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:42:45,266 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:42:45,267 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:42:45,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1962751324] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:42:45,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:42:45,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-02-05 15:42:45,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350054436] [2025-02-05 15:42:45,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:42:45,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:42:45,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:42:45,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:42:45,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:42:45,270 INFO L87 Difference]: Start difference. First operand 340 states and 519 transitions. Second operand has 5 states, 4 states have (on average 20.25) internal successors, (81), 5 states have internal predecessors, (81), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-02-05 15:42:45,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:42:45,329 INFO L93 Difference]: Finished difference Result 671 states and 1028 transitions. [2025-02-05 15:42:45,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:42:45,331 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.25) internal successors, (81), 5 states have internal predecessors, (81), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) Word has length 118 [2025-02-05 15:42:45,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:42:45,335 INFO L225 Difference]: With dead ends: 671 [2025-02-05 15:42:45,335 INFO L226 Difference]: Without dead ends: 342 [2025-02-05 15:42:45,336 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 116 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:42:45,336 INFO L435 NwaCegarLoop]: 426 mSDtfsCounter, 2 mSDsluCounter, 1267 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1693 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:42:45,337 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1693 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:42:45,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2025-02-05 15:42:45,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 342. [2025-02-05 15:42:45,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 270 states have (on average 1.5444444444444445) internal successors, (417), 272 states have internal predecessors, (417), 52 states have call successors, (52), 18 states have call predecessors, (52), 19 states have return successors, (53), 51 states have call predecessors, (53), 51 states have call successors, (53) [2025-02-05 15:42:45,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 522 transitions. [2025-02-05 15:42:45,363 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 522 transitions. Word has length 118 [2025-02-05 15:42:45,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:42:45,365 INFO L471 AbstractCegarLoop]: Abstraction has 342 states and 522 transitions. [2025-02-05 15:42:45,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.25) internal successors, (81), 5 states have internal predecessors, (81), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-02-05 15:42:45,366 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 522 transitions. [2025-02-05 15:42:45,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-02-05 15:42:45,369 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:42:45,369 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] [2025-02-05 15:42:45,379 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:42:45,570 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:42:45,570 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:42:45,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:42:45,570 INFO L85 PathProgramCache]: Analyzing trace with hash 2022219363, now seen corresponding path program 1 times [2025-02-05 15:42:45,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:42:45,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614136934] [2025-02-05 15:42:45,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:42:45,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:42:45,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-05 15:42:45,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-05 15:42:45,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:42:45,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:42:45,734 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:42:45,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:42:45,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614136934] [2025-02-05 15:42:45,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614136934] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:42:45,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1687390270] [2025-02-05 15:42:45,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:42:45,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:42:45,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:42:45,737 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:42:45,739 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:42:45,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-05 15:42:45,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-05 15:42:45,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:42:45,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:42:45,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 1060 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 15:42:45,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:42:46,029 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:42:46,030 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:42:46,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1687390270] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:42:46,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:42:46,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-02-05 15:42:46,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33074233] [2025-02-05 15:42:46,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:42:46,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:42:46,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:42:46,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:42:46,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-02-05 15:42:46,031 INFO L87 Difference]: Start difference. First operand 342 states and 522 transitions. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-02-05 15:42:46,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:42:46,080 INFO L93 Difference]: Finished difference Result 673 states and 1033 transitions. [2025-02-05 15:42:46,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:42:46,080 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 119 [2025-02-05 15:42:46,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:42:46,082 INFO L225 Difference]: With dead ends: 673 [2025-02-05 15:42:46,083 INFO L226 Difference]: Without dead ends: 344 [2025-02-05 15:42:46,084 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 117 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:42:46,084 INFO L435 NwaCegarLoop]: 424 mSDtfsCounter, 2 mSDsluCounter, 1255 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1679 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:42:46,084 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1679 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:42:46,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2025-02-05 15:42:46,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 344. [2025-02-05 15:42:46,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 271 states have (on average 1.5424354243542435) internal successors, (418), 274 states have internal predecessors, (418), 52 states have call successors, (52), 18 states have call predecessors, (52), 20 states have return successors, (58), 51 states have call predecessors, (58), 51 states have call successors, (58) [2025-02-05 15:42:46,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 528 transitions. [2025-02-05 15:42:46,096 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 528 transitions. Word has length 119 [2025-02-05 15:42:46,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:42:46,097 INFO L471 AbstractCegarLoop]: Abstraction has 344 states and 528 transitions. [2025-02-05 15:42:46,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-02-05 15:42:46,097 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 528 transitions. [2025-02-05 15:42:46,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-02-05 15:42:46,099 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:42:46,099 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:42:46,109 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:42:46,299 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:42:46,300 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:42:46,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:42:46,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1305275703, now seen corresponding path program 1 times [2025-02-05 15:42:46,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:42:46,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35006700] [2025-02-05 15:42:46,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:42:46,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:42:46,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-02-05 15:42:46,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-02-05 15:42:46,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:42:46,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:42:46,437 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:42:46,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:42:46,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35006700] [2025-02-05 15:42:46,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35006700] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:42:46,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:42:46,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:42:46,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582595694] [2025-02-05 15:42:46,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:42:46,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:42:46,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:42:46,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:42:46,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:42:46,440 INFO L87 Difference]: Start difference. First operand 344 states and 528 transitions. Second operand has 5 states, 4 states have (on average 19.75) internal successors, (79), 5 states have internal predecessors, (79), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-02-05 15:42:46,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:42:46,482 INFO L93 Difference]: Finished difference Result 665 states and 1024 transitions. [2025-02-05 15:42:46,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:42:46,482 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.75) internal successors, (79), 5 states have internal predecessors, (79), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) Word has length 120 [2025-02-05 15:42:46,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:42:46,484 INFO L225 Difference]: With dead ends: 665 [2025-02-05 15:42:46,485 INFO L226 Difference]: Without dead ends: 344 [2025-02-05 15:42:46,488 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:42:46,490 INFO L435 NwaCegarLoop]: 427 mSDtfsCounter, 2 mSDsluCounter, 1270 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1697 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:42:46,491 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1697 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:42:46,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2025-02-05 15:42:46,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 344. [2025-02-05 15:42:46,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 271 states have (on average 1.5424354243542435) internal successors, (418), 274 states have internal predecessors, (418), 52 states have call successors, (52), 18 states have call predecessors, (52), 20 states have return successors, (57), 51 states have call predecessors, (57), 51 states have call successors, (57) [2025-02-05 15:42:46,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 527 transitions. [2025-02-05 15:42:46,511 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 527 transitions. Word has length 120 [2025-02-05 15:42:46,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:42:46,512 INFO L471 AbstractCegarLoop]: Abstraction has 344 states and 527 transitions. [2025-02-05 15:42:46,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.75) internal successors, (79), 5 states have internal predecessors, (79), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-02-05 15:42:46,512 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 527 transitions. [2025-02-05 15:42:46,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-02-05 15:42:46,514 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:42:46,514 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] [2025-02-05 15:42:46,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 15:42:46,514 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:42:46,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:42:46,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1489865261, now seen corresponding path program 2 times [2025-02-05 15:42:46,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:42:46,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438166587] [2025-02-05 15:42:46,516 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 15:42:46,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:42:46,535 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 121 statements into 2 equivalence classes. [2025-02-05 15:42:46,540 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 66 of 121 statements. [2025-02-05 15:42:46,541 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-05 15:42:46,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:42:46,633 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-02-05 15:42:46,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:42:46,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438166587] [2025-02-05 15:42:46,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438166587] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:42:46,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:42:46,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 15:42:46,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430417383] [2025-02-05 15:42:46,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:42:46,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 15:42:46,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:42:46,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 15:42:46,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:42:46,635 INFO L87 Difference]: Start difference. First operand 344 states and 527 transitions. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 6 states have internal predecessors, (76), 2 states have call successors, (16), 1 states have call predecessors, (16), 2 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:42:46,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:42:46,665 INFO L93 Difference]: Finished difference Result 474 states and 707 transitions. [2025-02-05 15:42:46,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 15:42:46,666 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 6 states have internal predecessors, (76), 2 states have call successors, (16), 1 states have call predecessors, (16), 2 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) Word has length 121 [2025-02-05 15:42:46,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:42:46,669 INFO L225 Difference]: With dead ends: 474 [2025-02-05 15:42:46,669 INFO L226 Difference]: Without dead ends: 344 [2025-02-05 15:42:46,669 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:42:46,670 INFO L435 NwaCegarLoop]: 429 mSDtfsCounter, 0 mSDsluCounter, 2136 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2565 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:42:46,670 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2565 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:42:46,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2025-02-05 15:42:46,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 344. [2025-02-05 15:42:46,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 271 states have (on average 1.5387453874538746) internal successors, (417), 274 states have internal predecessors, (417), 52 states have call successors, (52), 18 states have call predecessors, (52), 20 states have return successors, (57), 51 states have call predecessors, (57), 51 states have call successors, (57) [2025-02-05 15:42:46,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 526 transitions. [2025-02-05 15:42:46,681 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 526 transitions. Word has length 121 [2025-02-05 15:42:46,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:42:46,681 INFO L471 AbstractCegarLoop]: Abstraction has 344 states and 526 transitions. [2025-02-05 15:42:46,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 6 states have internal predecessors, (76), 2 states have call successors, (16), 1 states have call predecessors, (16), 2 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:42:46,682 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 526 transitions. [2025-02-05 15:42:46,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-02-05 15:42:46,684 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:42:46,684 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, 1, 1, 1, 1] [2025-02-05 15:42:46,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 15:42:46,684 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:42:46,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:42:46,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1228322389, now seen corresponding path program 1 times [2025-02-05 15:42:46,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:42:46,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43869310] [2025-02-05 15:42:46,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:42:46,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:42:46,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-02-05 15:42:46,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-02-05 15:42:46,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:42:46,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:42:46,793 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-05 15:42:46,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:42:46,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43869310] [2025-02-05 15:42:46,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43869310] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:42:46,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:42:46,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:42:46,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854236909] [2025-02-05 15:42:46,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:42:46,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:42:46,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:42:46,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:42:46,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:42:46,795 INFO L87 Difference]: Start difference. First operand 344 states and 526 transitions. Second operand has 5 states, 4 states have (on average 21.25) internal successors, (85), 5 states have internal predecessors, (85), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2025-02-05 15:42:46,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:42:46,853 INFO L93 Difference]: Finished difference Result 667 states and 1025 transitions. [2025-02-05 15:42:46,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:42:46,858 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.25) internal successors, (85), 5 states have internal predecessors, (85), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 128 [2025-02-05 15:42:46,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:42:46,864 INFO L225 Difference]: With dead ends: 667 [2025-02-05 15:42:46,864 INFO L226 Difference]: Without dead ends: 346 [2025-02-05 15:42:46,869 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:42:46,870 INFO L435 NwaCegarLoop]: 427 mSDtfsCounter, 1 mSDsluCounter, 1269 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1696 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:42:46,870 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1696 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:42:46,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2025-02-05 15:42:46,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 346. [2025-02-05 15:42:46,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 272 states have (on average 1.536764705882353) internal successors, (418), 276 states have internal predecessors, (418), 52 states have call successors, (52), 18 states have call predecessors, (52), 21 states have return successors, (59), 51 states have call predecessors, (59), 51 states have call successors, (59) [2025-02-05 15:42:46,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 529 transitions. [2025-02-05 15:42:46,920 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 529 transitions. Word has length 128 [2025-02-05 15:42:46,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:42:46,921 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 529 transitions. [2025-02-05 15:42:46,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.25) internal successors, (85), 5 states have internal predecessors, (85), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2025-02-05 15:42:46,921 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 529 transitions. [2025-02-05 15:42:46,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-02-05 15:42:46,927 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:42:46,927 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, 1, 1, 1, 1] [2025-02-05 15:42:46,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 15:42:46,927 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:42:46,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:42:46,927 INFO L85 PathProgramCache]: Analyzing trace with hash -997394440, now seen corresponding path program 1 times [2025-02-05 15:42:46,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:42:46,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428770519] [2025-02-05 15:42:46,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:42:46,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:42:46,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-02-05 15:42:46,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-02-05 15:42:46,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:42:46,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:42:47,230 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-05 15:42:47,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:42:47,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428770519] [2025-02-05 15:42:47,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428770519] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:42:47,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:42:47,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 15:42:47,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518081003] [2025-02-05 15:42:47,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:42:47,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 15:42:47,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:42:47,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 15:42:47,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:42:47,231 INFO L87 Difference]: Start difference. First operand 346 states and 529 transitions. Second operand has 8 states, 7 states have (on average 12.714285714285714) internal successors, (89), 8 states have internal predecessors, (89), 4 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2025-02-05 15:42:47,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:42:47,337 INFO L93 Difference]: Finished difference Result 669 states and 1024 transitions. [2025-02-05 15:42:47,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 15:42:47,338 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 12.714285714285714) internal successors, (89), 8 states have internal predecessors, (89), 4 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 129 [2025-02-05 15:42:47,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:42:47,340 INFO L225 Difference]: With dead ends: 669 [2025-02-05 15:42:47,340 INFO L226 Difference]: Without dead ends: 348 [2025-02-05 15:42:47,341 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:42:47,342 INFO L435 NwaCegarLoop]: 417 mSDtfsCounter, 7 mSDsluCounter, 2473 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2890 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:42:47,342 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2890 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:42:47,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2025-02-05 15:42:47,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 348. [2025-02-05 15:42:47,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 274 states have (on average 1.532846715328467) internal successors, (420), 277 states have internal predecessors, (420), 52 states have call successors, (52), 19 states have call predecessors, (52), 21 states have return successors, (58), 51 states have call predecessors, (58), 51 states have call successors, (58) [2025-02-05 15:42:47,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 530 transitions. [2025-02-05 15:42:47,356 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 530 transitions. Word has length 129 [2025-02-05 15:42:47,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:42:47,356 INFO L471 AbstractCegarLoop]: Abstraction has 348 states and 530 transitions. [2025-02-05 15:42:47,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 12.714285714285714) internal successors, (89), 8 states have internal predecessors, (89), 4 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2025-02-05 15:42:47,357 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 530 transitions. [2025-02-05 15:42:47,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-02-05 15:42:47,358 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:42:47,358 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, 1, 1, 1, 1, 1, 1] [2025-02-05 15:42:47,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 15:42:47,359 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:42:47,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:42:47,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1828430522, now seen corresponding path program 2 times [2025-02-05 15:42:47,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:42:47,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246094806] [2025-02-05 15:42:47,359 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 15:42:47,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:42:47,377 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 130 statements into 2 equivalence classes. [2025-02-05 15:42:47,385 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 130 of 130 statements. [2025-02-05 15:42:47,385 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 15:42:47,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:42:47,510 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-05 15:42:47,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:42:47,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246094806] [2025-02-05 15:42:47,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246094806] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:42:47,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:42:47,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 15:42:47,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049860141] [2025-02-05 15:42:47,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:42:47,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 15:42:47,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:42:47,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 15:42:47,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:42:47,512 INFO L87 Difference]: Start difference. First operand 348 states and 530 transitions. Second operand has 7 states, 6 states have (on average 14.5) internal successors, (87), 7 states have internal predecessors, (87), 4 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2025-02-05 15:42:47,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:42:47,577 INFO L93 Difference]: Finished difference Result 669 states and 1028 transitions. [2025-02-05 15:42:47,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:42:47,578 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 14.5) internal successors, (87), 7 states have internal predecessors, (87), 4 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 130 [2025-02-05 15:42:47,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:42:47,580 INFO L225 Difference]: With dead ends: 669 [2025-02-05 15:42:47,580 INFO L226 Difference]: Without dead ends: 350 [2025-02-05 15:42:47,581 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:42:47,582 INFO L435 NwaCegarLoop]: 425 mSDtfsCounter, 2 mSDsluCounter, 2097 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2522 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:42:47,582 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2522 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:42:47,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2025-02-05 15:42:47,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 350. [2025-02-05 15:42:47,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 275 states have (on average 1.530909090909091) internal successors, (421), 279 states have internal predecessors, (421), 52 states have call successors, (52), 19 states have call predecessors, (52), 22 states have return successors, (63), 51 states have call predecessors, (63), 51 states have call successors, (63) [2025-02-05 15:42:47,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 536 transitions. [2025-02-05 15:42:47,596 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 536 transitions. Word has length 130 [2025-02-05 15:42:47,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:42:47,596 INFO L471 AbstractCegarLoop]: Abstraction has 350 states and 536 transitions. [2025-02-05 15:42:47,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 14.5) internal successors, (87), 7 states have internal predecessors, (87), 4 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2025-02-05 15:42:47,597 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 536 transitions. [2025-02-05 15:42:47,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-02-05 15:42:47,598 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:42:47,598 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, 1, 1, 1, 1, 1, 1] [2025-02-05 15:42:47,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 15:42:47,599 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:42:47,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:42:47,599 INFO L85 PathProgramCache]: Analyzing trace with hash 2083730363, now seen corresponding path program 1 times [2025-02-05 15:42:47,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:42:47,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62234537] [2025-02-05 15:42:47,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:42:47,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:42:47,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-02-05 15:42:47,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-02-05 15:42:47,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:42:47,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:42:47,728 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-02-05 15:42:47,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:42:47,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62234537] [2025-02-05 15:42:47,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62234537] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:42:47,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [78875876] [2025-02-05 15:42:47,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:42:47,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:42:47,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:42:47,732 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:42:47,742 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:42:47,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-02-05 15:42:47,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-02-05 15:42:47,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:42:47,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:42:48,003 INFO L256 TraceCheckSpWp]: Trace formula consists of 1085 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 15:42:48,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:42:48,035 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:42:48,035 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:42:48,115 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:42:48,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [78875876] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:42:48,116 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:42:48,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 11 [2025-02-05 15:42:48,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070073922] [2025-02-05 15:42:48,116 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:42:48,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 15:42:48,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:42:48,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 15:42:48,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-02-05 15:42:48,117 INFO L87 Difference]: Start difference. First operand 350 states and 536 transitions. Second operand has 11 states, 10 states have (on average 14.3) internal successors, (143), 11 states have internal predecessors, (143), 4 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (28), 3 states have call predecessors, (28), 4 states have call successors, (28) [2025-02-05 15:42:48,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:42:48,567 INFO L93 Difference]: Finished difference Result 1018 states and 1635 transitions. [2025-02-05 15:42:48,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 15:42:48,568 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 14.3) internal successors, (143), 11 states have internal predecessors, (143), 4 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (28), 3 states have call predecessors, (28), 4 states have call successors, (28) Word has length 131 [2025-02-05 15:42:48,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:42:48,572 INFO L225 Difference]: With dead ends: 1018 [2025-02-05 15:42:48,572 INFO L226 Difference]: Without dead ends: 699 [2025-02-05 15:42:48,573 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 259 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=400, Unknown=0, NotChecked=0, Total=506 [2025-02-05 15:42:48,573 INFO L435 NwaCegarLoop]: 424 mSDtfsCounter, 1136 mSDsluCounter, 2909 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1136 SdHoareTripleChecker+Valid, 3333 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 15:42:48,574 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1136 Valid, 3333 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 495 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 15:42:48,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2025-02-05 15:42:48,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 673. [2025-02-05 15:42:48,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 673 states, 534 states have (on average 1.5861423220973783) internal successors, (847), 538 states have internal predecessors, (847), 116 states have call successors, (116), 19 states have call predecessors, (116), 22 states have return successors, (137), 115 states have call predecessors, (137), 115 states have call successors, (137) [2025-02-05 15:42:48,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 1100 transitions. [2025-02-05 15:42:48,599 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 1100 transitions. Word has length 131 [2025-02-05 15:42:48,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:42:48,599 INFO L471 AbstractCegarLoop]: Abstraction has 673 states and 1100 transitions. [2025-02-05 15:42:48,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 14.3) internal successors, (143), 11 states have internal predecessors, (143), 4 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (28), 3 states have call predecessors, (28), 4 states have call successors, (28) [2025-02-05 15:42:48,599 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 1100 transitions. [2025-02-05 15:42:48,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-05 15:42:48,607 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:42:48,607 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:42:48,619 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-05 15:42:48,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-02-05 15:42:48,808 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:42:48,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:42:48,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1844377368, now seen corresponding path program 1 times [2025-02-05 15:42:48,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:42:48,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099088641] [2025-02-05 15:42:48,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:42:48,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:42:48,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-05 15:42:48,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-05 15:42:48,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:42:48,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:42:48,860 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:42:48,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:42:48,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099088641] [2025-02-05 15:42:48,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099088641] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:42:48,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:42:48,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:42:48,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557265565] [2025-02-05 15:42:48,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:42:48,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:42:48,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:42:48,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:42:48,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:42:48,862 INFO L87 Difference]: Start difference. First operand 673 states and 1100 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:42:48,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:42:48,894 INFO L93 Difference]: Finished difference Result 1571 states and 2613 transitions. [2025-02-05 15:42:48,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:42:48,895 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 134 [2025-02-05 15:42:48,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:42:48,934 INFO L225 Difference]: With dead ends: 1571 [2025-02-05 15:42:48,935 INFO L226 Difference]: Without dead ends: 976 [2025-02-05 15:42:48,937 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:42:48,937 INFO L435 NwaCegarLoop]: 437 mSDtfsCounter, 104 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 858 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:42:48,937 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 858 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:42:48,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2025-02-05 15:42:48,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 968. [2025-02-05 15:42:48,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 968 states, 765 states have (on average 1.603921568627451) internal successors, (1227), 769 states have internal predecessors, (1227), 180 states have call successors, (180), 19 states have call predecessors, (180), 22 states have return successors, (211), 179 states have call predecessors, (211), 179 states have call successors, (211) [2025-02-05 15:42:48,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 968 states and 1618 transitions. [2025-02-05 15:42:48,980 INFO L78 Accepts]: Start accepts. Automaton has 968 states and 1618 transitions. Word has length 134 [2025-02-05 15:42:48,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:42:48,980 INFO L471 AbstractCegarLoop]: Abstraction has 968 states and 1618 transitions. [2025-02-05 15:42:48,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:42:48,980 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1618 transitions. [2025-02-05 15:42:48,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-02-05 15:42:48,985 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:42:48,985 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] [2025-02-05 15:42:48,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 15:42:48,985 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:42:48,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:42:48,986 INFO L85 PathProgramCache]: Analyzing trace with hash 845180141, now seen corresponding path program 1 times [2025-02-05 15:42:48,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:42:48,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148159922] [2025-02-05 15:42:48,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:42:48,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:42:49,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-05 15:42:49,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-05 15:42:49,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:42:49,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:42:49,035 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:42:49,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:42:49,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148159922] [2025-02-05 15:42:49,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148159922] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:42:49,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:42:49,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:42:49,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464551431] [2025-02-05 15:42:49,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:42:49,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:42:49,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:42:49,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:42:49,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:42:49,037 INFO L87 Difference]: Start difference. First operand 968 states and 1618 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:42:49,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:42:49,084 INFO L93 Difference]: Finished difference Result 2300 states and 3866 transitions. [2025-02-05 15:42:49,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:42:49,085 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 135 [2025-02-05 15:42:49,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:42:49,093 INFO L225 Difference]: With dead ends: 2300 [2025-02-05 15:42:49,093 INFO L226 Difference]: Without dead ends: 1461 [2025-02-05 15:42:49,096 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:42:49,096 INFO L435 NwaCegarLoop]: 433 mSDtfsCounter, 102 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 858 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:42:49,096 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 858 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:42:49,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1461 states. [2025-02-05 15:42:49,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1461 to 1453. [2025-02-05 15:42:49,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1453 states, 1155 states have (on average 1.6112554112554112) internal successors, (1861), 1159 states have internal predecessors, (1861), 275 states have call successors, (275), 19 states have call predecessors, (275), 22 states have return successors, (306), 274 states have call predecessors, (306), 274 states have call successors, (306) [2025-02-05 15:42:49,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1453 states to 1453 states and 2442 transitions. [2025-02-05 15:42:49,166 INFO L78 Accepts]: Start accepts. Automaton has 1453 states and 2442 transitions. Word has length 135 [2025-02-05 15:42:49,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:42:49,167 INFO L471 AbstractCegarLoop]: Abstraction has 1453 states and 2442 transitions. [2025-02-05 15:42:49,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:42:49,167 INFO L276 IsEmpty]: Start isEmpty. Operand 1453 states and 2442 transitions. [2025-02-05 15:42:49,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-02-05 15:42:49,174 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:42:49,175 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:42:49,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 15:42:49,175 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:42:49,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:42:49,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1726035113, now seen corresponding path program 1 times [2025-02-05 15:42:49,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:42:49,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981454384] [2025-02-05 15:42:49,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:42:49,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:42:49,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-02-05 15:42:49,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-02-05 15:42:49,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:42:49,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:42:49,290 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:42:49,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:42:49,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981454384] [2025-02-05 15:42:49,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981454384] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:42:49,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:42:49,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:42:49,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789043799] [2025-02-05 15:42:49,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:42:49,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:42:49,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:42:49,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:42:49,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:42:49,291 INFO L87 Difference]: Start difference. First operand 1453 states and 2442 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:42:49,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:42:49,406 INFO L93 Difference]: Finished difference Result 3384 states and 5732 transitions. [2025-02-05 15:42:49,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:42:49,407 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 136 [2025-02-05 15:42:49,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:42:49,417 INFO L225 Difference]: With dead ends: 3384 [2025-02-05 15:42:49,417 INFO L226 Difference]: Without dead ends: 2192 [2025-02-05 15:42:49,421 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:42:49,422 INFO L435 NwaCegarLoop]: 431 mSDtfsCounter, 100 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 853 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:42:49,422 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 853 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:42:49,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2192 states. [2025-02-05 15:42:49,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2192 to 2184. [2025-02-05 15:42:49,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2184 states, 1763 states have (on average 1.6171298922291548) internal successors, (2851), 1767 states have internal predecessors, (2851), 398 states have call successors, (398), 19 states have call predecessors, (398), 22 states have return successors, (445), 397 states have call predecessors, (445), 397 states have call successors, (445) [2025-02-05 15:42:49,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2184 states to 2184 states and 3694 transitions. [2025-02-05 15:42:49,531 INFO L78 Accepts]: Start accepts. Automaton has 2184 states and 3694 transitions. Word has length 136 [2025-02-05 15:42:49,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:42:49,531 INFO L471 AbstractCegarLoop]: Abstraction has 2184 states and 3694 transitions. [2025-02-05 15:42:49,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:42:49,531 INFO L276 IsEmpty]: Start isEmpty. Operand 2184 states and 3694 transitions. [2025-02-05 15:42:49,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-02-05 15:42:49,542 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:42:49,542 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:42:49,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 15:42:49,542 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:42:49,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:42:49,543 INFO L85 PathProgramCache]: Analyzing trace with hash -408646772, now seen corresponding path program 1 times [2025-02-05 15:42:49,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:42:49,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31788382] [2025-02-05 15:42:49,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:42:49,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:42:49,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-02-05 15:42:49,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-02-05 15:42:49,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:42:49,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:42:49,608 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:42:49,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:42:49,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31788382] [2025-02-05 15:42:49,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31788382] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:42:49,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:42:49,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:42:49,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679501892] [2025-02-05 15:42:49,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:42:49,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:42:49,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:42:49,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:42:49,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:42:49,610 INFO L87 Difference]: Start difference. First operand 2184 states and 3694 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:42:49,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:42:49,786 INFO L93 Difference]: Finished difference Result 5062 states and 8624 transitions. [2025-02-05 15:42:49,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:42:49,786 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 137 [2025-02-05 15:42:49,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:42:49,807 INFO L225 Difference]: With dead ends: 5062 [2025-02-05 15:42:49,807 INFO L226 Difference]: Without dead ends: 3354 [2025-02-05 15:42:49,815 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:42:49,815 INFO L435 NwaCegarLoop]: 431 mSDtfsCounter, 98 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 853 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:42:49,816 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 853 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:42:49,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3354 states. [2025-02-05 15:42:50,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3354 to 3346. [2025-02-05 15:42:50,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3346 states, 2746 states have (on average 1.6209031318281135) internal successors, (4451), 2750 states have internal predecessors, (4451), 577 states have call successors, (577), 19 states have call predecessors, (577), 22 states have return successors, (650), 576 states have call predecessors, (650), 576 states have call successors, (650) [2025-02-05 15:42:50,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3346 states to 3346 states and 5678 transitions. [2025-02-05 15:42:50,055 INFO L78 Accepts]: Start accepts. Automaton has 3346 states and 5678 transitions. Word has length 137 [2025-02-05 15:42:50,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:42:50,055 INFO L471 AbstractCegarLoop]: Abstraction has 3346 states and 5678 transitions. [2025-02-05 15:42:50,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:42:50,055 INFO L276 IsEmpty]: Start isEmpty. Operand 3346 states and 5678 transitions. [2025-02-05 15:42:50,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-02-05 15:42:50,072 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:42:50,072 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] [2025-02-05 15:42:50,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 15:42:50,073 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:42:50,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:42:50,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1908855990, now seen corresponding path program 1 times [2025-02-05 15:42:50,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:42:50,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622862821] [2025-02-05 15:42:50,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:42:50,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:42:50,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-02-05 15:42:50,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-02-05 15:42:50,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:42:50,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:42:50,136 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:42:50,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:42:50,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622862821] [2025-02-05 15:42:50,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622862821] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:42:50,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:42:50,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:42:50,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971982364] [2025-02-05 15:42:50,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:42:50,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:42:50,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:42:50,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:42:50,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:42:50,138 INFO L87 Difference]: Start difference. First operand 3346 states and 5678 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:42:50,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:42:50,338 INFO L93 Difference]: Finished difference Result 8079 states and 13784 transitions. [2025-02-05 15:42:50,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:42:50,339 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 138 [2025-02-05 15:42:50,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:42:50,366 INFO L225 Difference]: With dead ends: 8079 [2025-02-05 15:42:50,366 INFO L226 Difference]: Without dead ends: 5456 [2025-02-05 15:42:50,374 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:42:50,375 INFO L435 NwaCegarLoop]: 443 mSDtfsCounter, 96 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 872 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:42:50,375 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 872 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:42:50,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5456 states. [2025-02-05 15:42:50,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5456 to 5448. [2025-02-05 15:42:50,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5448 states, 4472 states have (on average 1.6140429338103757) internal successors, (7218), 4476 states have internal predecessors, (7218), 953 states have call successors, (953), 19 states have call predecessors, (953), 22 states have return successors, (1070), 952 states have call predecessors, (1070), 952 states have call successors, (1070) [2025-02-05 15:42:50,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5448 states to 5448 states and 9241 transitions. [2025-02-05 15:42:50,640 INFO L78 Accepts]: Start accepts. Automaton has 5448 states and 9241 transitions. Word has length 138 [2025-02-05 15:42:50,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:42:50,640 INFO L471 AbstractCegarLoop]: Abstraction has 5448 states and 9241 transitions. [2025-02-05 15:42:50,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:42:50,641 INFO L276 IsEmpty]: Start isEmpty. Operand 5448 states and 9241 transitions. [2025-02-05 15:42:50,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-02-05 15:42:50,666 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:42:50,666 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] [2025-02-05 15:42:50,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 15:42:50,666 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:42:50,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:42:50,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1162703595, now seen corresponding path program 1 times [2025-02-05 15:42:50,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:42:50,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857569278] [2025-02-05 15:42:50,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:42:50,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:42:50,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-02-05 15:42:50,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-02-05 15:42:50,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:42:50,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:42:50,727 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:42:50,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:42:50,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857569278] [2025-02-05 15:42:50,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857569278] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:42:50,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:42:50,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:42:50,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897969532] [2025-02-05 15:42:50,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:42:50,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:42:50,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:42:50,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:42:50,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:42:50,730 INFO L87 Difference]: Start difference. First operand 5448 states and 9241 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, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:42:50,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:42:50,999 INFO L93 Difference]: Finished difference Result 13396 states and 22869 transitions. [2025-02-05 15:42:50,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:42:51,000 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, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 139 [2025-02-05 15:42:51,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:42:51,050 INFO L225 Difference]: With dead ends: 13396 [2025-02-05 15:42:51,050 INFO L226 Difference]: Without dead ends: 9067 [2025-02-05 15:42:51,067 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:42:51,067 INFO L435 NwaCegarLoop]: 435 mSDtfsCounter, 94 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 860 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:42:51,067 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 860 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:42:51,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9067 states. [2025-02-05 15:42:51,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9067 to 9059. [2025-02-05 15:42:51,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9059 states, 7477 states have (on average 1.6120101645044804) internal successors, (12053), 7481 states have internal predecessors, (12053), 1559 states have call successors, (1559), 19 states have call predecessors, (1559), 22 states have return successors, (1754), 1558 states have call predecessors, (1754), 1558 states have call successors, (1754) [2025-02-05 15:42:51,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9059 states to 9059 states and 15366 transitions. [2025-02-05 15:42:51,453 INFO L78 Accepts]: Start accepts. Automaton has 9059 states and 15366 transitions. Word has length 139 [2025-02-05 15:42:51,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:42:51,453 INFO L471 AbstractCegarLoop]: Abstraction has 9059 states and 15366 transitions. [2025-02-05 15:42:51,454 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, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:42:51,454 INFO L276 IsEmpty]: Start isEmpty. Operand 9059 states and 15366 transitions. [2025-02-05 15:42:51,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-02-05 15:42:51,483 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:42:51,483 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:42:51,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 15:42:51,484 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:42:51,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:42:51,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1437568587, now seen corresponding path program 1 times [2025-02-05 15:42:51,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:42:51,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738723911] [2025-02-05 15:42:51,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:42:51,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:42:51,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-02-05 15:42:51,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-02-05 15:42:51,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:42:51,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:42:51,530 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:42:51,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:42:51,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738723911] [2025-02-05 15:42:51,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738723911] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:42:51,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:42:51,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:42:51,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907413275] [2025-02-05 15:42:51,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:42:51,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:42:51,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:42:51,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:42:51,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:42:51,533 INFO L87 Difference]: Start difference. First operand 9059 states and 15366 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, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:42:52,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:42:52,004 INFO L93 Difference]: Finished difference Result 23378 states and 39827 transitions. [2025-02-05 15:42:52,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:42:52,005 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, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 140 [2025-02-05 15:42:52,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:42:52,075 INFO L225 Difference]: With dead ends: 23378 [2025-02-05 15:42:52,076 INFO L226 Difference]: Without dead ends: 15883 [2025-02-05 15:42:52,111 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:42:52,111 INFO L435 NwaCegarLoop]: 447 mSDtfsCounter, 92 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 876 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:42:52,112 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 876 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:42:52,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15883 states. [2025-02-05 15:42:52,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15883 to 15875. [2025-02-05 15:42:52,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15875 states, 13090 states have (on average 1.6032085561497327) internal successors, (20986), 13094 states have internal predecessors, (20986), 2762 states have call successors, (2762), 19 states have call predecessors, (2762), 22 states have return successors, (3101), 2761 states have call predecessors, (3101), 2761 states have call successors, (3101) [2025-02-05 15:42:52,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15875 states to 15875 states and 26849 transitions. [2025-02-05 15:42:52,827 INFO L78 Accepts]: Start accepts. Automaton has 15875 states and 26849 transitions. Word has length 140 [2025-02-05 15:42:52,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:42:52,827 INFO L471 AbstractCegarLoop]: Abstraction has 15875 states and 26849 transitions. [2025-02-05 15:42:52,828 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, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:42:52,828 INFO L276 IsEmpty]: Start isEmpty. Operand 15875 states and 26849 transitions. [2025-02-05 15:42:52,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-02-05 15:42:52,872 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:42:52,872 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:42:52,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 15:42:52,873 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:42:52,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:42:52,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1486427766, now seen corresponding path program 1 times [2025-02-05 15:42:52,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:42:52,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831405020] [2025-02-05 15:42:52,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:42:52,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:42:52,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-02-05 15:42:52,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-02-05 15:42:52,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:42:52,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:42:52,931 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:42:52,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:42:52,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831405020] [2025-02-05 15:42:52,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831405020] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:42:52,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:42:52,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:42:52,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320806630] [2025-02-05 15:42:52,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:42:52,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:42:52,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:42:52,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:42:52,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:42:52,932 INFO L87 Difference]: Start difference. First operand 15875 states and 26849 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:42:53,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:42:53,496 INFO L93 Difference]: Finished difference Result 41949 states and 71289 transitions. [2025-02-05 15:42:53,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:42:53,497 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 141 [2025-02-05 15:42:53,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:42:53,608 INFO L225 Difference]: With dead ends: 41949 [2025-02-05 15:42:53,608 INFO L226 Difference]: Without dead ends: 28272 [2025-02-05 15:42:53,661 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:42:53,662 INFO L435 NwaCegarLoop]: 431 mSDtfsCounter, 90 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 856 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:42:53,662 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 856 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:42:53,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28272 states. [2025-02-05 15:42:54,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28272 to 28264. [2025-02-05 15:42:54,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28264 states, 23440 states have (on average 1.5992747440273039) internal successors, (37487), 23444 states have internal predecessors, (37487), 4801 states have call successors, (4801), 19 states have call predecessors, (4801), 22 states have return successors, (5414), 4800 states have call predecessors, (5414), 4800 states have call successors, (5414) [2025-02-05 15:42:54,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28264 states to 28264 states and 47702 transitions. [2025-02-05 15:42:54,913 INFO L78 Accepts]: Start accepts. Automaton has 28264 states and 47702 transitions. Word has length 141 [2025-02-05 15:42:54,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:42:54,914 INFO L471 AbstractCegarLoop]: Abstraction has 28264 states and 47702 transitions. [2025-02-05 15:42:54,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:42:54,914 INFO L276 IsEmpty]: Start isEmpty. Operand 28264 states and 47702 transitions. [2025-02-05 15:42:54,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-02-05 15:42:54,965 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:42:54,965 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, 1] [2025-02-05 15:42:54,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 15:42:54,965 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:42:54,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:42:54,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1285086764, now seen corresponding path program 1 times [2025-02-05 15:42:54,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:42:54,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293936288] [2025-02-05 15:42:54,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:42:54,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:42:54,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-02-05 15:42:54,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-02-05 15:42:54,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:42:54,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:42:55,029 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:42:55,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:42:55,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293936288] [2025-02-05 15:42:55,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293936288] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:42:55,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:42:55,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:42:55,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59474651] [2025-02-05 15:42:55,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:42:55,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:42:55,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:42:55,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:42:55,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:42:55,032 INFO L87 Difference]: Start difference. First operand 28264 states and 47702 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, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:42:56,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:42:56,309 INFO L93 Difference]: Finished difference Result 76931 states and 130341 transitions. [2025-02-05 15:42:56,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:42:56,310 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, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 142 [2025-02-05 15:42:56,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:42:56,518 INFO L225 Difference]: With dead ends: 76931 [2025-02-05 15:42:56,518 INFO L226 Difference]: Without dead ends: 51628 [2025-02-05 15:42:56,588 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:42:56,588 INFO L435 NwaCegarLoop]: 433 mSDtfsCounter, 88 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 858 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:42:56,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 858 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:42:56,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51628 states. [2025-02-05 15:42:58,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51628 to 51620. [2025-02-05 15:42:58,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51620 states, 43081 states have (on average 1.593904505466447) internal successors, (68667), 43085 states have internal predecessors, (68667), 8516 states have call successors, (8516), 19 states have call predecessors, (8516), 22 states have return successors, (9661), 8515 states have call predecessors, (9661), 8515 states have call successors, (9661) [2025-02-05 15:42:58,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51620 states to 51620 states and 86844 transitions. [2025-02-05 15:42:58,334 INFO L78 Accepts]: Start accepts. Automaton has 51620 states and 86844 transitions. Word has length 142 [2025-02-05 15:42:58,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:42:58,335 INFO L471 AbstractCegarLoop]: Abstraction has 51620 states and 86844 transitions. [2025-02-05 15:42:58,335 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, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:42:58,335 INFO L276 IsEmpty]: Start isEmpty. Operand 51620 states and 86844 transitions. [2025-02-05 15:42:58,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-02-05 15:42:58,382 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:42:58,382 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, 1, 1] [2025-02-05 15:42:58,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 15:42:58,383 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:42:58,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:42:58,383 INFO L85 PathProgramCache]: Analyzing trace with hash -918087799, now seen corresponding path program 1 times [2025-02-05 15:42:58,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:42:58,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180091247] [2025-02-05 15:42:58,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:42:58,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:42:58,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-05 15:42:58,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-05 15:42:58,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:42:58,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:42:58,429 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:42:58,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:42:58,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180091247] [2025-02-05 15:42:58,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180091247] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:42:58,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:42:58,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:42:58,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78654103] [2025-02-05 15:42:58,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:42:58,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:42:58,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:42:58,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:42:58,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:42:58,431 INFO L87 Difference]: Start difference. First operand 51620 states and 86844 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:43:01,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:43:01,254 INFO L93 Difference]: Finished difference Result 96192 states and 162192 transitions. [2025-02-05 15:43:01,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:43:01,255 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 143 [2025-02-05 15:43:01,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:43:01,729 INFO L225 Difference]: With dead ends: 96192 [2025-02-05 15:43:01,729 INFO L226 Difference]: Without dead ends: 96054 [2025-02-05 15:43:01,798 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:01,799 INFO L435 NwaCegarLoop]: 440 mSDtfsCounter, 83 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 870 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:43:01,799 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 870 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:43:01,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96054 states. [2025-02-05 15:43:05,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96054 to 96046. [2025-02-05 15:43:05,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96046 states, 80708 states have (on average 1.5869678346632303) internal successors, (128081), 80712 states have internal predecessors, (128081), 15315 states have call successors, (15315), 19 states have call predecessors, (15315), 22 states have return successors, (17506), 15314 states have call predecessors, (17506), 15314 states have call successors, (17506) [2025-02-05 15:43:05,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96046 states to 96046 states and 160902 transitions. [2025-02-05 15:43:05,882 INFO L78 Accepts]: Start accepts. Automaton has 96046 states and 160902 transitions. Word has length 143 [2025-02-05 15:43:05,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:43:05,883 INFO L471 AbstractCegarLoop]: Abstraction has 96046 states and 160902 transitions. [2025-02-05 15:43:05,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:43:05,883 INFO L276 IsEmpty]: Start isEmpty. Operand 96046 states and 160902 transitions. [2025-02-05 15:43:05,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-02-05 15:43:05,960 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:43:05,960 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, 1, 1, 1] [2025-02-05 15:43:05,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 15:43:05,961 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:43:05,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:43:05,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1161036211, now seen corresponding path program 1 times [2025-02-05 15:43:05,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:43:05,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009101679] [2025-02-05 15:43:05,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:43:05,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:43:05,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-02-05 15:43:05,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-02-05 15:43:05,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:43:05,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:43:06,128 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:06,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:43:06,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009101679] [2025-02-05 15:43:06,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009101679] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:43:06,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:43:06,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:43:06,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911188128] [2025-02-05 15:43:06,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:43:06,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:43:06,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:43:06,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:43:06,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:43:06,131 INFO L87 Difference]: Start difference. First operand 96046 states and 160902 transitions. Second operand has 6 states, 6 states have (on average 16.5) internal successors, (99), 5 states have internal predecessors, (99), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:43:08,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:43:08,435 INFO L93 Difference]: Finished difference Result 96312 states and 161267 transitions. [2025-02-05 15:43:08,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 15:43:08,439 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 5 states have internal predecessors, (99), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) Word has length 144 [2025-02-05 15:43:08,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:43:08,746 INFO L225 Difference]: With dead ends: 96312 [2025-02-05 15:43:08,746 INFO L226 Difference]: Without dead ends: 96182 [2025-02-05 15:43:08,781 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 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:43:08,786 INFO L435 NwaCegarLoop]: 442 mSDtfsCounter, 365 mSDsluCounter, 1412 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 1854 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:43:08,787 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 1854 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:43:08,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96182 states. [2025-02-05 15:43:11,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96182 to 96178. [2025-02-05 15:43:11,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96178 states, 80815 states have (on average 1.5867722576254408) internal successors, (128235), 80819 states have internal predecessors, (128235), 15328 states have call successors, (15328), 29 states have call predecessors, (15328), 34 states have return successors, (17521), 15329 states have call predecessors, (17521), 15326 states have call successors, (17521) [2025-02-05 15:43:12,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96178 states to 96178 states and 161084 transitions. [2025-02-05 15:43:12,473 INFO L78 Accepts]: Start accepts. Automaton has 96178 states and 161084 transitions. Word has length 144 [2025-02-05 15:43:12,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:43:12,474 INFO L471 AbstractCegarLoop]: Abstraction has 96178 states and 161084 transitions. [2025-02-05 15:43:12,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 5 states have internal predecessors, (99), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:43:12,474 INFO L276 IsEmpty]: Start isEmpty. Operand 96178 states and 161084 transitions. [2025-02-05 15:43:12,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-02-05 15:43:12,560 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:43:12,561 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, 1, 1, 1, 1] [2025-02-05 15:43:12,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-05 15:43:12,561 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:43:12,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:43:12,562 INFO L85 PathProgramCache]: Analyzing trace with hash 157885959, now seen corresponding path program 1 times [2025-02-05 15:43:12,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:43:12,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031737056] [2025-02-05 15:43:12,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:43:12,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:43:12,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-05 15:43:12,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-05 15:43:12,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:43:12,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:43:13,330 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:13,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:43:13,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031737056] [2025-02-05 15:43:13,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031737056] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:43:13,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:43:13,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-05 15:43:13,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549583075] [2025-02-05 15:43:13,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:43:13,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 15:43:13,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:43:13,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 15:43:13,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2025-02-05 15:43:13,332 INFO L87 Difference]: Start difference. First operand 96178 states and 161084 transitions. Second operand has 13 states, 11 states have (on average 9.090909090909092) internal successors, (100), 12 states have internal predecessors, (100), 8 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 6 states have call predecessors, (15), 7 states have call successors, (15) [2025-02-05 15:43:15,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:43:15,509 INFO L93 Difference]: Finished difference Result 96541 states and 161589 transitions. [2025-02-05 15:43:15,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 15:43:15,510 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 9.090909090909092) internal successors, (100), 12 states have internal predecessors, (100), 8 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 6 states have call predecessors, (15), 7 states have call successors, (15) Word has length 145 [2025-02-05 15:43:15,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:43:15,879 INFO L225 Difference]: With dead ends: 96541 [2025-02-05 15:43:15,879 INFO L226 Difference]: Without dead ends: 96235 [2025-02-05 15:43:15,933 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2025-02-05 15:43:15,934 INFO L435 NwaCegarLoop]: 421 mSDtfsCounter, 132 mSDsluCounter, 4618 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 5039 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:43:15,934 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 5039 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:43:16,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96235 states.