./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec8_product15.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 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_spec8_product15.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 b1bbd85396e3eb1de7562114efc1b104d28592355874c6166c296894ed6f999d --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 03:56:38,029 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 03:56:38,086 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 03:56:38,090 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 03:56:38,091 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 03:56:38,119 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 03:56:38,120 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 03:56:38,120 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 03:56:38,120 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 03:56:38,120 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 03:56:38,121 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 03:56:38,121 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 03:56:38,122 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 03:56:38,122 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 03:56:38,122 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 03:56:38,122 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 03:56:38,122 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 03:56:38,122 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 03:56:38,123 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 03:56:38,123 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 03:56:38,123 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 03:56:38,123 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 03:56:38,123 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 03:56:38,123 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 03:56:38,123 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 03:56:38,123 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 03:56:38,123 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 03:56:38,123 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 03:56:38,123 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 03:56:38,123 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:56:38,124 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:56:38,124 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:56:38,124 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:56:38,124 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 03:56:38,124 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:56:38,124 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:56:38,124 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:56:38,124 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:56:38,124 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 03:56:38,124 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 03:56:38,125 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 03:56:38,125 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 03:56:38,125 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 03:56:38,125 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 03:56:38,125 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 03:56:38,125 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 03:56:38,125 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 03:56:38,125 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 03:56:38,125 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 -> b1bbd85396e3eb1de7562114efc1b104d28592355874c6166c296894ed6f999d [2025-01-09 03:56:38,362 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 03:56:38,370 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 03:56:38,372 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 03:56:38,374 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 03:56:38,374 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 03:56:38,375 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec8_product15.cil.c [2025-01-09 03:56:39,599 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/32aa4294e/ea25e6004a3147239ec7678b387cd341/FLAGc59609138 [2025-01-09 03:56:39,944 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 03:56:39,947 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec8_product15.cil.c [2025-01-09 03:56:39,966 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/32aa4294e/ea25e6004a3147239ec7678b387cd341/FLAGc59609138 [2025-01-09 03:56:39,983 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/32aa4294e/ea25e6004a3147239ec7678b387cd341 [2025-01-09 03:56:39,985 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 03:56:39,986 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 03:56:39,988 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 03:56:39,989 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 03:56:39,993 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 03:56:39,994 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:56:39" (1/1) ... [2025-01-09 03:56:39,994 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@476ef7bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:56:39, skipping insertion in model container [2025-01-09 03:56:39,994 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:56:39" (1/1) ... [2025-01-09 03:56:40,035 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 03:56:40,415 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_spec8_product15.cil.c[44955,44968] [2025-01-09 03:56:40,492 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:56:40,505 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 03:56:40,512 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [48] [2025-01-09 03:56:40,514 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [460] [2025-01-09 03:56:40,514 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [750] [2025-01-09 03:56:40,514 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [1824] [2025-01-09 03:56:40,514 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EncryptAutoResponder_spec.i","") [2112] [2025-01-09 03:56:40,515 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [2155] [2025-01-09 03:56:40,515 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [2164] [2025-01-09 03:56:40,515 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [2268] [2025-01-09 03:56:40,515 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [2484] [2025-01-09 03:56:40,515 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [2501] [2025-01-09 03:56:40,515 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [2867] [2025-01-09 03:56:40,579 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_spec8_product15.cil.c[44955,44968] [2025-01-09 03:56:40,594 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:56:40,619 INFO L204 MainTranslator]: Completed translation [2025-01-09 03:56:40,621 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:56:40 WrapperNode [2025-01-09 03:56:40,621 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 03:56:40,622 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 03:56:40,623 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 03:56:40,623 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 03:56:40,628 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:56:40" (1/1) ... [2025-01-09 03:56:40,651 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:56:40" (1/1) ... [2025-01-09 03:56:40,697 INFO L138 Inliner]: procedures = 126, calls = 185, calls flagged for inlining = 55, calls inlined = 46, statements flattened = 889 [2025-01-09 03:56:40,701 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 03:56:40,701 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 03:56:40,704 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 03:56:40,705 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 03:56:40,712 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:56:40" (1/1) ... [2025-01-09 03:56:40,712 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:56:40" (1/1) ... [2025-01-09 03:56:40,715 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:56:40" (1/1) ... [2025-01-09 03:56:40,748 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-01-09 03:56:40,749 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:56:40" (1/1) ... [2025-01-09 03:56:40,750 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:56:40" (1/1) ... [2025-01-09 03:56:40,771 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:56:40" (1/1) ... [2025-01-09 03:56:40,773 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:56:40" (1/1) ... [2025-01-09 03:56:40,779 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:56:40" (1/1) ... [2025-01-09 03:56:40,788 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:56:40" (1/1) ... [2025-01-09 03:56:40,794 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:56:40" (1/1) ... [2025-01-09 03:56:40,801 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 03:56:40,805 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 03:56:40,805 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 03:56:40,805 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 03:56:40,806 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:56:40" (1/1) ... [2025-01-09 03:56:40,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:56:40,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:56:40,835 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-01-09 03:56:40,842 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-01-09 03:56:40,857 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2025-01-09 03:56:40,857 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2025-01-09 03:56:40,857 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2025-01-09 03:56:40,857 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2025-01-09 03:56:40,857 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-01-09 03:56:40,857 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-01-09 03:56:40,857 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-01-09 03:56:40,858 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-01-09 03:56:40,858 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-01-09 03:56:40,858 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-01-09 03:56:40,858 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2025-01-09 03:56:40,858 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2025-01-09 03:56:40,858 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-01-09 03:56:40,858 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-01-09 03:56:40,858 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-01-09 03:56:40,858 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-01-09 03:56:40,858 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-01-09 03:56:40,858 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-01-09 03:56:40,858 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 03:56:40,858 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-01-09 03:56:40,858 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-01-09 03:56:40,858 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-01-09 03:56:40,858 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-01-09 03:56:40,859 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-01-09 03:56:40,859 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-01-09 03:56:40,859 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-01-09 03:56:40,859 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-01-09 03:56:40,859 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2025-01-09 03:56:40,859 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2025-01-09 03:56:40,859 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-01-09 03:56:40,859 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-01-09 03:56:40,859 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-01-09 03:56:40,859 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-01-09 03:56:40,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 03:56:40,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 03:56:40,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 03:56:40,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 03:56:40,859 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-01-09 03:56:40,859 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-01-09 03:56:40,859 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 03:56:40,859 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 03:56:40,990 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 03:56:40,991 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 03:56:41,563 INFO L? ?]: Removed 376 outVars from TransFormulas that were not future-live. [2025-01-09 03:56:41,563 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 03:56:41,580 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 03:56:41,583 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 03:56:41,583 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:56:41 BoogieIcfgContainer [2025-01-09 03:56:41,583 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 03:56:41,585 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 03:56:41,585 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 03:56:41,589 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 03:56:41,589 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:56:39" (1/3) ... [2025-01-09 03:56:41,590 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e87fa30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:56:41, skipping insertion in model container [2025-01-09 03:56:41,590 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:56:40" (2/3) ... [2025-01-09 03:56:41,590 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e87fa30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:56:41, skipping insertion in model container [2025-01-09 03:56:41,591 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:56:41" (3/3) ... [2025-01-09 03:56:41,592 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec8_product15.cil.c [2025-01-09 03:56:41,604 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 03:56:41,606 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec8_product15.cil.c that has 18 procedures, 286 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 03:56:41,662 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 03:56:41,669 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;@7acc0ce9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 03:56:41,669 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 03:56:41,673 INFO L276 IsEmpty]: Start isEmpty. Operand has 286 states, 225 states have (on average 1.5422222222222222) internal successors, (347), 229 states have internal predecessors, (347), 42 states have call successors, (42), 17 states have call predecessors, (42), 17 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-01-09 03:56:41,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-09 03:56:41,689 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:56:41,690 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] [2025-01-09 03:56:41,691 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:56:41,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:56:41,696 INFO L85 PathProgramCache]: Analyzing trace with hash 2022454607, now seen corresponding path program 1 times [2025-01-09 03:56:41,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:56:41,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730437569] [2025-01-09 03:56:41,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:56:41,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:56:41,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 03:56:41,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 03:56:41,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:56:41,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:56:42,206 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-09 03:56:42,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:56:42,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730437569] [2025-01-09 03:56:42,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730437569] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:56:42,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [377890981] [2025-01-09 03:56:42,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:56:42,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:56:42,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:56:42,212 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-01-09 03:56:42,213 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-01-09 03:56:42,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 03:56:42,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 03:56:42,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:56:42,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:56:42,472 INFO L256 TraceCheckSpWp]: Trace formula consists of 919 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 03:56:42,477 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:56:42,488 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-01-09 03:56:42,488 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:56:42,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [377890981] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:56:42,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:56:42,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 5 [2025-01-09 03:56:42,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733196604] [2025-01-09 03:56:42,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:56:42,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 03:56:42,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:56:42,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 03:56:42,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:56:42,510 INFO L87 Difference]: Start difference. First operand has 286 states, 225 states have (on average 1.5422222222222222) internal successors, (347), 229 states have internal predecessors, (347), 42 states have call successors, (42), 17 states have call predecessors, (42), 17 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 03:56:42,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:56:42,544 INFO L93 Difference]: Finished difference Result 419 states and 618 transitions. [2025-01-09 03:56:42,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 03:56:42,546 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 89 [2025-01-09 03:56:42,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:56:42,553 INFO L225 Difference]: With dead ends: 419 [2025-01-09 03:56:42,553 INFO L226 Difference]: Without dead ends: 279 [2025-01-09 03:56:42,556 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 90 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-01-09 03:56:42,558 INFO L435 NwaCegarLoop]: 428 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, 428 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-01-09 03:56:42,559 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:56:42,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2025-01-09 03:56:42,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 279. [2025-01-09 03:56:42,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 219 states have (on average 1.538812785388128) internal successors, (337), 222 states have internal predecessors, (337), 42 states have call successors, (42), 17 states have call predecessors, (42), 17 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2025-01-09 03:56:42,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 420 transitions. [2025-01-09 03:56:42,600 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 420 transitions. Word has length 89 [2025-01-09 03:56:42,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:56:42,601 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 420 transitions. [2025-01-09 03:56:42,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 03:56:42,601 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 420 transitions. [2025-01-09 03:56:42,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-09 03:56:42,604 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:56:42,604 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] [2025-01-09 03:56:42,613 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-01-09 03:56:42,806 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-01-09 03:56:42,808 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:56:42,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:56:42,809 INFO L85 PathProgramCache]: Analyzing trace with hash 718943273, now seen corresponding path program 1 times [2025-01-09 03:56:42,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:56:42,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430873399] [2025-01-09 03:56:42,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:56:42,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:56:42,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 03:56:42,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 03:56:42,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:56:42,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:56:43,014 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-09 03:56:43,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:56:43,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430873399] [2025-01-09 03:56:43,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430873399] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:56:43,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1983158089] [2025-01-09 03:56:43,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:56:43,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:56:43,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:56:43,018 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-01-09 03:56:43,019 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-01-09 03:56:43,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 03:56:43,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 03:56:43,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:56:43,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:56:43,245 INFO L256 TraceCheckSpWp]: Trace formula consists of 919 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 03:56:43,248 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:56:43,266 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-01-09 03:56:43,268 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:56:43,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1983158089] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:56:43,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:56:43,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-01-09 03:56:43,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045099237] [2025-01-09 03:56:43,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:56:43,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:56:43,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:56:43,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:56:43,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:56:43,271 INFO L87 Difference]: Start difference. First operand 279 states and 420 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 03:56:43,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:56:43,301 INFO L93 Difference]: Finished difference Result 408 states and 599 transitions. [2025-01-09 03:56:43,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:56:43,301 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 89 [2025-01-09 03:56:43,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:56:43,303 INFO L225 Difference]: With dead ends: 408 [2025-01-09 03:56:43,303 INFO L226 Difference]: Without dead ends: 281 [2025-01-09 03:56:43,304 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 89 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-01-09 03:56:43,305 INFO L435 NwaCegarLoop]: 418 mSDtfsCounter, 1 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 834 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:56:43,305 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 834 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:56:43,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2025-01-09 03:56:43,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 280. [2025-01-09 03:56:43,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 220 states have (on average 1.5363636363636364) internal successors, (338), 223 states have internal predecessors, (338), 42 states have call successors, (42), 17 states have call predecessors, (42), 17 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2025-01-09 03:56:43,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 421 transitions. [2025-01-09 03:56:43,318 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 421 transitions. Word has length 89 [2025-01-09 03:56:43,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:56:43,319 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 421 transitions. [2025-01-09 03:56:43,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 03:56:43,319 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 421 transitions. [2025-01-09 03:56:43,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-01-09 03:56:43,321 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:56:43,321 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] [2025-01-09 03:56:43,329 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 03:56:43,523 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-01-09 03:56:43,523 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:56:43,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:56:43,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1346044470, now seen corresponding path program 1 times [2025-01-09 03:56:43,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:56:43,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590126131] [2025-01-09 03:56:43,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:56:43,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:56:43,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-09 03:56:43,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-09 03:56:43,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:56:43,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:56:43,719 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-01-09 03:56:43,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:56:43,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590126131] [2025-01-09 03:56:43,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590126131] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:56:43,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1093234627] [2025-01-09 03:56:43,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:56:43,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:56:43,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:56:43,723 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-01-09 03:56:43,724 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-01-09 03:56:43,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-09 03:56:43,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-09 03:56:43,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:56:43,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:56:43,941 INFO L256 TraceCheckSpWp]: Trace formula consists of 943 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 03:56:43,949 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:56:43,966 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-01-09 03:56:43,966 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:56:43,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1093234627] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:56:43,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:56:43,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-01-09 03:56:43,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915580631] [2025-01-09 03:56:43,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:56:43,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:56:43,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:56:43,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:56:43,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:56:43,967 INFO L87 Difference]: Start difference. First operand 280 states and 421 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 03:56:44,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:56:44,014 INFO L93 Difference]: Finished difference Result 590 states and 901 transitions. [2025-01-09 03:56:44,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:56:44,016 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 97 [2025-01-09 03:56:44,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:56:44,021 INFO L225 Difference]: With dead ends: 590 [2025-01-09 03:56:44,021 INFO L226 Difference]: Without dead ends: 336 [2025-01-09 03:56:44,023 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 97 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-01-09 03:56:44,025 INFO L435 NwaCegarLoop]: 432 mSDtfsCounter, 107 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 805 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-01-09 03:56:44,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 805 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:56:44,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2025-01-09 03:56:44,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 328. [2025-01-09 03:56:44,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 257 states have (on average 1.5525291828793775) internal successors, (399), 260 states have internal predecessors, (399), 53 states have call successors, (53), 17 states have call predecessors, (53), 17 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-01-09 03:56:44,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 504 transitions. [2025-01-09 03:56:44,051 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 504 transitions. Word has length 97 [2025-01-09 03:56:44,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:56:44,052 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 504 transitions. [2025-01-09 03:56:44,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 03:56:44,052 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 504 transitions. [2025-01-09 03:56:44,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-01-09 03:56:44,053 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:56:44,053 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] [2025-01-09 03:56:44,062 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-01-09 03:56:44,258 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-01-09 03:56:44,258 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:56:44,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:56:44,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1331145386, now seen corresponding path program 1 times [2025-01-09 03:56:44,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:56:44,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531721102] [2025-01-09 03:56:44,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:56:44,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:56:44,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 03:56:44,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 03:56:44,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:56:44,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:56:44,397 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-01-09 03:56:44,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:56:44,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531721102] [2025-01-09 03:56:44,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531721102] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:56:44,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [923202554] [2025-01-09 03:56:44,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:56:44,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:56:44,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:56:44,400 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-01-09 03:56:44,402 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-01-09 03:56:44,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 03:56:44,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 03:56:44,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:56:44,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:56:44,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 948 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 03:56:44,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:56:44,639 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-09 03:56:44,639 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:56:44,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [923202554] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:56:44,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:56:44,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-01-09 03:56:44,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895920846] [2025-01-09 03:56:44,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:56:44,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:56:44,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:56:44,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:56:44,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:56:44,641 INFO L87 Difference]: Start difference. First operand 328 states and 504 transitions. Second operand has 5 states, 4 states have (on average 17.0) internal successors, (68), 5 states have internal predecessors, (68), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2025-01-09 03:56:44,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:56:44,715 INFO L93 Difference]: Finished difference Result 647 states and 998 transitions. [2025-01-09 03:56:44,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:56:44,716 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.0) internal successors, (68), 5 states have internal predecessors, (68), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 98 [2025-01-09 03:56:44,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:56:44,718 INFO L225 Difference]: With dead ends: 647 [2025-01-09 03:56:44,720 INFO L226 Difference]: Without dead ends: 330 [2025-01-09 03:56:44,721 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 96 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-01-09 03:56:44,721 INFO L435 NwaCegarLoop]: 412 mSDtfsCounter, 2 mSDsluCounter, 1225 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1637 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-01-09 03:56:44,721 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1637 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:56:44,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2025-01-09 03:56:44,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 330. [2025-01-09 03:56:44,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 258 states have (on average 1.550387596899225) internal successors, (400), 262 states have internal predecessors, (400), 53 states have call successors, (53), 17 states have call predecessors, (53), 18 states have return successors, (54), 52 states have call predecessors, (54), 52 states have call successors, (54) [2025-01-09 03:56:44,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 507 transitions. [2025-01-09 03:56:44,737 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 507 transitions. Word has length 98 [2025-01-09 03:56:44,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:56:44,738 INFO L471 AbstractCegarLoop]: Abstraction has 330 states and 507 transitions. [2025-01-09 03:56:44,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.0) internal successors, (68), 5 states have internal predecessors, (68), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2025-01-09 03:56:44,738 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 507 transitions. [2025-01-09 03:56:44,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-09 03:56:44,741 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:56:44,742 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 03:56:44,750 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 03:56:44,942 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-01-09 03:56:44,943 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:56:44,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:56:44,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1187546237, now seen corresponding path program 1 times [2025-01-09 03:56:44,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:56:44,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730819847] [2025-01-09 03:56:44,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:56:44,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:56:44,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 03:56:44,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 03:56:44,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:56:44,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:56:45,079 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-01-09 03:56:45,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:56:45,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730819847] [2025-01-09 03:56:45,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730819847] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:56:45,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [624771] [2025-01-09 03:56:45,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:56:45,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:56:45,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:56:45,082 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-01-09 03:56:45,084 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-01-09 03:56:45,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 03:56:45,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 03:56:45,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:56:45,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:56:45,287 INFO L256 TraceCheckSpWp]: Trace formula consists of 949 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 03:56:45,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:56:45,331 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-09 03:56:45,332 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:56:45,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [624771] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:56:45,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:56:45,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-01-09 03:56:45,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134176450] [2025-01-09 03:56:45,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:56:45,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:56:45,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:56:45,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:56:45,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-01-09 03:56:45,334 INFO L87 Difference]: Start difference. First operand 330 states and 507 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-01-09 03:56:45,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:56:45,417 INFO L93 Difference]: Finished difference Result 649 states and 1003 transitions. [2025-01-09 03:56:45,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:56:45,418 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 99 [2025-01-09 03:56:45,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:56:45,420 INFO L225 Difference]: With dead ends: 649 [2025-01-09 03:56:45,420 INFO L226 Difference]: Without dead ends: 332 [2025-01-09 03:56:45,421 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-01-09 03:56:45,422 INFO L435 NwaCegarLoop]: 410 mSDtfsCounter, 2 mSDsluCounter, 1213 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1623 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:56:45,424 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1623 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:56:45,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2025-01-09 03:56:45,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 332. [2025-01-09 03:56:45,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 259 states have (on average 1.5482625482625483) internal successors, (401), 264 states have internal predecessors, (401), 53 states have call successors, (53), 17 states have call predecessors, (53), 19 states have return successors, (59), 52 states have call predecessors, (59), 52 states have call successors, (59) [2025-01-09 03:56:45,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 513 transitions. [2025-01-09 03:56:45,444 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 513 transitions. Word has length 99 [2025-01-09 03:56:45,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:56:45,444 INFO L471 AbstractCegarLoop]: Abstraction has 332 states and 513 transitions. [2025-01-09 03:56:45,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-01-09 03:56:45,445 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 513 transitions. [2025-01-09 03:56:45,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-09 03:56:45,446 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:56:45,447 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] [2025-01-09 03:56:45,454 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-09 03:56:45,647 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-01-09 03:56:45,648 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:56:45,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:56:45,649 INFO L85 PathProgramCache]: Analyzing trace with hash -824925054, now seen corresponding path program 1 times [2025-01-09 03:56:45,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:56:45,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799505368] [2025-01-09 03:56:45,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:56:45,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:56:45,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 03:56:45,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 03:56:45,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:56:45,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:56:45,776 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-01-09 03:56:45,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:56:45,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799505368] [2025-01-09 03:56:45,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799505368] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:56:45,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:56:45,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:56:45,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726433545] [2025-01-09 03:56:45,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:56:45,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:56:45,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:56:45,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:56:45,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:56:45,778 INFO L87 Difference]: Start difference. First operand 332 states and 513 transitions. Second operand has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2025-01-09 03:56:45,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:56:45,822 INFO L93 Difference]: Finished difference Result 641 states and 994 transitions. [2025-01-09 03:56:45,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:56:45,823 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 100 [2025-01-09 03:56:45,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:56:45,826 INFO L225 Difference]: With dead ends: 641 [2025-01-09 03:56:45,827 INFO L226 Difference]: Without dead ends: 332 [2025-01-09 03:56:45,828 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-01-09 03:56:45,831 INFO L435 NwaCegarLoop]: 413 mSDtfsCounter, 2 mSDsluCounter, 1228 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1641 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-01-09 03:56:45,831 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1641 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:56:45,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2025-01-09 03:56:45,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 332. [2025-01-09 03:56:45,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 259 states have (on average 1.5482625482625483) internal successors, (401), 264 states have internal predecessors, (401), 53 states have call successors, (53), 17 states have call predecessors, (53), 19 states have return successors, (58), 52 states have call predecessors, (58), 52 states have call successors, (58) [2025-01-09 03:56:45,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 512 transitions. [2025-01-09 03:56:45,851 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 512 transitions. Word has length 100 [2025-01-09 03:56:45,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:56:45,851 INFO L471 AbstractCegarLoop]: Abstraction has 332 states and 512 transitions. [2025-01-09 03:56:45,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2025-01-09 03:56:45,852 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 512 transitions. [2025-01-09 03:56:45,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-01-09 03:56:45,854 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:56:45,854 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] [2025-01-09 03:56:45,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 03:56:45,854 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:56:45,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:56:45,855 INFO L85 PathProgramCache]: Analyzing trace with hash -553855919, now seen corresponding path program 2 times [2025-01-09 03:56:45,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:56:45,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813892971] [2025-01-09 03:56:45,855 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 03:56:45,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:56:45,873 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 101 statements into 2 equivalence classes. [2025-01-09 03:56:45,886 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 03:56:45,887 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 03:56:45,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:56:45,990 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 03:56:45,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:56:45,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813892971] [2025-01-09 03:56:45,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813892971] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:56:45,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:56:45,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:56:45,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294601535] [2025-01-09 03:56:45,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:56:45,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:56:45,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:56:45,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:56:45,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:56:45,992 INFO L87 Difference]: Start difference. First operand 332 states and 512 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-01-09 03:56:46,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:56:46,035 INFO L93 Difference]: Finished difference Result 639 states and 989 transitions. [2025-01-09 03:56:46,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:56:46,036 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 101 [2025-01-09 03:56:46,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:56:46,038 INFO L225 Difference]: With dead ends: 639 [2025-01-09 03:56:46,038 INFO L226 Difference]: Without dead ends: 332 [2025-01-09 03:56:46,039 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-01-09 03:56:46,040 INFO L435 NwaCegarLoop]: 411 mSDtfsCounter, 2 mSDsluCounter, 1216 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1627 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:56:46,040 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1627 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:56:46,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2025-01-09 03:56:46,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 332. [2025-01-09 03:56:46,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 259 states have (on average 1.5482625482625483) internal successors, (401), 264 states have internal predecessors, (401), 53 states have call successors, (53), 17 states have call predecessors, (53), 19 states have return successors, (57), 52 states have call predecessors, (57), 52 states have call successors, (57) [2025-01-09 03:56:46,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 511 transitions. [2025-01-09 03:56:46,052 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 511 transitions. Word has length 101 [2025-01-09 03:56:46,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:56:46,052 INFO L471 AbstractCegarLoop]: Abstraction has 332 states and 511 transitions. [2025-01-09 03:56:46,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-01-09 03:56:46,053 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 511 transitions. [2025-01-09 03:56:46,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-01-09 03:56:46,054 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:56:46,054 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] [2025-01-09 03:56:46,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 03:56:46,054 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:56:46,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:56:46,055 INFO L85 PathProgramCache]: Analyzing trace with hash 939670194, now seen corresponding path program 3 times [2025-01-09 03:56:46,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:56:46,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66464379] [2025-01-09 03:56:46,055 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 03:56:46,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:56:46,069 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 102 statements into 3 equivalence classes. [2025-01-09 03:56:46,077 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 90 of 102 statements. [2025-01-09 03:56:46,078 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-09 03:56:46,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:56:46,152 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 03:56:46,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:56:46,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66464379] [2025-01-09 03:56:46,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66464379] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:56:46,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:56:46,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:56:46,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406544303] [2025-01-09 03:56:46,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:56:46,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:56:46,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:56:46,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:56:46,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:56:46,154 INFO L87 Difference]: Start difference. First operand 332 states and 511 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-01-09 03:56:46,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:56:46,200 INFO L93 Difference]: Finished difference Result 641 states and 995 transitions. [2025-01-09 03:56:46,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:56:46,200 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 102 [2025-01-09 03:56:46,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:56:46,203 INFO L225 Difference]: With dead ends: 641 [2025-01-09 03:56:46,203 INFO L226 Difference]: Without dead ends: 334 [2025-01-09 03:56:46,204 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-01-09 03:56:46,204 INFO L435 NwaCegarLoop]: 414 mSDtfsCounter, 1 mSDsluCounter, 1224 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1638 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-01-09 03:56:46,205 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1638 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:56:46,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2025-01-09 03:56:46,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 334. [2025-01-09 03:56:46,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 260 states have (on average 1.5461538461538462) internal successors, (402), 266 states have internal predecessors, (402), 53 states have call successors, (53), 17 states have call predecessors, (53), 20 states have return successors, (62), 52 states have call predecessors, (62), 52 states have call successors, (62) [2025-01-09 03:56:46,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 517 transitions. [2025-01-09 03:56:46,227 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 517 transitions. Word has length 102 [2025-01-09 03:56:46,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:56:46,227 INFO L471 AbstractCegarLoop]: Abstraction has 334 states and 517 transitions. [2025-01-09 03:56:46,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-01-09 03:56:46,231 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 517 transitions. [2025-01-09 03:56:46,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-01-09 03:56:46,234 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:56:46,234 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] [2025-01-09 03:56:46,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 03:56:46,234 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:56:46,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:56:46,235 INFO L85 PathProgramCache]: Analyzing trace with hash 498899276, now seen corresponding path program 1 times [2025-01-09 03:56:46,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:56:46,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428891059] [2025-01-09 03:56:46,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:56:46,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:56:46,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-09 03:56:46,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-09 03:56:46,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:56:46,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:56:46,379 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 03:56:46,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:56:46,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428891059] [2025-01-09 03:56:46,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428891059] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:56:46,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:56:46,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:56:46,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862649326] [2025-01-09 03:56:46,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:56:46,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:56:46,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:56:46,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:56:46,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:56:46,381 INFO L87 Difference]: Start difference. First operand 334 states and 517 transitions. Second operand has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 states have internal predecessors, (69), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2025-01-09 03:56:46,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:56:46,421 INFO L93 Difference]: Finished difference Result 647 states and 1005 transitions. [2025-01-09 03:56:46,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:56:46,422 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 states have internal predecessors, (69), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 103 [2025-01-09 03:56:46,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:56:46,424 INFO L225 Difference]: With dead ends: 647 [2025-01-09 03:56:46,424 INFO L226 Difference]: Without dead ends: 336 [2025-01-09 03:56:46,425 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-01-09 03:56:46,425 INFO L435 NwaCegarLoop]: 414 mSDtfsCounter, 1 mSDsluCounter, 1230 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1644 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-01-09 03:56:46,425 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1644 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:56:46,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2025-01-09 03:56:46,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 336. [2025-01-09 03:56:46,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 261 states have (on average 1.5440613026819923) internal successors, (403), 268 states have internal predecessors, (403), 53 states have call successors, (53), 17 states have call predecessors, (53), 21 states have return successors, (64), 52 states have call predecessors, (64), 52 states have call successors, (64) [2025-01-09 03:56:46,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 520 transitions. [2025-01-09 03:56:46,436 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 520 transitions. Word has length 103 [2025-01-09 03:56:46,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:56:46,436 INFO L471 AbstractCegarLoop]: Abstraction has 336 states and 520 transitions. [2025-01-09 03:56:46,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 states have internal predecessors, (69), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2025-01-09 03:56:46,437 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 520 transitions. [2025-01-09 03:56:46,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-09 03:56:46,438 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:56:46,438 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] [2025-01-09 03:56:46,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 03:56:46,438 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:56:46,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:56:46,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1618350328, now seen corresponding path program 1 times [2025-01-09 03:56:46,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:56:46,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920129954] [2025-01-09 03:56:46,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:56:46,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:56:46,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 03:56:46,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 03:56:46,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:56:46,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:56:46,572 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-01-09 03:56:46,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:56:46,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920129954] [2025-01-09 03:56:46,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920129954] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:56:46,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1625141893] [2025-01-09 03:56:46,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:56:46,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:56:46,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:56:46,574 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-01-09 03:56:46,576 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-01-09 03:56:46,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 03:56:46,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 03:56:46,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:56:46,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:56:46,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 954 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 03:56:46,783 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:56:46,809 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:56:46,810 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:56:46,873 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:56:46,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1625141893] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:56:46,873 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 03:56:46,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 11 [2025-01-09 03:56:46,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404022448] [2025-01-09 03:56:46,874 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 03:56:46,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 03:56:46,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:56:46,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 03:56:46,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-01-09 03:56:46,875 INFO L87 Difference]: Start difference. First operand 336 states and 520 transitions. Second operand has 11 states, 10 states have (on average 11.0) internal successors, (110), 11 states have internal predecessors, (110), 4 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2025-01-09 03:56:47,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:56:47,336 INFO L93 Difference]: Finished difference Result 992 states and 1605 transitions. [2025-01-09 03:56:47,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 03:56:47,336 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.0) internal successors, (110), 11 states have internal predecessors, (110), 4 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) Word has length 104 [2025-01-09 03:56:47,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:56:47,341 INFO L225 Difference]: With dead ends: 992 [2025-01-09 03:56:47,341 INFO L226 Difference]: Without dead ends: 684 [2025-01-09 03:56:47,342 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 205 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-01-09 03:56:47,343 INFO L435 NwaCegarLoop]: 416 mSDtfsCounter, 1039 mSDsluCounter, 2591 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1039 SdHoareTripleChecker+Valid, 3007 SdHoareTripleChecker+Invalid, 550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 03:56:47,343 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1039 Valid, 3007 Invalid, 550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 03:56:47,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2025-01-09 03:56:47,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 660. [2025-01-09 03:56:47,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 660 states, 521 states have (on average 1.5930902111324377) internal successors, (830), 527 states have internal predecessors, (830), 117 states have call successors, (117), 18 states have call predecessors, (117), 21 states have return successors, (138), 116 states have call predecessors, (138), 116 states have call successors, (138) [2025-01-09 03:56:47,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 1085 transitions. [2025-01-09 03:56:47,373 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 1085 transitions. Word has length 104 [2025-01-09 03:56:47,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:56:47,373 INFO L471 AbstractCegarLoop]: Abstraction has 660 states and 1085 transitions. [2025-01-09 03:56:47,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.0) internal successors, (110), 11 states have internal predecessors, (110), 4 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2025-01-09 03:56:47,374 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 1085 transitions. [2025-01-09 03:56:47,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-01-09 03:56:47,377 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:56:47,377 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] [2025-01-09 03:56:47,385 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-09 03:56:47,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-01-09 03:56:47,581 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:56:47,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:56:47,582 INFO L85 PathProgramCache]: Analyzing trace with hash 493943377, now seen corresponding path program 1 times [2025-01-09 03:56:47,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:56:47,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524675793] [2025-01-09 03:56:47,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:56:47,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:56:47,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 03:56:47,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 03:56:47,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:56:47,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:56:47,648 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:56:47,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:56:47,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524675793] [2025-01-09 03:56:47,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524675793] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:56:47,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:56:47,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:56:47,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150791067] [2025-01-09 03:56:47,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:56:47,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:56:47,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:56:47,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:56:47,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:56:47,650 INFO L87 Difference]: Start difference. First operand 660 states and 1085 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 03:56:47,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:56:47,682 INFO L93 Difference]: Finished difference Result 1543 states and 2581 transitions. [2025-01-09 03:56:47,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:56:47,683 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 108 [2025-01-09 03:56:47,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:56:47,689 INFO L225 Difference]: With dead ends: 1543 [2025-01-09 03:56:47,689 INFO L226 Difference]: Without dead ends: 961 [2025-01-09 03:56:47,692 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:56:47,692 INFO L435 NwaCegarLoop]: 431 mSDtfsCounter, 104 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 841 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-01-09 03:56:47,693 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 841 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:56:47,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 961 states. [2025-01-09 03:56:47,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 961 to 953. [2025-01-09 03:56:47,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 953 states, 750 states have (on average 1.6106666666666667) internal successors, (1208), 756 states have internal predecessors, (1208), 181 states have call successors, (181), 18 states have call predecessors, (181), 21 states have return successors, (212), 180 states have call predecessors, (212), 180 states have call successors, (212) [2025-01-09 03:56:47,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 953 states to 953 states and 1601 transitions. [2025-01-09 03:56:47,739 INFO L78 Accepts]: Start accepts. Automaton has 953 states and 1601 transitions. Word has length 108 [2025-01-09 03:56:47,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:56:47,739 INFO L471 AbstractCegarLoop]: Abstraction has 953 states and 1601 transitions. [2025-01-09 03:56:47,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 03:56:47,740 INFO L276 IsEmpty]: Start isEmpty. Operand 953 states and 1601 transitions. [2025-01-09 03:56:47,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-01-09 03:56:47,744 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:56:47,744 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] [2025-01-09 03:56:47,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 03:56:47,745 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:56:47,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:56:47,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1612633072, now seen corresponding path program 1 times [2025-01-09 03:56:47,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:56:47,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547862745] [2025-01-09 03:56:47,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:56:47,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:56:47,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 03:56:47,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 03:56:47,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:56:47,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:56:47,802 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:56:47,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:56:47,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547862745] [2025-01-09 03:56:47,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547862745] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:56:47,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:56:47,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:56:47,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085505351] [2025-01-09 03:56:47,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:56:47,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:56:47,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:56:47,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:56:47,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:56:47,804 INFO L87 Difference]: Start difference. First operand 953 states and 1601 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, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 03:56:47,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:56:47,852 INFO L93 Difference]: Finished difference Result 2266 states and 3828 transitions. [2025-01-09 03:56:47,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:56:47,852 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, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 109 [2025-01-09 03:56:47,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:56:47,860 INFO L225 Difference]: With dead ends: 2266 [2025-01-09 03:56:47,860 INFO L226 Difference]: Without dead ends: 1442 [2025-01-09 03:56:47,864 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-01-09 03:56:47,865 INFO L435 NwaCegarLoop]: 420 mSDtfsCounter, 102 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 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-01-09 03:56:47,865 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 832 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:56:47,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1442 states. [2025-01-09 03:56:47,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1442 to 1434. [2025-01-09 03:56:47,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1434 states, 1136 states have (on average 1.6179577464788732) internal successors, (1838), 1142 states have internal predecessors, (1838), 276 states have call successors, (276), 18 states have call predecessors, (276), 21 states have return successors, (307), 275 states have call predecessors, (307), 275 states have call successors, (307) [2025-01-09 03:56:47,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1434 states to 1434 states and 2421 transitions. [2025-01-09 03:56:47,963 INFO L78 Accepts]: Start accepts. Automaton has 1434 states and 2421 transitions. Word has length 109 [2025-01-09 03:56:47,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:56:47,963 INFO L471 AbstractCegarLoop]: Abstraction has 1434 states and 2421 transitions. [2025-01-09 03:56:47,964 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, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 03:56:47,964 INFO L276 IsEmpty]: Start isEmpty. Operand 1434 states and 2421 transitions. [2025-01-09 03:56:47,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 03:56:47,970 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:56:47,970 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] [2025-01-09 03:56:47,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 03:56:47,970 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:56:47,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:56:47,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1746474879, now seen corresponding path program 1 times [2025-01-09 03:56:47,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:56:47,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724531440] [2025-01-09 03:56:47,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:56:47,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:56:47,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 03:56:47,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 03:56:47,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:56:47,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:56:48,023 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:56:48,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:56:48,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724531440] [2025-01-09 03:56:48,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724531440] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:56:48,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:56:48,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:56:48,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018168531] [2025-01-09 03:56:48,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:56:48,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:56:48,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:56:48,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:56:48,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:56:48,026 INFO L87 Difference]: Start difference. First operand 1434 states and 2421 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 03:56:48,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:56:48,094 INFO L93 Difference]: Finished difference Result 3340 states and 5684 transitions. [2025-01-09 03:56:48,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:56:48,094 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 110 [2025-01-09 03:56:48,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:56:48,107 INFO L225 Difference]: With dead ends: 3340 [2025-01-09 03:56:48,107 INFO L226 Difference]: Without dead ends: 2166 [2025-01-09 03:56:48,112 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-01-09 03:56:48,113 INFO L435 NwaCegarLoop]: 418 mSDtfsCounter, 100 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 827 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-01-09 03:56:48,113 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 827 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:56:48,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2166 states. [2025-01-09 03:56:48,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2166 to 2158. [2025-01-09 03:56:48,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2158 states, 1737 states have (on average 1.6240644789867589) internal successors, (2821), 1743 states have internal predecessors, (2821), 399 states have call successors, (399), 18 states have call predecessors, (399), 21 states have return successors, (446), 398 states have call predecessors, (446), 398 states have call successors, (446) [2025-01-09 03:56:48,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2158 states to 2158 states and 3666 transitions. [2025-01-09 03:56:48,227 INFO L78 Accepts]: Start accepts. Automaton has 2158 states and 3666 transitions. Word has length 110 [2025-01-09 03:56:48,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:56:48,227 INFO L471 AbstractCegarLoop]: Abstraction has 2158 states and 3666 transitions. [2025-01-09 03:56:48,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 03:56:48,227 INFO L276 IsEmpty]: Start isEmpty. Operand 2158 states and 3666 transitions. [2025-01-09 03:56:48,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-01-09 03:56:48,234 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:56:48,235 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] [2025-01-09 03:56:48,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 03:56:48,235 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:56:48,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:56:48,235 INFO L85 PathProgramCache]: Analyzing trace with hash 890720625, now seen corresponding path program 1 times [2025-01-09 03:56:48,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:56:48,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720666819] [2025-01-09 03:56:48,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:56:48,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:56:48,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 03:56:48,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 03:56:48,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:56:48,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:56:48,297 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:56:48,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:56:48,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720666819] [2025-01-09 03:56:48,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720666819] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:56:48,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:56:48,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:56:48,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442114139] [2025-01-09 03:56:48,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:56:48,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:56:48,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:56:48,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:56:48,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:56:48,299 INFO L87 Difference]: Start difference. First operand 2158 states and 3666 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 03:56:48,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:56:48,399 INFO L93 Difference]: Finished difference Result 5003 states and 8561 transitions. [2025-01-09 03:56:48,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:56:48,400 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 111 [2025-01-09 03:56:48,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:56:48,419 INFO L225 Difference]: With dead ends: 5003 [2025-01-09 03:56:48,419 INFO L226 Difference]: Without dead ends: 3317 [2025-01-09 03:56:48,425 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:56:48,426 INFO L435 NwaCegarLoop]: 418 mSDtfsCounter, 98 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 827 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-01-09 03:56:48,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 827 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:56:48,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3317 states. [2025-01-09 03:56:48,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3317 to 3309. [2025-01-09 03:56:48,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3309 states, 2709 states have (on average 1.627906976744186) internal successors, (4410), 2715 states have internal predecessors, (4410), 578 states have call successors, (578), 18 states have call predecessors, (578), 21 states have return successors, (651), 577 states have call predecessors, (651), 577 states have call successors, (651) [2025-01-09 03:56:48,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3309 states to 3309 states and 5639 transitions. [2025-01-09 03:56:48,638 INFO L78 Accepts]: Start accepts. Automaton has 3309 states and 5639 transitions. Word has length 111 [2025-01-09 03:56:48,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:56:48,639 INFO L471 AbstractCegarLoop]: Abstraction has 3309 states and 5639 transitions. [2025-01-09 03:56:48,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 03:56:48,640 INFO L276 IsEmpty]: Start isEmpty. Operand 3309 states and 5639 transitions. [2025-01-09 03:56:48,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-01-09 03:56:48,649 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:56:48,649 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:56:48,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 03:56:48,649 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:56:48,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:56:48,650 INFO L85 PathProgramCache]: Analyzing trace with hash -932033061, now seen corresponding path program 1 times [2025-01-09 03:56:48,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:56:48,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193373185] [2025-01-09 03:56:48,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:56:48,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:56:48,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 03:56:48,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 03:56:48,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:56:48,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:56:48,717 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:56:48,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:56:48,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193373185] [2025-01-09 03:56:48,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193373185] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:56:48,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:56:48,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:56:48,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545669424] [2025-01-09 03:56:48,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:56:48,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:56:48,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:56:48,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:56:48,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:56:48,719 INFO L87 Difference]: Start difference. First operand 3309 states and 5639 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 03:56:48,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:56:48,896 INFO L93 Difference]: Finished difference Result 7999 states and 13700 transitions. [2025-01-09 03:56:48,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:56:48,900 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 112 [2025-01-09 03:56:48,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:56:48,928 INFO L225 Difference]: With dead ends: 7999 [2025-01-09 03:56:48,928 INFO L226 Difference]: Without dead ends: 5403 [2025-01-09 03:56:48,938 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-01-09 03:56:48,939 INFO L435 NwaCegarLoop]: 422 mSDtfsCounter, 96 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 836 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-01-09 03:56:48,939 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 836 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:56:48,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5403 states. [2025-01-09 03:56:49,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5403 to 5395. [2025-01-09 03:56:49,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5395 states, 4419 states have (on average 1.6205023761031907) internal successors, (7161), 4425 states have internal predecessors, (7161), 954 states have call successors, (954), 18 states have call predecessors, (954), 21 states have return successors, (1071), 953 states have call predecessors, (1071), 953 states have call successors, (1071) [2025-01-09 03:56:49,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5395 states to 5395 states and 9186 transitions. [2025-01-09 03:56:49,216 INFO L78 Accepts]: Start accepts. Automaton has 5395 states and 9186 transitions. Word has length 112 [2025-01-09 03:56:49,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:56:49,217 INFO L471 AbstractCegarLoop]: Abstraction has 5395 states and 9186 transitions. [2025-01-09 03:56:49,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 03:56:49,218 INFO L276 IsEmpty]: Start isEmpty. Operand 5395 states and 9186 transitions. [2025-01-09 03:56:49,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-01-09 03:56:49,232 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:56:49,232 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] [2025-01-09 03:56:49,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 03:56:49,233 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:56:49,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:56:49,233 INFO L85 PathProgramCache]: Analyzing trace with hash -805866731, now seen corresponding path program 1 times [2025-01-09 03:56:49,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:56:49,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19841062] [2025-01-09 03:56:49,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:56:49,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:56:49,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-01-09 03:56:49,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-01-09 03:56:49,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:56:49,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:56:49,312 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:56:49,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:56:49,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19841062] [2025-01-09 03:56:49,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19841062] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:56:49,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:56:49,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:56:49,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280563933] [2025-01-09 03:56:49,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:56:49,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:56:49,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:56:49,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:56:49,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:56:49,315 INFO L87 Difference]: Start difference. First operand 5395 states and 9186 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 03:56:49,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:56:49,513 INFO L93 Difference]: Finished difference Result 13288 states and 22757 transitions. [2025-01-09 03:56:49,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:56:49,517 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 113 [2025-01-09 03:56:49,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:56:49,573 INFO L225 Difference]: With dead ends: 13288 [2025-01-09 03:56:49,574 INFO L226 Difference]: Without dead ends: 8992 [2025-01-09 03:56:49,592 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-01-09 03:56:49,593 INFO L435 NwaCegarLoop]: 427 mSDtfsCounter, 94 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 840 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-01-09 03:56:49,593 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 840 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:56:49,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8992 states. [2025-01-09 03:56:49,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8992 to 8984. [2025-01-09 03:56:49,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8984 states, 7402 states have (on average 1.6176708997568225) internal successors, (11974), 7408 states have internal predecessors, (11974), 1560 states have call successors, (1560), 18 states have call predecessors, (1560), 21 states have return successors, (1755), 1559 states have call predecessors, (1755), 1559 states have call successors, (1755) [2025-01-09 03:56:50,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8984 states to 8984 states and 15289 transitions. [2025-01-09 03:56:50,026 INFO L78 Accepts]: Start accepts. Automaton has 8984 states and 15289 transitions. Word has length 113 [2025-01-09 03:56:50,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:56:50,026 INFO L471 AbstractCegarLoop]: Abstraction has 8984 states and 15289 transitions. [2025-01-09 03:56:50,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 03:56:50,027 INFO L276 IsEmpty]: Start isEmpty. Operand 8984 states and 15289 transitions. [2025-01-09 03:56:50,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-01-09 03:56:50,043 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:56:50,043 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] [2025-01-09 03:56:50,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 03:56:50,043 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:56:50,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:56:50,044 INFO L85 PathProgramCache]: Analyzing trace with hash 732734973, now seen corresponding path program 1 times [2025-01-09 03:56:50,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:56:50,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687032756] [2025-01-09 03:56:50,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:56:50,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:56:50,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-01-09 03:56:50,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-01-09 03:56:50,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:56:50,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:56:50,106 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:56:50,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:56:50,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687032756] [2025-01-09 03:56:50,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687032756] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:56:50,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:56:50,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:56:50,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424121193] [2025-01-09 03:56:50,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:56:50,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:56:50,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:56:50,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:56:50,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:56:50,108 INFO L87 Difference]: Start difference. First operand 8984 states and 15289 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 03:56:50,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:56:50,640 INFO L93 Difference]: Finished difference Result 23234 states and 39679 transitions. [2025-01-09 03:56:50,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:56:50,640 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 114 [2025-01-09 03:56:50,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:56:50,712 INFO L225 Difference]: With dead ends: 23234 [2025-01-09 03:56:50,712 INFO L226 Difference]: Without dead ends: 15779 [2025-01-09 03:56:50,737 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-01-09 03:56:50,738 INFO L435 NwaCegarLoop]: 434 mSDtfsCounter, 92 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 849 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-01-09 03:56:50,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 849 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:56:50,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15779 states. [2025-01-09 03:56:51,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15779 to 15771. [2025-01-09 03:56:51,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15771 states, 12986 states have (on average 1.6077314030494378) internal successors, (20878), 12992 states have internal predecessors, (20878), 2763 states have call successors, (2763), 18 states have call predecessors, (2763), 21 states have return successors, (3102), 2762 states have call predecessors, (3102), 2762 states have call successors, (3102) [2025-01-09 03:56:51,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15771 states to 15771 states and 26743 transitions. [2025-01-09 03:56:51,385 INFO L78 Accepts]: Start accepts. Automaton has 15771 states and 26743 transitions. Word has length 114 [2025-01-09 03:56:51,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:56:51,385 INFO L471 AbstractCegarLoop]: Abstraction has 15771 states and 26743 transitions. [2025-01-09 03:56:51,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 03:56:51,386 INFO L276 IsEmpty]: Start isEmpty. Operand 15771 states and 26743 transitions. [2025-01-09 03:56:51,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-01-09 03:56:51,405 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:56:51,406 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] [2025-01-09 03:56:51,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 03:56:51,406 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:56:51,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:56:51,407 INFO L85 PathProgramCache]: Analyzing trace with hash -895560650, now seen corresponding path program 1 times [2025-01-09 03:56:51,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:56:51,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951471485] [2025-01-09 03:56:51,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:56:51,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:56:51,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-01-09 03:56:51,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-01-09 03:56:51,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:56:51,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:56:51,457 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:56:51,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:56:51,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951471485] [2025-01-09 03:56:51,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951471485] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:56:51,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:56:51,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:56:51,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285344189] [2025-01-09 03:56:51,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:56:51,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:56:51,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:56:51,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:56:51,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:56:51,461 INFO L87 Difference]: Start difference. First operand 15771 states and 26743 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 03:56:52,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:56:52,268 INFO L93 Difference]: Finished difference Result 41760 states and 71096 transitions. [2025-01-09 03:56:52,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:56:52,269 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 115 [2025-01-09 03:56:52,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:56:52,411 INFO L225 Difference]: With dead ends: 41760 [2025-01-09 03:56:52,412 INFO L226 Difference]: Without dead ends: 28131 [2025-01-09 03:56:52,464 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-01-09 03:56:52,466 INFO L435 NwaCegarLoop]: 418 mSDtfsCounter, 90 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 830 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-01-09 03:56:52,466 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 830 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:56:52,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28131 states. [2025-01-09 03:56:53,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28131 to 28123. [2025-01-09 03:56:53,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28123 states, 23299 states have (on average 1.6027297308897377) internal successors, (37342), 23305 states have internal predecessors, (37342), 4802 states have call successors, (4802), 18 states have call predecessors, (4802), 21 states have return successors, (5415), 4801 states have call predecessors, (5415), 4801 states have call successors, (5415) [2025-01-09 03:56:53,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28123 states to 28123 states and 47559 transitions. [2025-01-09 03:56:53,791 INFO L78 Accepts]: Start accepts. Automaton has 28123 states and 47559 transitions. Word has length 115 [2025-01-09 03:56:53,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:56:53,791 INFO L471 AbstractCegarLoop]: Abstraction has 28123 states and 47559 transitions. [2025-01-09 03:56:53,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 03:56:53,791 INFO L276 IsEmpty]: Start isEmpty. Operand 28123 states and 47559 transitions. [2025-01-09 03:56:53,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-01-09 03:56:53,814 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:56:53,815 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] [2025-01-09 03:56:53,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 03:56:53,815 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:56:53,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:56:53,815 INFO L85 PathProgramCache]: Analyzing trace with hash -425529729, now seen corresponding path program 1 times [2025-01-09 03:56:53,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:56:53,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209992647] [2025-01-09 03:56:53,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:56:53,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:56:53,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-09 03:56:53,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-09 03:56:53,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:56:53,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:56:53,868 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:56:53,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:56:53,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209992647] [2025-01-09 03:56:53,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209992647] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:56:53,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:56:53,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:56:53,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598111767] [2025-01-09 03:56:53,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:56:53,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:56:53,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:56:53,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:56:53,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:56:53,870 INFO L87 Difference]: Start difference. First operand 28123 states and 47559 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 03:56:54,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:56:54,848 INFO L93 Difference]: Finished difference Result 76687 states and 130093 transitions. [2025-01-09 03:56:54,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:56:54,848 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 116 [2025-01-09 03:56:54,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:56:55,092 INFO L225 Difference]: With dead ends: 76687 [2025-01-09 03:56:55,093 INFO L226 Difference]: Without dead ends: 51441 [2025-01-09 03:56:55,165 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-01-09 03:56:55,166 INFO L435 NwaCegarLoop]: 429 mSDtfsCounter, 88 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 842 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-01-09 03:56:55,166 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 842 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:56:55,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51441 states. [2025-01-09 03:56:56,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51441 to 51433. [2025-01-09 03:56:57,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51433 states, 42894 states have (on average 1.596400428964424) internal successors, (68476), 42900 states have internal predecessors, (68476), 8517 states have call successors, (8517), 18 states have call predecessors, (8517), 21 states have return successors, (9662), 8516 states have call predecessors, (9662), 8516 states have call successors, (9662) [2025-01-09 03:56:57,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51433 states to 51433 states and 86655 transitions. [2025-01-09 03:56:57,285 INFO L78 Accepts]: Start accepts. Automaton has 51433 states and 86655 transitions. Word has length 116 [2025-01-09 03:56:57,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:56:57,286 INFO L471 AbstractCegarLoop]: Abstraction has 51433 states and 86655 transitions. [2025-01-09 03:56:57,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 03:56:57,286 INFO L276 IsEmpty]: Start isEmpty. Operand 51433 states and 86655 transitions. [2025-01-09 03:56:57,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-01-09 03:56:57,309 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:56:57,309 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] [2025-01-09 03:56:57,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 03:56:57,309 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:56:57,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:56:57,311 INFO L85 PathProgramCache]: Analyzing trace with hash 2057182134, now seen corresponding path program 1 times [2025-01-09 03:56:57,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:56:57,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206982074] [2025-01-09 03:56:57,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:56:57,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:56:57,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-01-09 03:56:57,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-01-09 03:56:57,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:56:57,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:56:57,371 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:56:57,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:56:57,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206982074] [2025-01-09 03:56:57,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206982074] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:56:57,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:56:57,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:56:57,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019573890] [2025-01-09 03:56:57,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:56:57,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:56:57,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:56:57,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:56:57,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:56:57,373 INFO L87 Difference]: Start difference. First operand 51433 states and 86655 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 03:56:59,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:56:59,164 INFO L93 Difference]: Finished difference Result 95939 states and 161935 transitions. [2025-01-09 03:56:59,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:56:59,164 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 117 [2025-01-09 03:56:59,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:56:59,614 INFO L225 Difference]: With dead ends: 95939 [2025-01-09 03:56:59,615 INFO L226 Difference]: Without dead ends: 95812 [2025-01-09 03:56:59,673 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-01-09 03:56:59,676 INFO L435 NwaCegarLoop]: 427 mSDtfsCounter, 83 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 844 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-01-09 03:56:59,676 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 844 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:56:59,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95812 states. [2025-01-09 03:57:02,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95812 to 95804. [2025-01-09 03:57:02,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95804 states, 80466 states have (on average 1.5886834190838366) internal successors, (127835), 80472 states have internal predecessors, (127835), 15316 states have call successors, (15316), 18 states have call predecessors, (15316), 21 states have return successors, (17507), 15315 states have call predecessors, (17507), 15315 states have call successors, (17507) [2025-01-09 03:57:03,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95804 states to 95804 states and 160658 transitions. [2025-01-09 03:57:03,532 INFO L78 Accepts]: Start accepts. Automaton has 95804 states and 160658 transitions. Word has length 117 [2025-01-09 03:57:03,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:57:03,533 INFO L471 AbstractCegarLoop]: Abstraction has 95804 states and 160658 transitions. [2025-01-09 03:57:03,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 03:57:03,534 INFO L276 IsEmpty]: Start isEmpty. Operand 95804 states and 160658 transitions. [2025-01-09 03:57:03,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-01-09 03:57:03,552 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:57:03,552 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] [2025-01-09 03:57:03,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 03:57:03,552 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:57:03,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:57:03,553 INFO L85 PathProgramCache]: Analyzing trace with hash -340923170, now seen corresponding path program 1 times [2025-01-09 03:57:03,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:57:03,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917989781] [2025-01-09 03:57:03,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:57:03,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:57:03,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-01-09 03:57:03,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-01-09 03:57:03,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:57:03,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:57:03,954 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:57:03,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:57:03,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917989781] [2025-01-09 03:57:03,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917989781] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:57:03,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:57:03,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 03:57:03,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164962933] [2025-01-09 03:57:03,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:57:03,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 03:57:03,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:57:03,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 03:57:03,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-01-09 03:57:03,955 INFO L87 Difference]: Start difference. First operand 95804 states and 160658 transitions. Second operand has 12 states, 11 states have (on average 7.363636363636363) internal successors, (81), 10 states have internal predecessors, (81), 5 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) [2025-01-09 03:57:08,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:57:08,190 INFO L93 Difference]: Finished difference Result 190934 states and 325672 transitions. [2025-01-09 03:57:08,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-01-09 03:57:08,191 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.363636363636363) internal successors, (81), 10 states have internal predecessors, (81), 5 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) Word has length 118 [2025-01-09 03:57:08,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:57:09,045 INFO L225 Difference]: With dead ends: 190934 [2025-01-09 03:57:09,045 INFO L226 Difference]: Without dead ends: 190813 [2025-01-09 03:57:09,117 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=525, Unknown=0, NotChecked=0, Total=650 [2025-01-09 03:57:09,118 INFO L435 NwaCegarLoop]: 508 mSDtfsCounter, 1097 mSDsluCounter, 4344 mSDsCounter, 0 mSdLazyCounter, 793 mSolverCounterSat, 272 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1097 SdHoareTripleChecker+Valid, 4852 SdHoareTripleChecker+Invalid, 1065 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 272 IncrementalHoareTripleChecker+Valid, 793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 03:57:09,118 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1097 Valid, 4852 Invalid, 1065 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [272 Valid, 793 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 03:57:09,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190813 states. [2025-01-09 03:57:14,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190813 to 190776. [2025-01-09 03:57:14,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190776 states, 160308 states have (on average 1.5895526112233949) internal successors, (254818), 160210 states have internal predecessors, (254818), 30417 states have call successors, (30417), 44 states have call predecessors, (30417), 50 states have return successors, (38070), 30527 states have call predecessors, (38070), 30414 states have call successors, (38070) [2025-01-09 03:57:15,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190776 states to 190776 states and 323305 transitions. [2025-01-09 03:57:15,215 INFO L78 Accepts]: Start accepts. Automaton has 190776 states and 323305 transitions. Word has length 118 [2025-01-09 03:57:15,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:57:15,216 INFO L471 AbstractCegarLoop]: Abstraction has 190776 states and 323305 transitions. [2025-01-09 03:57:15,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 7.363636363636363) internal successors, (81), 10 states have internal predecessors, (81), 5 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) [2025-01-09 03:57:15,216 INFO L276 IsEmpty]: Start isEmpty. Operand 190776 states and 323305 transitions. [2025-01-09 03:57:15,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 03:57:15,249 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:57:15,249 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] [2025-01-09 03:57:15,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 03:57:15,249 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:57:15,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:57:15,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1070822319, now seen corresponding path program 1 times [2025-01-09 03:57:15,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:57:15,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276378034] [2025-01-09 03:57:15,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:57:15,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:57:15,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 03:57:15,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 03:57:15,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:57:15,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:57:15,344 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:57:15,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:57:15,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276378034] [2025-01-09 03:57:15,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276378034] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:57:15,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:57:15,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 03:57:15,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690368089] [2025-01-09 03:57:15,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:57:15,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 03:57:15,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:57:15,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 03:57:15,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:57:15,345 INFO L87 Difference]: Start difference. First operand 190776 states and 323305 transitions. Second operand has 8 states, 8 states have (on average 10.25) internal successors, (82), 6 states have internal predecessors, (82), 4 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11)