./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec8_product31.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_product31.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 aa31ba7b6b6c5a20100c4ed7bd6bb53a6560ae9fc8557479e094a44cc1bad058 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 03:57:24,708 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 03:57:24,752 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:57:24,755 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 03:57:24,755 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 03:57:24,770 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 03:57:24,771 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 03:57:24,771 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 03:57:24,771 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 03:57:24,771 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 03:57:24,771 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 03:57:24,771 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 03:57:24,771 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 03:57:24,771 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 03:57:24,771 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 03:57:24,772 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 03:57:24,772 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 03:57:24,772 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 03:57:24,772 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 03:57:24,772 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 03:57:24,772 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 03:57:24,772 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 03:57:24,772 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 03:57:24,772 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 03:57:24,772 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 03:57:24,772 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 03:57:24,772 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 03:57:24,772 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 03:57:24,772 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 03:57:24,772 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:57:24,772 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:57:24,772 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:57:24,772 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:57:24,773 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 03:57:24,773 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:57:24,773 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:57:24,773 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:57:24,773 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:57:24,773 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 03:57:24,773 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 03:57:24,773 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 03:57:24,773 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 03:57:24,773 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 03:57:24,773 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 03:57:24,773 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 03:57:24,773 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 03:57:24,773 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 03:57:24,773 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 03:57:24,773 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 -> aa31ba7b6b6c5a20100c4ed7bd6bb53a6560ae9fc8557479e094a44cc1bad058 [2025-01-09 03:57:24,944 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 03:57:24,950 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 03:57:24,951 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 03:57:24,952 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 03:57:24,952 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 03:57:24,953 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec8_product31.cil.c [2025-01-09 03:57:26,118 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2592e22a3/67e0b1d290f94f089999e9005e2e95d6/FLAGd124c2cd2 [2025-01-09 03:57:26,557 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 03:57:26,558 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec8_product31.cil.c [2025-01-09 03:57:26,583 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2592e22a3/67e0b1d290f94f089999e9005e2e95d6/FLAGd124c2cd2 [2025-01-09 03:57:26,717 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2592e22a3/67e0b1d290f94f089999e9005e2e95d6 [2025-01-09 03:57:26,719 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 03:57:26,721 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 03:57:26,722 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 03:57:26,722 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 03:57:26,726 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 03:57:26,727 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:57:26" (1/1) ... [2025-01-09 03:57:26,727 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c86681a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:57:26, skipping insertion in model container [2025-01-09 03:57:26,728 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:57:26" (1/1) ... [2025-01-09 03:57:26,764 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 03:57:27,061 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_product31.cil.c[36672,36685] [2025-01-09 03:57:27,138 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:57:27,149 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 03:57:27,156 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [48] [2025-01-09 03:57:27,157 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [1128] [2025-01-09 03:57:27,157 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [1494] [2025-01-09 03:57:27,157 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [1503] [2025-01-09 03:57:27,157 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [1521] [2025-01-09 03:57:27,157 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [1680] [2025-01-09 03:57:27,157 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [2082] [2025-01-09 03:57:27,157 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [2120] [2025-01-09 03:57:27,157 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [2484] [2025-01-09 03:57:27,158 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [2769] [2025-01-09 03:57:27,158 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EncryptAutoResponder_spec.i","") [2985] [2025-01-09 03:57:27,195 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_product31.cil.c[36672,36685] [2025-01-09 03:57:27,259 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:57:27,296 INFO L204 MainTranslator]: Completed translation [2025-01-09 03:57:27,297 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:57:27 WrapperNode [2025-01-09 03:57:27,298 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 03:57:27,300 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 03:57:27,300 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 03:57:27,300 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 03:57:27,305 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:57:27" (1/1) ... [2025-01-09 03:57:27,333 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:57:27" (1/1) ... [2025-01-09 03:57:27,374 INFO L138 Inliner]: procedures = 132, calls = 207, calls flagged for inlining = 62, calls inlined = 57, statements flattened = 1040 [2025-01-09 03:57:27,374 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 03:57:27,375 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 03:57:27,375 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 03:57:27,375 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 03:57:27,382 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:57:27" (1/1) ... [2025-01-09 03:57:27,382 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:57:27" (1/1) ... [2025-01-09 03:57:27,392 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:57:27" (1/1) ... [2025-01-09 03:57:27,429 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:57:27,433 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:57:27" (1/1) ... [2025-01-09 03:57:27,433 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:57:27" (1/1) ... [2025-01-09 03:57:27,457 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:57:27" (1/1) ... [2025-01-09 03:57:27,463 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:57:27" (1/1) ... [2025-01-09 03:57:27,469 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:57:27" (1/1) ... [2025-01-09 03:57:27,476 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:57:27" (1/1) ... [2025-01-09 03:57:27,482 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:57:27" (1/1) ... [2025-01-09 03:57:27,496 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 03:57:27,497 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 03:57:27,500 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 03:57:27,500 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 03:57:27,501 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:57:27" (1/1) ... [2025-01-09 03:57:27,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:57:27,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:57:27,528 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:57:27,532 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:57:27,552 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2025-01-09 03:57:27,553 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2025-01-09 03:57:27,553 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2025-01-09 03:57:27,553 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2025-01-09 03:57:27,553 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2025-01-09 03:57:27,553 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2025-01-09 03:57:27,554 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-01-09 03:57:27,554 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-01-09 03:57:27,554 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-01-09 03:57:27,554 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-01-09 03:57:27,554 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2025-01-09 03:57:27,555 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2025-01-09 03:57:27,555 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-01-09 03:57:27,555 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-01-09 03:57:27,555 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2025-01-09 03:57:27,555 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2025-01-09 03:57:27,555 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2025-01-09 03:57:27,555 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2025-01-09 03:57:27,555 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-01-09 03:57:27,555 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-01-09 03:57:27,555 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-01-09 03:57:27,555 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-01-09 03:57:27,556 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-01-09 03:57:27,556 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-01-09 03:57:27,556 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 03:57:27,556 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2025-01-09 03:57:27,556 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2025-01-09 03:57:27,556 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2025-01-09 03:57:27,556 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2025-01-09 03:57:27,556 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-01-09 03:57:27,556 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-01-09 03:57:27,556 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-01-09 03:57:27,556 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-01-09 03:57:27,556 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-01-09 03:57:27,556 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-01-09 03:57:27,557 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2025-01-09 03:57:27,557 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2025-01-09 03:57:27,557 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-01-09 03:57:27,557 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-01-09 03:57:27,557 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2025-01-09 03:57:27,557 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2025-01-09 03:57:27,557 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-01-09 03:57:27,557 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-01-09 03:57:27,557 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-01-09 03:57:27,557 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-01-09 03:57:27,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 03:57:27,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 03:57:27,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 03:57:27,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 03:57:27,558 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-01-09 03:57:27,558 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-01-09 03:57:27,558 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 03:57:27,558 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 03:57:27,749 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 03:57:27,751 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 03:57:28,461 INFO L? ?]: Removed 479 outVars from TransFormulas that were not future-live. [2025-01-09 03:57:28,462 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 03:57:28,481 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 03:57:28,484 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 03:57:28,485 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:57:28 BoogieIcfgContainer [2025-01-09 03:57:28,485 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 03:57:28,487 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 03:57:28,488 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 03:57:28,491 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 03:57:28,492 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:57:26" (1/3) ... [2025-01-09 03:57:28,492 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@344de374 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:57:28, skipping insertion in model container [2025-01-09 03:57:28,492 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:57:27" (2/3) ... [2025-01-09 03:57:28,493 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@344de374 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:57:28, skipping insertion in model container [2025-01-09 03:57:28,493 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:57:28" (3/3) ... [2025-01-09 03:57:28,494 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec8_product31.cil.c [2025-01-09 03:57:28,511 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 03:57:28,514 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec8_product31.cil.c that has 24 procedures, 369 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 03:57:28,583 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 03:57:28,595 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;@62726eff, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 03:57:28,596 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 03:57:28,600 INFO L276 IsEmpty]: Start isEmpty. Operand has 369 states, 285 states have (on average 1.4982456140350877) internal successors, (427), 289 states have internal predecessors, (427), 59 states have call successors, (59), 23 states have call predecessors, (59), 23 states have return successors, (59), 59 states have call predecessors, (59), 59 states have call successors, (59) [2025-01-09 03:57:28,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-01-09 03:57:28,616 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:57:28,616 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:57:28,617 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:57:28,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:57:28,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1269272307, now seen corresponding path program 1 times [2025-01-09 03:57:28,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:57:28,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86098895] [2025-01-09 03:57:28,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:57:28,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:57:28,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 03:57:28,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 03:57:28,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:57:28,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:57:29,235 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:57:29,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:57:29,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86098895] [2025-01-09 03:57:29,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86098895] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:57:29,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1481388235] [2025-01-09 03:57:29,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:57:29,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:57:29,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:57:29,243 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:57:29,247 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:57:29,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 03:57:29,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 03:57:29,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:57:29,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:57:29,551 INFO L256 TraceCheckSpWp]: Trace formula consists of 1023 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 03:57:29,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:57:29,592 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:57:29,592 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:57:29,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1481388235] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:57:29,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:57:29,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-01-09 03:57:29,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272875134] [2025-01-09 03:57:29,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:57:29,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:57:29,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:57:29,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:57:29,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:57:29,616 INFO L87 Difference]: Start difference. First operand has 369 states, 285 states have (on average 1.4982456140350877) internal successors, (427), 289 states have internal predecessors, (427), 59 states have call successors, (59), 23 states have call predecessors, (59), 23 states have return successors, (59), 59 states have call predecessors, (59), 59 states have call successors, (59) 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, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:57:29,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:57:29,703 INFO L93 Difference]: Finished difference Result 587 states and 850 transitions. [2025-01-09 03:57:29,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:57:29,706 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, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 101 [2025-01-09 03:57:29,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:57:29,725 INFO L225 Difference]: With dead ends: 587 [2025-01-09 03:57:29,725 INFO L226 Difference]: Without dead ends: 364 [2025-01-09 03:57:29,733 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 101 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:57:29,739 INFO L435 NwaCegarLoop]: 540 mSDtfsCounter, 1 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1077 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:57:29,743 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1077 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:57:29,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2025-01-09 03:57:29,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 363. [2025-01-09 03:57:29,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 280 states have (on average 1.4928571428571429) internal successors, (418), 283 states have internal predecessors, (418), 59 states have call successors, (59), 23 states have call predecessors, (59), 23 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2025-01-09 03:57:29,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 535 transitions. [2025-01-09 03:57:29,826 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 535 transitions. Word has length 101 [2025-01-09 03:57:29,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:57:29,828 INFO L471 AbstractCegarLoop]: Abstraction has 363 states and 535 transitions. [2025-01-09 03:57:29,829 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, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:57:29,829 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 535 transitions. [2025-01-09 03:57:29,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-01-09 03:57:29,836 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:57:29,837 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:57:29,846 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 03:57:30,037 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:57:30,038 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:57:30,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:57:30,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1591916463, now seen corresponding path program 1 times [2025-01-09 03:57:30,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:57:30,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217082215] [2025-01-09 03:57:30,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:57:30,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:57:30,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-01-09 03:57:30,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-01-09 03:57:30,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:57:30,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:57:30,316 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:57:30,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:57:30,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217082215] [2025-01-09 03:57:30,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217082215] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:57:30,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [46797198] [2025-01-09 03:57:30,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:57:30,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:57:30,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:57:30,322 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:57:30,325 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:57:30,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-01-09 03:57:30,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-01-09 03:57:30,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:57:30,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:57:30,750 INFO L256 TraceCheckSpWp]: Trace formula consists of 1034 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 03:57:30,758 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:57:30,780 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:57:30,784 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:57:30,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [46797198] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:57:30,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:57:30,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-01-09 03:57:30,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262827217] [2025-01-09 03:57:30,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:57:30,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:57:30,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:57:30,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:57:30,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:57:30,789 INFO L87 Difference]: Start difference. First operand 363 states and 535 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:57:30,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:57:30,827 INFO L93 Difference]: Finished difference Result 756 states and 1129 transitions. [2025-01-09 03:57:30,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:57:30,829 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 106 [2025-01-09 03:57:30,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:57:30,832 INFO L225 Difference]: With dead ends: 756 [2025-01-09 03:57:30,834 INFO L226 Difference]: Without dead ends: 419 [2025-01-09 03:57:30,836 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 106 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:57:30,837 INFO L435 NwaCegarLoop]: 550 mSDtfsCounter, 107 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 1037 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:57:30,837 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 1037 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:57:30,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2025-01-09 03:57:30,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 411. [2025-01-09 03:57:30,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 317 states have (on average 1.5110410094637223) internal successors, (479), 320 states have internal predecessors, (479), 70 states have call successors, (70), 23 states have call predecessors, (70), 23 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) [2025-01-09 03:57:30,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 618 transitions. [2025-01-09 03:57:30,887 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 618 transitions. Word has length 106 [2025-01-09 03:57:30,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:57:30,888 INFO L471 AbstractCegarLoop]: Abstraction has 411 states and 618 transitions. [2025-01-09 03:57:30,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:57:30,888 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 618 transitions. [2025-01-09 03:57:30,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-01-09 03:57:30,892 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:57:30,892 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:57:30,902 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 03:57:31,094 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:57:31,095 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:57:31,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:57:31,096 INFO L85 PathProgramCache]: Analyzing trace with hash 884721470, now seen corresponding path program 1 times [2025-01-09 03:57:31,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:57:31,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573175121] [2025-01-09 03:57:31,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:57:31,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:57:31,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-09 03:57:31,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-09 03:57:31,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:57:31,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:57:31,265 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:57:31,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:57:31,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573175121] [2025-01-09 03:57:31,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573175121] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:57:31,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [179142664] [2025-01-09 03:57:31,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:57:31,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:57:31,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:57:31,269 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:57:31,273 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:57:31,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-09 03:57:31,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-09 03:57:31,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:57:31,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:57:31,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 1039 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 03:57:31,529 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:57:31,596 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:57:31,596 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:57:31,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [179142664] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:57:31,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:57:31,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-01-09 03:57:31,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153450521] [2025-01-09 03:57:31,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:57:31,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:57:31,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:57:31,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:57:31,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:57:31,598 INFO L87 Difference]: Start difference. First operand 411 states and 618 transitions. Second operand has 5 states, 4 states have (on average 18.25) internal successors, (73), 5 states have internal predecessors, (73), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-01-09 03:57:31,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:57:31,657 INFO L93 Difference]: Finished difference Result 813 states and 1226 transitions. [2025-01-09 03:57:31,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:57:31,658 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 18.25) internal successors, (73), 5 states have internal predecessors, (73), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 107 [2025-01-09 03:57:31,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:57:31,660 INFO L225 Difference]: With dead ends: 813 [2025-01-09 03:57:31,661 INFO L226 Difference]: Without dead ends: 413 [2025-01-09 03:57:31,662 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 105 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:57:31,662 INFO L435 NwaCegarLoop]: 526 mSDtfsCounter, 2 mSDsluCounter, 1567 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2093 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:57:31,663 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2093 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:57:31,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2025-01-09 03:57:31,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 413. [2025-01-09 03:57:31,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 318 states have (on average 1.509433962264151) internal successors, (480), 322 states have internal predecessors, (480), 70 states have call successors, (70), 23 states have call predecessors, (70), 24 states have return successors, (71), 69 states have call predecessors, (71), 69 states have call successors, (71) [2025-01-09 03:57:31,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 621 transitions. [2025-01-09 03:57:31,687 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 621 transitions. Word has length 107 [2025-01-09 03:57:31,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:57:31,689 INFO L471 AbstractCegarLoop]: Abstraction has 413 states and 621 transitions. [2025-01-09 03:57:31,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 18.25) internal successors, (73), 5 states have internal predecessors, (73), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-01-09 03:57:31,689 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 621 transitions. [2025-01-09 03:57:31,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-01-09 03:57:31,694 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:57:31,694 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:57:31,706 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:57:31,894 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:57:31,895 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:57:31,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:57:31,896 INFO L85 PathProgramCache]: Analyzing trace with hash -108168173, now seen corresponding path program 1 times [2025-01-09 03:57:31,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:57:31,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252576906] [2025-01-09 03:57:31,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:57:31,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:57:31,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 03:57:31,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 03:57:31,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:57:31,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:57:32,087 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:57:32,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:57:32,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252576906] [2025-01-09 03:57:32,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252576906] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:57:32,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [839623920] [2025-01-09 03:57:32,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:57:32,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:57:32,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:57:32,092 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:57:32,093 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:57:32,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 03:57:32,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 03:57:32,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:57:32,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:57:32,325 INFO L256 TraceCheckSpWp]: Trace formula consists of 1040 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 03:57:32,329 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:57:32,367 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:57:32,367 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:57:32,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [839623920] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:57:32,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:57:32,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-01-09 03:57:32,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991421151] [2025-01-09 03:57:32,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:57:32,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:57:32,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:57:32,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:57:32,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-01-09 03:57:32,369 INFO L87 Difference]: Start difference. First operand 413 states and 621 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-01-09 03:57:32,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:57:32,427 INFO L93 Difference]: Finished difference Result 815 states and 1231 transitions. [2025-01-09 03:57:32,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:57:32,427 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 108 [2025-01-09 03:57:32,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:57:32,430 INFO L225 Difference]: With dead ends: 815 [2025-01-09 03:57:32,430 INFO L226 Difference]: Without dead ends: 415 [2025-01-09 03:57:32,432 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 106 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:57:32,433 INFO L435 NwaCegarLoop]: 524 mSDtfsCounter, 2 mSDsluCounter, 1555 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2079 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:57:32,433 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2079 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:57:32,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2025-01-09 03:57:32,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 415. [2025-01-09 03:57:32,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 319 states have (on average 1.5078369905956113) internal successors, (481), 324 states have internal predecessors, (481), 70 states have call successors, (70), 23 states have call predecessors, (70), 25 states have return successors, (76), 69 states have call predecessors, (76), 69 states have call successors, (76) [2025-01-09 03:57:32,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 627 transitions. [2025-01-09 03:57:32,453 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 627 transitions. Word has length 108 [2025-01-09 03:57:32,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:57:32,454 INFO L471 AbstractCegarLoop]: Abstraction has 415 states and 627 transitions. [2025-01-09 03:57:32,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-01-09 03:57:32,454 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 627 transitions. [2025-01-09 03:57:32,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-01-09 03:57:32,455 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:57:32,455 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:57:32,464 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 03:57:32,656 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:57:32,657 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:57:32,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:57:32,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1703731423, now seen corresponding path program 1 times [2025-01-09 03:57:32,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:57:32,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725303143] [2025-01-09 03:57:32,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:57:32,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:57:32,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 03:57:32,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 03:57:32,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:57:32,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:57:32,838 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:57:32,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:57:32,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725303143] [2025-01-09 03:57:32,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725303143] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:57:32,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:57:32,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:57:32,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921597244] [2025-01-09 03:57:32,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:57:32,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:57:32,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:57:32,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:57:32,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:57:32,840 INFO L87 Difference]: Start difference. First operand 415 states and 627 transitions. Second operand has 5 states, 4 states have (on average 17.75) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-01-09 03:57:32,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:57:32,893 INFO L93 Difference]: Finished difference Result 807 states and 1222 transitions. [2025-01-09 03:57:32,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:57:32,894 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.75) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 109 [2025-01-09 03:57:32,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:57:32,899 INFO L225 Difference]: With dead ends: 807 [2025-01-09 03:57:32,899 INFO L226 Difference]: Without dead ends: 415 [2025-01-09 03:57:32,900 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:57:32,901 INFO L435 NwaCegarLoop]: 527 mSDtfsCounter, 2 mSDsluCounter, 1570 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2097 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:57:32,901 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2097 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:57:32,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2025-01-09 03:57:32,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 415. [2025-01-09 03:57:32,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 319 states have (on average 1.5078369905956113) internal successors, (481), 324 states have internal predecessors, (481), 70 states have call successors, (70), 23 states have call predecessors, (70), 25 states have return successors, (75), 69 states have call predecessors, (75), 69 states have call successors, (75) [2025-01-09 03:57:32,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 626 transitions. [2025-01-09 03:57:32,938 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 626 transitions. Word has length 109 [2025-01-09 03:57:32,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:57:32,938 INFO L471 AbstractCegarLoop]: Abstraction has 415 states and 626 transitions. [2025-01-09 03:57:32,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.75) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-01-09 03:57:32,938 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 626 transitions. [2025-01-09 03:57:32,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 03:57:32,944 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:57:32,944 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:57:32,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 03:57:32,944 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:57:32,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:57:32,945 INFO L85 PathProgramCache]: Analyzing trace with hash 2063871316, now seen corresponding path program 2 times [2025-01-09 03:57:32,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:57:32,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152622199] [2025-01-09 03:57:32,945 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 03:57:32,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:57:32,984 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 110 statements into 2 equivalence classes. [2025-01-09 03:57:33,007 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 03:57:33,008 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 03:57:33,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:57:33,113 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:57:33,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:57:33,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152622199] [2025-01-09 03:57:33,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152622199] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:57:33,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:57:33,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:57:33,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163624709] [2025-01-09 03:57:33,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:57:33,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:57:33,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:57:33,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:57:33,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:57:33,116 INFO L87 Difference]: Start difference. First operand 415 states and 626 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-01-09 03:57:33,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:57:33,168 INFO L93 Difference]: Finished difference Result 805 states and 1217 transitions. [2025-01-09 03:57:33,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:57:33,169 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 110 [2025-01-09 03:57:33,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:57:33,172 INFO L225 Difference]: With dead ends: 805 [2025-01-09 03:57:33,172 INFO L226 Difference]: Without dead ends: 415 [2025-01-09 03:57:33,174 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:57:33,175 INFO L435 NwaCegarLoop]: 525 mSDtfsCounter, 2 mSDsluCounter, 1558 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2083 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:57:33,175 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2083 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:57:33,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2025-01-09 03:57:33,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 415. [2025-01-09 03:57:33,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 319 states have (on average 1.5078369905956113) internal successors, (481), 324 states have internal predecessors, (481), 70 states have call successors, (70), 23 states have call predecessors, (70), 25 states have return successors, (74), 69 states have call predecessors, (74), 69 states have call successors, (74) [2025-01-09 03:57:33,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 625 transitions. [2025-01-09 03:57:33,195 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 625 transitions. Word has length 110 [2025-01-09 03:57:33,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:57:33,195 INFO L471 AbstractCegarLoop]: Abstraction has 415 states and 625 transitions. [2025-01-09 03:57:33,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-01-09 03:57:33,195 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 625 transitions. [2025-01-09 03:57:33,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-01-09 03:57:33,197 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:57:33,197 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:57:33,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 03:57:33,197 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:57:33,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:57:33,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1476700928, now seen corresponding path program 3 times [2025-01-09 03:57:33,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:57:33,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900993266] [2025-01-09 03:57:33,198 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 03:57:33,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:57:33,215 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 111 statements into 3 equivalence classes. [2025-01-09 03:57:33,225 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 99 of 111 statements. [2025-01-09 03:57:33,225 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-09 03:57:33,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:57:33,313 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:57:33,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:57:33,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900993266] [2025-01-09 03:57:33,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900993266] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:57:33,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:57:33,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:57:33,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671159080] [2025-01-09 03:57:33,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:57:33,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:57:33,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:57:33,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:57:33,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:57:33,315 INFO L87 Difference]: Start difference. First operand 415 states and 625 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-01-09 03:57:33,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:57:33,368 INFO L93 Difference]: Finished difference Result 807 states and 1223 transitions. [2025-01-09 03:57:33,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:57:33,369 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 111 [2025-01-09 03:57:33,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:57:33,372 INFO L225 Difference]: With dead ends: 807 [2025-01-09 03:57:33,372 INFO L226 Difference]: Without dead ends: 417 [2025-01-09 03:57:33,373 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:57:33,374 INFO L435 NwaCegarLoop]: 528 mSDtfsCounter, 1 mSDsluCounter, 1566 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2094 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:57:33,374 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2094 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:57:33,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2025-01-09 03:57:33,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 417. [2025-01-09 03:57:33,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 320 states have (on average 1.50625) internal successors, (482), 326 states have internal predecessors, (482), 70 states have call successors, (70), 23 states have call predecessors, (70), 26 states have return successors, (79), 69 states have call predecessors, (79), 69 states have call successors, (79) [2025-01-09 03:57:33,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 631 transitions. [2025-01-09 03:57:33,389 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 631 transitions. Word has length 111 [2025-01-09 03:57:33,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:57:33,389 INFO L471 AbstractCegarLoop]: Abstraction has 417 states and 631 transitions. [2025-01-09 03:57:33,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-01-09 03:57:33,389 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 631 transitions. [2025-01-09 03:57:33,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-01-09 03:57:33,391 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:57:33,391 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:57:33,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 03:57:33,391 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:57:33,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:57:33,392 INFO L85 PathProgramCache]: Analyzing trace with hash -777277351, now seen corresponding path program 1 times [2025-01-09 03:57:33,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:57:33,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125733397] [2025-01-09 03:57:33,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:57:33,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:57:33,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 03:57:33,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 03:57:33,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:57:33,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:57:33,540 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:57:33,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:57:33,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125733397] [2025-01-09 03:57:33,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125733397] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:57:33,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:57:33,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:57:33,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545772704] [2025-01-09 03:57:33,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:57:33,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:57:33,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:57:33,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:57:33,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:57:33,542 INFO L87 Difference]: Start difference. First operand 417 states and 631 transitions. Second operand has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 states have internal predecessors, (74), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-01-09 03:57:33,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:57:33,584 INFO L93 Difference]: Finished difference Result 813 states and 1233 transitions. [2025-01-09 03:57:33,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:57:33,584 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 states have internal predecessors, (74), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 112 [2025-01-09 03:57:33,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:57:33,587 INFO L225 Difference]: With dead ends: 813 [2025-01-09 03:57:33,587 INFO L226 Difference]: Without dead ends: 419 [2025-01-09 03:57:33,589 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:57:33,589 INFO L435 NwaCegarLoop]: 528 mSDtfsCounter, 1 mSDsluCounter, 1572 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2100 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:57:33,590 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2100 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:57:33,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2025-01-09 03:57:33,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 419. [2025-01-09 03:57:33,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 321 states have (on average 1.5046728971962617) internal successors, (483), 328 states have internal predecessors, (483), 70 states have call successors, (70), 23 states have call predecessors, (70), 27 states have return successors, (81), 69 states have call predecessors, (81), 69 states have call successors, (81) [2025-01-09 03:57:33,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 634 transitions. [2025-01-09 03:57:33,606 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 634 transitions. Word has length 112 [2025-01-09 03:57:33,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:57:33,606 INFO L471 AbstractCegarLoop]: Abstraction has 419 states and 634 transitions. [2025-01-09 03:57:33,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 states have internal predecessors, (74), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-01-09 03:57:33,607 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 634 transitions. [2025-01-09 03:57:33,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-01-09 03:57:33,608 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:57:33,608 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:57:33,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 03:57:33,609 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:57:33,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:57:33,609 INFO L85 PathProgramCache]: Analyzing trace with hash -436762165, now seen corresponding path program 1 times [2025-01-09 03:57:33,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:57:33,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397146560] [2025-01-09 03:57:33,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:57:33,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:57:33,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-01-09 03:57:33,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-01-09 03:57:33,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:57:33,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:57:33,706 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:57:33,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:57:33,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397146560] [2025-01-09 03:57:33,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397146560] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:57:33,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1380587233] [2025-01-09 03:57:33,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:57:33,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:57:33,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:57:33,715 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:57:33,718 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:57:33,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-01-09 03:57:33,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-01-09 03:57:33,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:57:33,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:57:33,954 INFO L256 TraceCheckSpWp]: Trace formula consists of 1045 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 03:57:33,957 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:57:33,978 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:57:33,978 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:57:34,041 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:57:34,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1380587233] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:57:34,042 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 03:57:34,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-01-09 03:57:34,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584295937] [2025-01-09 03:57:34,042 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 03:57:34,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 03:57:34,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:57:34,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 03:57:34,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:57:34,043 INFO L87 Difference]: Start difference. First operand 419 states and 634 transitions. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 03:57:34,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:57:34,177 INFO L93 Difference]: Finished difference Result 975 states and 1527 transitions. [2025-01-09 03:57:34,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:57:34,178 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 113 [2025-01-09 03:57:34,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:57:34,182 INFO L225 Difference]: With dead ends: 975 [2025-01-09 03:57:34,182 INFO L226 Difference]: Without dead ends: 765 [2025-01-09 03:57:34,184 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:57:34,184 INFO L435 NwaCegarLoop]: 576 mSDtfsCounter, 595 mSDsluCounter, 1421 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 640 SdHoareTripleChecker+Valid, 1997 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:57:34,185 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [640 Valid, 1997 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:57:34,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2025-01-09 03:57:34,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 741. [2025-01-09 03:57:34,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 741 states, 579 states have (on average 1.5803108808290156) internal successors, (915), 586 states have internal predecessors, (915), 134 states have call successors, (134), 23 states have call predecessors, (134), 27 states have return successors, (155), 133 states have call predecessors, (155), 133 states have call successors, (155) [2025-01-09 03:57:34,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 1204 transitions. [2025-01-09 03:57:34,213 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 1204 transitions. Word has length 113 [2025-01-09 03:57:34,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:57:34,213 INFO L471 AbstractCegarLoop]: Abstraction has 741 states and 1204 transitions. [2025-01-09 03:57:34,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 03:57:34,214 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 1204 transitions. [2025-01-09 03:57:34,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-01-09 03:57:34,217 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:57:34,217 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:57:34,225 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 03:57:34,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:57:34,418 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:57:34,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:57:34,419 INFO L85 PathProgramCache]: Analyzing trace with hash 384190615, now seen corresponding path program 1 times [2025-01-09 03:57:34,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:57:34,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417090319] [2025-01-09 03:57:34,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:57:34,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:57:34,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-01-09 03:57:34,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-01-09 03:57:34,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:57:34,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:57:34,477 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:34,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:57:34,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417090319] [2025-01-09 03:57:34,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417090319] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:57:34,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:57:34,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:57:34,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046629971] [2025-01-09 03:57:34,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:57:34,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:57:34,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:57:34,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:57:34,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:57:34,479 INFO L87 Difference]: Start difference. First operand 741 states and 1204 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:57:34,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:57:34,532 INFO L93 Difference]: Finished difference Result 1742 states and 2875 transitions. [2025-01-09 03:57:34,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:57:34,532 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 120 [2025-01-09 03:57:34,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:57:34,538 INFO L225 Difference]: With dead ends: 1742 [2025-01-09 03:57:34,538 INFO L226 Difference]: Without dead ends: 1067 [2025-01-09 03:57:34,541 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:57:34,541 INFO L435 NwaCegarLoop]: 550 mSDtfsCounter, 105 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 1082 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:57:34,541 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 1082 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:57:34,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1067 states. [2025-01-09 03:57:34,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1067 to 1059. [2025-01-09 03:57:34,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1059 states, 833 states have (on average 1.6002400960384153) internal successors, (1333), 840 states have internal predecessors, (1333), 198 states have call successors, (198), 23 states have call predecessors, (198), 27 states have return successors, (229), 197 states have call predecessors, (229), 197 states have call successors, (229) [2025-01-09 03:57:34,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1059 states to 1059 states and 1760 transitions. [2025-01-09 03:57:34,586 INFO L78 Accepts]: Start accepts. Automaton has 1059 states and 1760 transitions. Word has length 120 [2025-01-09 03:57:34,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:57:34,586 INFO L471 AbstractCegarLoop]: Abstraction has 1059 states and 1760 transitions. [2025-01-09 03:57:34,586 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:57:34,586 INFO L276 IsEmpty]: Start isEmpty. Operand 1059 states and 1760 transitions. [2025-01-09 03:57:34,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-01-09 03:57:34,591 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:57:34,592 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:57:34,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 03:57:34,592 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:57:34,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:57:34,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1232005341, now seen corresponding path program 1 times [2025-01-09 03:57:34,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:57:34,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353981689] [2025-01-09 03:57:34,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:57:34,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:57:34,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 03:57:34,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 03:57:34,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:57:34,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:57:34,654 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:34,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:57:34,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353981689] [2025-01-09 03:57:34,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353981689] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:57:34,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:57:34,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:57:34,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079336292] [2025-01-09 03:57:34,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:57:34,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:57:34,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:57:34,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:57:34,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:57:34,656 INFO L87 Difference]: Start difference. First operand 1059 states and 1760 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:57:34,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:57:34,708 INFO L93 Difference]: Finished difference Result 2505 states and 4191 transitions. [2025-01-09 03:57:34,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:57:34,709 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 121 [2025-01-09 03:57:34,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:57:34,718 INFO L225 Difference]: With dead ends: 2505 [2025-01-09 03:57:34,718 INFO L226 Difference]: Without dead ends: 1563 [2025-01-09 03:57:34,722 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:57:34,723 INFO L435 NwaCegarLoop]: 542 mSDtfsCounter, 103 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 1070 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:57:34,723 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 1070 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:57:34,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1563 states. [2025-01-09 03:57:34,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1563 to 1555. [2025-01-09 03:57:34,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1555 states, 1234 states have (on average 1.614262560777958) internal successors, (1992), 1241 states have internal predecessors, (1992), 293 states have call successors, (293), 23 states have call predecessors, (293), 27 states have return successors, (324), 292 states have call predecessors, (324), 292 states have call successors, (324) [2025-01-09 03:57:34,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1555 states to 1555 states and 2609 transitions. [2025-01-09 03:57:34,785 INFO L78 Accepts]: Start accepts. Automaton has 1555 states and 2609 transitions. Word has length 121 [2025-01-09 03:57:34,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:57:34,785 INFO L471 AbstractCegarLoop]: Abstraction has 1555 states and 2609 transitions. [2025-01-09 03:57:34,785 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:57:34,785 INFO L276 IsEmpty]: Start isEmpty. Operand 1555 states and 2609 transitions. [2025-01-09 03:57:34,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-01-09 03:57:34,793 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:57:34,793 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:57:34,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 03:57:34,793 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:57:34,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:57:34,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1284782343, now seen corresponding path program 1 times [2025-01-09 03:57:34,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:57:34,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534783908] [2025-01-09 03:57:34,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:57:34,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:57:34,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 03:57:34,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 03:57:34,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:57:34,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:57:34,847 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:34,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:57:34,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534783908] [2025-01-09 03:57:34,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534783908] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:57:34,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:57:34,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:57:34,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613135053] [2025-01-09 03:57:34,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:57:34,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:57:34,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:57:34,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:57:34,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:57:34,849 INFO L87 Difference]: Start difference. First operand 1555 states and 2609 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:57:34,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:57:34,912 INFO L93 Difference]: Finished difference Result 3629 states and 6138 transitions. [2025-01-09 03:57:34,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:57:34,912 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 122 [2025-01-09 03:57:34,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:57:34,926 INFO L225 Difference]: With dead ends: 3629 [2025-01-09 03:57:34,926 INFO L226 Difference]: Without dead ends: 2312 [2025-01-09 03:57:34,932 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:57:34,932 INFO L435 NwaCegarLoop]: 533 mSDtfsCounter, 101 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 1057 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:57:34,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 1057 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:57:34,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2312 states. [2025-01-09 03:57:35,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2312 to 2304. [2025-01-09 03:57:35,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2304 states, 1860 states have (on average 1.625268817204301) internal successors, (3023), 1867 states have internal predecessors, (3023), 416 states have call successors, (416), 23 states have call predecessors, (416), 27 states have return successors, (463), 415 states have call predecessors, (463), 415 states have call successors, (463) [2025-01-09 03:57:35,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2304 states to 2304 states and 3902 transitions. [2025-01-09 03:57:35,039 INFO L78 Accepts]: Start accepts. Automaton has 2304 states and 3902 transitions. Word has length 122 [2025-01-09 03:57:35,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:57:35,039 INFO L471 AbstractCegarLoop]: Abstraction has 2304 states and 3902 transitions. [2025-01-09 03:57:35,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:57:35,040 INFO L276 IsEmpty]: Start isEmpty. Operand 2304 states and 3902 transitions. [2025-01-09 03:57:35,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-01-09 03:57:35,049 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:57:35,050 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:57:35,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 03:57:35,050 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:57:35,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:57:35,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1052396540, now seen corresponding path program 1 times [2025-01-09 03:57:35,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:57:35,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370209350] [2025-01-09 03:57:35,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:57:35,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:57:35,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-09 03:57:35,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-09 03:57:35,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:57:35,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:57:35,135 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:35,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:57:35,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370209350] [2025-01-09 03:57:35,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370209350] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:57:35,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:57:35,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:57:35,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187654964] [2025-01-09 03:57:35,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:57:35,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:57:35,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:57:35,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:57:35,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:57:35,138 INFO L87 Difference]: Start difference. First operand 2304 states and 3902 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:57:35,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:57:35,225 INFO L93 Difference]: Finished difference Result 5377 states and 9169 transitions. [2025-01-09 03:57:35,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:57:35,226 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 123 [2025-01-09 03:57:35,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:57:35,245 INFO L225 Difference]: With dead ends: 5377 [2025-01-09 03:57:35,245 INFO L226 Difference]: Without dead ends: 3508 [2025-01-09 03:57:35,254 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:57:35,255 INFO L435 NwaCegarLoop]: 533 mSDtfsCounter, 99 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 1057 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:57:35,255 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 1057 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:57:35,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3508 states. [2025-01-09 03:57:35,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3508 to 3500. [2025-01-09 03:57:35,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3500 states, 2877 states have (on average 1.632603406326034) internal successors, (4697), 2884 states have internal predecessors, (4697), 595 states have call successors, (595), 23 states have call predecessors, (595), 27 states have return successors, (668), 594 states have call predecessors, (668), 594 states have call successors, (668) [2025-01-09 03:57:35,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3500 states to 3500 states and 5960 transitions. [2025-01-09 03:57:35,419 INFO L78 Accepts]: Start accepts. Automaton has 3500 states and 5960 transitions. Word has length 123 [2025-01-09 03:57:35,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:57:35,420 INFO L471 AbstractCegarLoop]: Abstraction has 3500 states and 5960 transitions. [2025-01-09 03:57:35,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:57:35,420 INFO L276 IsEmpty]: Start isEmpty. Operand 3500 states and 5960 transitions. [2025-01-09 03:57:35,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-01-09 03:57:35,432 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:57:35,432 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:57:35,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 03:57:35,433 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:57:35,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:57:35,433 INFO L85 PathProgramCache]: Analyzing trace with hash -497281419, now seen corresponding path program 1 times [2025-01-09 03:57:35,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:57:35,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616924723] [2025-01-09 03:57:35,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:57:35,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:57:35,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-01-09 03:57:35,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-01-09 03:57:35,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:57:35,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:57:35,492 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:35,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:57:35,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616924723] [2025-01-09 03:57:35,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616924723] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:57:35,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:57:35,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:57:35,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750915559] [2025-01-09 03:57:35,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:57:35,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:57:35,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:57:35,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:57:35,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:57:35,494 INFO L87 Difference]: Start difference. First operand 3500 states and 5960 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:57:35,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:57:35,684 INFO L93 Difference]: Finished difference Result 8248 states and 14139 transitions. [2025-01-09 03:57:35,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:57:35,685 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 124 [2025-01-09 03:57:35,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:57:35,713 INFO L225 Difference]: With dead ends: 8248 [2025-01-09 03:57:35,713 INFO L226 Difference]: Without dead ends: 5484 [2025-01-09 03:57:35,723 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:57:35,723 INFO L435 NwaCegarLoop]: 555 mSDtfsCounter, 97 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 1079 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:57:35,723 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 1079 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:57:35,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5484 states. [2025-01-09 03:57:35,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5484 to 5476. [2025-01-09 03:57:35,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5476 states, 4477 states have (on average 1.6292159928523564) internal successors, (7294), 4484 states have internal predecessors, (7294), 971 states have call successors, (971), 23 states have call predecessors, (971), 27 states have return successors, (1088), 970 states have call predecessors, (1088), 970 states have call successors, (1088) [2025-01-09 03:57:35,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5476 states to 5476 states and 9353 transitions. [2025-01-09 03:57:36,002 INFO L78 Accepts]: Start accepts. Automaton has 5476 states and 9353 transitions. Word has length 124 [2025-01-09 03:57:36,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:57:36,002 INFO L471 AbstractCegarLoop]: Abstraction has 5476 states and 9353 transitions. [2025-01-09 03:57:36,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:57:36,003 INFO L276 IsEmpty]: Start isEmpty. Operand 5476 states and 9353 transitions. [2025-01-09 03:57:36,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-01-09 03:57:36,019 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:57:36,019 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:57:36,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 03:57:36,019 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:57:36,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:57:36,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1098702712, now seen corresponding path program 1 times [2025-01-09 03:57:36,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:57:36,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191103076] [2025-01-09 03:57:36,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:57:36,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:57:36,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 03:57:36,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 03:57:36,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:57:36,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:57:36,115 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:36,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:57:36,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191103076] [2025-01-09 03:57:36,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191103076] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:57:36,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:57:36,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:57:36,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247413662] [2025-01-09 03:57:36,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:57:36,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:57:36,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:57:36,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:57:36,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:57:36,117 INFO L87 Difference]: Start difference. First operand 5476 states and 9353 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:57:36,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:57:36,333 INFO L93 Difference]: Finished difference Result 13452 states and 23116 transitions. [2025-01-09 03:57:36,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:57:36,334 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 125 [2025-01-09 03:57:36,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:57:36,382 INFO L225 Difference]: With dead ends: 13452 [2025-01-09 03:57:36,382 INFO L226 Difference]: Without dead ends: 9073 [2025-01-09 03:57:36,401 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:57:36,401 INFO L435 NwaCegarLoop]: 540 mSDtfsCounter, 95 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 1068 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:57:36,401 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 1068 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:57:36,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9073 states. [2025-01-09 03:57:36,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9073 to 9065. [2025-01-09 03:57:36,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9065 states, 7460 states have (on average 1.6281501340482574) internal successors, (12146), 7467 states have internal predecessors, (12146), 1577 states have call successors, (1577), 23 states have call predecessors, (1577), 27 states have return successors, (1772), 1576 states have call predecessors, (1772), 1576 states have call successors, (1772) [2025-01-09 03:57:36,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9065 states to 9065 states and 15495 transitions. [2025-01-09 03:57:36,955 INFO L78 Accepts]: Start accepts. Automaton has 9065 states and 15495 transitions. Word has length 125 [2025-01-09 03:57:36,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:57:36,955 INFO L471 AbstractCegarLoop]: Abstraction has 9065 states and 15495 transitions. [2025-01-09 03:57:36,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:57:36,956 INFO L276 IsEmpty]: Start isEmpty. Operand 9065 states and 15495 transitions. [2025-01-09 03:57:36,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-01-09 03:57:36,980 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:57:36,981 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:57:36,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 03:57:36,982 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:57:36,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:57:36,982 INFO L85 PathProgramCache]: Analyzing trace with hash 638260259, now seen corresponding path program 1 times [2025-01-09 03:57:36,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:57:36,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638773920] [2025-01-09 03:57:36,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:57:36,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:57:37,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-01-09 03:57:37,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-01-09 03:57:37,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:57:37,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:57:37,047 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:37,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:57:37,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638773920] [2025-01-09 03:57:37,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638773920] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:57:37,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:57:37,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:57:37,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601836106] [2025-01-09 03:57:37,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:57:37,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:57:37,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:57:37,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:57:37,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:57:37,051 INFO L87 Difference]: Start difference. First operand 9065 states and 15495 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:57:37,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:57:37,463 INFO L93 Difference]: Finished difference Result 23398 states and 40143 transitions. [2025-01-09 03:57:37,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:57:37,467 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 126 [2025-01-09 03:57:37,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:57:37,552 INFO L225 Difference]: With dead ends: 23398 [2025-01-09 03:57:37,552 INFO L226 Difference]: Without dead ends: 15860 [2025-01-09 03:57:37,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:57:37,593 INFO L435 NwaCegarLoop]: 556 mSDtfsCounter, 93 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 1088 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:57:37,593 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 1088 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:57:37,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15860 states. [2025-01-09 03:57:38,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15860 to 15852. [2025-01-09 03:57:38,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15852 states, 13044 states have (on average 1.6192885617908617) internal successors, (21122), 13051 states have internal predecessors, (21122), 2780 states have call successors, (2780), 23 states have call predecessors, (2780), 27 states have return successors, (3119), 2779 states have call predecessors, (3119), 2779 states have call successors, (3119) [2025-01-09 03:57:38,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15852 states to 15852 states and 27021 transitions. [2025-01-09 03:57:38,301 INFO L78 Accepts]: Start accepts. Automaton has 15852 states and 27021 transitions. Word has length 126 [2025-01-09 03:57:38,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:57:38,302 INFO L471 AbstractCegarLoop]: Abstraction has 15852 states and 27021 transitions. [2025-01-09 03:57:38,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:57:38,303 INFO L276 IsEmpty]: Start isEmpty. Operand 15852 states and 27021 transitions. [2025-01-09 03:57:38,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-01-09 03:57:38,336 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:57:38,336 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:57:38,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 03:57:38,336 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:57:38,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:57:38,337 INFO L85 PathProgramCache]: Analyzing trace with hash 83914377, now seen corresponding path program 1 times [2025-01-09 03:57:38,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:57:38,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534430756] [2025-01-09 03:57:38,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:57:38,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:57:38,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-01-09 03:57:38,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-01-09 03:57:38,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:57:38,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:57:38,400 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:38,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:57:38,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534430756] [2025-01-09 03:57:38,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534430756] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:57:38,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:57:38,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:57:38,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767300763] [2025-01-09 03:57:38,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:57:38,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:57:38,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:57:38,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:57:38,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:57:38,401 INFO L87 Difference]: Start difference. First operand 15852 states and 27021 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:57:39,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:57:39,049 INFO L93 Difference]: Finished difference Result 41924 states and 71762 transitions. [2025-01-09 03:57:39,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:57:39,050 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 127 [2025-01-09 03:57:39,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:57:39,174 INFO L225 Difference]: With dead ends: 41924 [2025-01-09 03:57:39,174 INFO L226 Difference]: Without dead ends: 28212 [2025-01-09 03:57:39,335 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:57:39,335 INFO L435 NwaCegarLoop]: 533 mSDtfsCounter, 91 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 1060 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:57:39,336 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 1060 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:57:39,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28212 states. [2025-01-09 03:57:40,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28212 to 28204. [2025-01-09 03:57:40,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28204 states, 23357 states have (on average 1.6150618658218092) internal successors, (37723), 23364 states have internal predecessors, (37723), 4819 states have call successors, (4819), 23 states have call predecessors, (4819), 27 states have return successors, (5432), 4818 states have call predecessors, (5432), 4818 states have call successors, (5432) [2025-01-09 03:57:40,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28204 states to 28204 states and 47974 transitions. [2025-01-09 03:57:40,595 INFO L78 Accepts]: Start accepts. Automaton has 28204 states and 47974 transitions. Word has length 127 [2025-01-09 03:57:40,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:57:40,596 INFO L471 AbstractCegarLoop]: Abstraction has 28204 states and 47974 transitions. [2025-01-09 03:57:40,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:57:40,596 INFO L276 IsEmpty]: Start isEmpty. Operand 28204 states and 47974 transitions. [2025-01-09 03:57:40,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-01-09 03:57:40,629 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:57:40,629 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:57:40,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 03:57:40,629 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:57:40,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:57:40,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1378492603, now seen corresponding path program 1 times [2025-01-09 03:57:40,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:57:40,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979163513] [2025-01-09 03:57:40,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:57:40,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:57:40,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-01-09 03:57:40,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-01-09 03:57:40,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:57:40,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:57:40,691 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:40,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:57:40,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979163513] [2025-01-09 03:57:40,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979163513] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:57:40,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:57:40,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:57:40,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067445985] [2025-01-09 03:57:40,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:57:40,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:57:40,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:57:40,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:57:40,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:57:40,693 INFO L87 Difference]: Start difference. First operand 28204 states and 47974 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:57:41,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:57:41,727 INFO L93 Difference]: Finished difference Result 76851 states and 131154 transitions. [2025-01-09 03:57:41,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:57:41,728 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 128 [2025-01-09 03:57:41,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:57:41,947 INFO L225 Difference]: With dead ends: 76851 [2025-01-09 03:57:41,948 INFO L226 Difference]: Without dead ends: 51522 [2025-01-09 03:57:42,014 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:57:42,014 INFO L435 NwaCegarLoop]: 542 mSDtfsCounter, 89 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 1070 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:57:42,015 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 1070 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:57:42,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51522 states. [2025-01-09 03:57:44,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51522 to 51514. [2025-01-09 03:57:44,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51514 states, 42952 states have (on average 1.6093080648165394) internal successors, (69123), 42959 states have internal predecessors, (69123), 8534 states have call successors, (8534), 23 states have call predecessors, (8534), 27 states have return successors, (9679), 8533 states have call predecessors, (9679), 8533 states have call successors, (9679) [2025-01-09 03:57:44,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51514 states to 51514 states and 87336 transitions. [2025-01-09 03:57:44,343 INFO L78 Accepts]: Start accepts. Automaton has 51514 states and 87336 transitions. Word has length 128 [2025-01-09 03:57:44,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:57:44,344 INFO L471 AbstractCegarLoop]: Abstraction has 51514 states and 87336 transitions. [2025-01-09 03:57:44,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:57:44,344 INFO L276 IsEmpty]: Start isEmpty. Operand 51514 states and 87336 transitions. [2025-01-09 03:57:44,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-01-09 03:57:44,384 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:57:44,384 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:57:44,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 03:57:44,385 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:57:44,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:57:44,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1614804073, now seen corresponding path program 1 times [2025-01-09 03:57:44,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:57:44,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000092654] [2025-01-09 03:57:44,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:57:44,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:57:44,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-01-09 03:57:44,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-01-09 03:57:44,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:57:44,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:57:44,445 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:44,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:57:44,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000092654] [2025-01-09 03:57:44,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000092654] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:57:44,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:57:44,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:57:44,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606117973] [2025-01-09 03:57:44,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:57:44,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:57:44,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:57:44,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:57:44,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:57:44,446 INFO L87 Difference]: Start difference. First operand 51514 states and 87336 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:57:46,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:57:46,274 INFO L93 Difference]: Finished difference Result 96103 states and 163253 transitions. [2025-01-09 03:57:46,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:57:46,276 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 129 [2025-01-09 03:57:46,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:57:46,756 INFO L225 Difference]: With dead ends: 96103 [2025-01-09 03:57:46,756 INFO L226 Difference]: Without dead ends: 95893 [2025-01-09 03:57:46,823 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:57:46,823 INFO L435 NwaCegarLoop]: 535 mSDtfsCounter, 84 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 1066 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:57:46,823 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 1066 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:57:46,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95893 states. [2025-01-09 03:57:50,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95893 to 95885. [2025-01-09 03:57:50,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95885 states, 80524 states have (on average 1.6020689483880581) internal successors, (129005), 80531 states have internal predecessors, (129005), 15333 states have call successors, (15333), 23 states have call predecessors, (15333), 27 states have return successors, (17524), 15332 states have call predecessors, (17524), 15332 states have call successors, (17524) [2025-01-09 03:57:50,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95885 states to 95885 states and 161862 transitions. [2025-01-09 03:57:50,717 INFO L78 Accepts]: Start accepts. Automaton has 95885 states and 161862 transitions. Word has length 129 [2025-01-09 03:57:50,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:57:50,717 INFO L471 AbstractCegarLoop]: Abstraction has 95885 states and 161862 transitions. [2025-01-09 03:57:50,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:57:50,718 INFO L276 IsEmpty]: Start isEmpty. Operand 95885 states and 161862 transitions. [2025-01-09 03:57:50,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-01-09 03:57:50,759 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:57:50,759 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:57:50,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 03:57:50,759 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:57:50,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:57:50,760 INFO L85 PathProgramCache]: Analyzing trace with hash 192124100, now seen corresponding path program 1 times [2025-01-09 03:57:50,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:57:50,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993624204] [2025-01-09 03:57:50,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:57:50,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:57:50,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-01-09 03:57:50,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-01-09 03:57:50,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:57:50,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:57:51,416 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:51,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:57:51,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993624204] [2025-01-09 03:57:51,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993624204] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:57:51,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:57:51,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 03:57:51,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130831505] [2025-01-09 03:57:51,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:57:51,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 03:57:51,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:57:51,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 03:57:51,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2025-01-09 03:57:51,419 INFO L87 Difference]: Start difference. First operand 95885 states and 161862 transitions. Second operand has 14 states, 12 states have (on average 7.416666666666667) internal successors, (89), 12 states have internal predecessors, (89), 6 states have call successors, (15), 3 states have call predecessors, (15), 4 states have return successors, (13), 6 states have call predecessors, (13), 6 states have call successors, (13) [2025-01-09 03:57:56,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:57:56,259 INFO L93 Difference]: Finished difference Result 191399 states and 328499 transitions. [2025-01-09 03:57:56,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-01-09 03:57:56,261 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.416666666666667) internal successors, (89), 12 states have internal predecessors, (89), 6 states have call successors, (15), 3 states have call predecessors, (15), 4 states have return successors, (13), 6 states have call predecessors, (13), 6 states have call successors, (13) Word has length 130 [2025-01-09 03:57:56,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:57:57,321 INFO L225 Difference]: With dead ends: 191399 [2025-01-09 03:57:57,322 INFO L226 Difference]: Without dead ends: 191195 [2025-01-09 03:57:57,418 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=159, Invalid=833, Unknown=0, NotChecked=0, Total=992 [2025-01-09 03:57:57,420 INFO L435 NwaCegarLoop]: 621 mSDtfsCounter, 1687 mSDsluCounter, 6608 mSDsCounter, 0 mSdLazyCounter, 1489 mSolverCounterSat, 554 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1687 SdHoareTripleChecker+Valid, 7229 SdHoareTripleChecker+Invalid, 2043 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 554 IncrementalHoareTripleChecker+Valid, 1489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:57:57,420 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1687 Valid, 7229 Invalid, 2043 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [554 Valid, 1489 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 03:57:57,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191195 states. [2025-01-09 03:58:03,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191195 to 191026. [2025-01-09 03:58:03,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191026 states, 160487 states have (on average 1.602771564051917) internal successors, (257224), 160391 states have internal predecessors, (257224), 30469 states have call successors, (30469), 62 states have call predecessors, (30469), 69 states have return successors, (38125), 30578 states have call predecessors, (38125), 30466 states have call successors, (38125) [2025-01-09 03:58:04,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191026 states to 191026 states and 325818 transitions. [2025-01-09 03:58:04,743 INFO L78 Accepts]: Start accepts. Automaton has 191026 states and 325818 transitions. Word has length 130 [2025-01-09 03:58:04,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:58:04,744 INFO L471 AbstractCegarLoop]: Abstraction has 191026 states and 325818 transitions. [2025-01-09 03:58:04,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.416666666666667) internal successors, (89), 12 states have internal predecessors, (89), 6 states have call successors, (15), 3 states have call predecessors, (15), 4 states have return successors, (13), 6 states have call predecessors, (13), 6 states have call successors, (13) [2025-01-09 03:58:04,744 INFO L276 IsEmpty]: Start isEmpty. Operand 191026 states and 325818 transitions. [2025-01-09 03:58:04,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-01-09 03:58:04,836 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:58:04,837 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:58:04,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 03:58:04,837 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:58:04,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:58:04,837 INFO L85 PathProgramCache]: Analyzing trace with hash -570773575, now seen corresponding path program 1 times [2025-01-09 03:58:04,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:58:04,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061216307] [2025-01-09 03:58:04,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:58:04,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:58:04,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 03:58:04,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 03:58:04,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:58:04,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:58:05,030 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:58:05,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:58:05,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061216307] [2025-01-09 03:58:05,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061216307] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:58:05,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:58:05,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 03:58:05,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411928627] [2025-01-09 03:58:05,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:58:05,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 03:58:05,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:58:05,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 03:58:05,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-01-09 03:58:05,032 INFO L87 Difference]: Start difference. First operand 191026 states and 325818 transitions. Second operand has 10 states, 10 states have (on average 9.0) internal successors, (90), 8 states have internal predecessors, (90), 5 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13)