./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec9_product12.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/email_spec9_product12.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 4d7925e6725ebc9ccc1628dac3a92336bad7d7149419f1b3b2e679ed4e3055d5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 14:27:05,185 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 14:27:05,246 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 14:27:05,252 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 14:27:05,254 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 14:27:05,271 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 14:27:05,271 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 14:27:05,271 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 14:27:05,271 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 14:27:05,272 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 14:27:05,272 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 14:27:05,272 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 14:27:05,272 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 14:27:05,272 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 14:27:05,272 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 14:27:05,272 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 14:27:05,272 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 14:27:05,272 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 14:27:05,272 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 14:27:05,272 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 14:27:05,272 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 14:27:05,272 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 14:27:05,272 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 14:27:05,272 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 14:27:05,273 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 14:27:05,273 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 14:27:05,273 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 14:27:05,273 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 14:27:05,273 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 14:27:05,273 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 14:27:05,273 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 14:27:05,273 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 14:27:05,273 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:27:05,273 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 14:27:05,273 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 14:27:05,273 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 14:27:05,273 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 14:27:05,273 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 14:27:05,273 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 14:27:05,274 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 14:27:05,274 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 14:27:05,274 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 14:27:05,274 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 14:27:05,274 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/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 -> 4d7925e6725ebc9ccc1628dac3a92336bad7d7149419f1b3b2e679ed4e3055d5 [2025-03-03 14:27:05,500 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 14:27:05,508 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 14:27:05,511 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 14:27:05,512 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 14:27:05,512 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 14:27:05,513 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec9_product12.cil.c [2025-03-03 14:27:06,716 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08d47b38f/94540df0b69946299248ec00d8ebcd48/FLAGef5186131 [2025-03-03 14:27:07,037 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 14:27:07,038 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec9_product12.cil.c [2025-03-03 14:27:07,061 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08d47b38f/94540df0b69946299248ec00d8ebcd48/FLAGef5186131 [2025-03-03 14:27:07,078 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08d47b38f/94540df0b69946299248ec00d8ebcd48 [2025-03-03 14:27:07,081 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 14:27:07,082 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 14:27:07,083 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 14:27:07,084 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 14:27:07,087 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 14:27:07,088 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:27:07" (1/1) ... [2025-03-03 14:27:07,090 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12cdb26e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:27:07, skipping insertion in model container [2025-03-03 14:27:07,090 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:27:07" (1/1) ... [2025-03-03 14:27:07,141 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 14:27:07,417 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec9_product12.cil.c[29763,29776] [2025-03-03 14:27:07,496 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:27:07,509 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 14:27:07,515 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EncryptForward_spec.i","") [48] [2025-03-03 14:27:07,517 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [105] [2025-03-03 14:27:07,517 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [122] [2025-03-03 14:27:07,517 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [160] [2025-03-03 14:27:07,517 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [405] [2025-03-03 14:27:07,517 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [811] [2025-03-03 14:27:07,518 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [1091] [2025-03-03 14:27:07,518 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [1457] [2025-03-03 14:27:07,518 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [1466] [2025-03-03 14:27:07,518 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [1570] [2025-03-03 14:27:07,518 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [2639] [2025-03-03 14:27:07,557 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec9_product12.cil.c[29763,29776] [2025-03-03 14:27:07,591 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:27:07,615 INFO L204 MainTranslator]: Completed translation [2025-03-03 14:27:07,616 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:27:07 WrapperNode [2025-03-03 14:27:07,616 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 14:27:07,617 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 14:27:07,617 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 14:27:07,618 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 14:27:07,624 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:27:07" (1/1) ... [2025-03-03 14:27:07,641 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:27:07" (1/1) ... [2025-03-03 14:27:07,672 INFO L138 Inliner]: procedures = 123, calls = 177, calls flagged for inlining = 51, calls inlined = 41, statements flattened = 837 [2025-03-03 14:27:07,673 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 14:27:07,673 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 14:27:07,673 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 14:27:07,673 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 14:27:07,685 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:27:07" (1/1) ... [2025-03-03 14:27:07,685 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:27:07" (1/1) ... [2025-03-03 14:27:07,689 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:27:07" (1/1) ... [2025-03-03 14:27:07,710 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-03-03 14:27:07,713 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:27:07" (1/1) ... [2025-03-03 14:27:07,713 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:27:07" (1/1) ... [2025-03-03 14:27:07,722 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:27:07" (1/1) ... [2025-03-03 14:27:07,724 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:27:07" (1/1) ... [2025-03-03 14:27:07,726 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:27:07" (1/1) ... [2025-03-03 14:27:07,731 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:27:07" (1/1) ... [2025-03-03 14:27:07,739 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 14:27:07,739 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 14:27:07,739 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 14:27:07,739 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 14:27:07,740 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:27:07" (1/1) ... [2025-03-03 14:27:07,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:27:07,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:27:07,776 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 14:27:07,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 14:27:07,799 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2025-03-03 14:27:07,799 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2025-03-03 14:27:07,799 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2025-03-03 14:27:07,799 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2025-03-03 14:27:07,799 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-03-03 14:27:07,799 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-03-03 14:27:07,799 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-03-03 14:27:07,799 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-03-03 14:27:07,799 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-03-03 14:27:07,799 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-03-03 14:27:07,799 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2025-03-03 14:27:07,799 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2025-03-03 14:27:07,799 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-03-03 14:27:07,799 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-03-03 14:27:07,799 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-03-03 14:27:07,799 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-03-03 14:27:07,799 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 14:27:07,800 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-03-03 14:27:07,800 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-03-03 14:27:07,800 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-03-03 14:27:07,800 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-03-03 14:27:07,800 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-03-03 14:27:07,800 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-03-03 14:27:07,800 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-03-03 14:27:07,800 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-03-03 14:27:07,800 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2025-03-03 14:27:07,800 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2025-03-03 14:27:07,800 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-03-03 14:27:07,800 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-03-03 14:27:07,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 14:27:07,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 14:27:07,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-03 14:27:07,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-03 14:27:07,800 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-03-03 14:27:07,800 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-03-03 14:27:07,800 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 14:27:07,800 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 14:27:07,944 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 14:27:07,946 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 14:27:08,155 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2497-1: findPublicKey_#res#1 := findPublicKey_~retValue_acc~41#1; [2025-03-03 14:27:08,155 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L392-1: isKeyPairValid_#res#1 := isKeyPairValid_~retValue_acc~7#1; [2025-03-03 14:27:08,155 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2616-1: getClientId_#res#1 := getClientId_~retValue_acc~43#1; [2025-03-03 14:27:08,155 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2181-1: getClientPrivateKey_#res#1 := getClientPrivateKey_~retValue_acc~36#1; [2025-03-03 14:27:08,181 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L529: #res := ~retValue_acc~11; [2025-03-03 14:27:08,219 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2273: #res#1 := ~retValue_acc~38#1; [2025-03-03 14:27:08,222 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2228-1: getClientKeyringSize_#res#1 := getClientKeyringSize_~retValue_acc~37#1; [2025-03-03 14:27:08,290 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1567-1: createEmail_#res#1 := createEmail_~retValue_acc~26#1; [2025-03-03 14:27:08,305 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L644: #res := ~retValue_acc~14; [2025-03-03 14:27:08,546 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L349-1: is_queue_empty_#res#1 := is_queue_empty_~retValue_acc~4#1; [2025-03-03 14:27:08,546 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L358-1: get_queued_client_#res#1 := get_queued_client_~retValue_acc~5#1; [2025-03-03 14:27:08,546 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L367-1: get_queued_email_#res#1 := get_queued_email_~retValue_acc~6#1; [2025-03-03 14:27:08,546 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2443-1: getClientKeyringPublicKey_#res#1 := getClientKeyringPublicKey_~retValue_acc~40#1; [2025-03-03 14:27:08,546 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2336-1: getClientKeyringUser_#res#1 := getClientKeyringUser_~retValue_acc~39#1; [2025-03-03 14:27:08,546 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L157-1: valid_product_#res#1 := valid_product_~retValue_acc~2#1; [2025-03-03 14:27:08,573 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L681: #res := ~retValue_acc~15; [2025-03-03 14:27:08,640 INFO L? ?]: Removed 339 outVars from TransFormulas that were not future-live. [2025-03-03 14:27:08,640 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 14:27:08,651 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 14:27:08,652 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 14:27:08,652 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:27:08 BoogieIcfgContainer [2025-03-03 14:27:08,652 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 14:27:08,654 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 14:27:08,654 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 14:27:08,657 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 14:27:08,657 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 02:27:07" (1/3) ... [2025-03-03 14:27:08,658 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@567953bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:27:08, skipping insertion in model container [2025-03-03 14:27:08,658 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:27:07" (2/3) ... [2025-03-03 14:27:08,659 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@567953bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:27:08, skipping insertion in model container [2025-03-03 14:27:08,659 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:27:08" (3/3) ... [2025-03-03 14:27:08,660 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec9_product12.cil.c [2025-03-03 14:27:08,671 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 14:27:08,674 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec9_product12.cil.c that has 16 procedures, 261 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 14:27:08,728 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 14:27:08,737 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;@14b9b8e3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 14:27:08,737 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 14:27:08,741 INFO L276 IsEmpty]: Start isEmpty. Operand has 261 states, 205 states have (on average 1.551219512195122) internal successors, (318), 209 states have internal predecessors, (318), 39 states have call successors, (39), 15 states have call predecessors, (39), 15 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-03 14:27:08,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-03 14:27:08,750 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:27:08,752 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] [2025-03-03 14:27:08,752 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:27:08,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:27:08,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1172200157, now seen corresponding path program 1 times [2025-03-03 14:27:08,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:27:08,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152490708] [2025-03-03 14:27:08,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:27:08,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:27:08,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-03 14:27:08,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-03 14:27:08,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:27:08,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:27:09,286 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-03 14:27:09,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:27:09,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152490708] [2025-03-03 14:27:09,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152490708] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:27:09,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1851771153] [2025-03-03 14:27:09,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:27:09,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:27:09,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:27:09,293 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:27:09,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 14:27:09,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-03 14:27:09,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-03 14:27:09,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:27:09,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:27:09,537 INFO L256 TraceCheckSpWp]: Trace formula consists of 878 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 14:27:09,541 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:27:09,554 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-03 14:27:09,554 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:27:09,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1851771153] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:27:09,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:27:09,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 5 [2025-03-03 14:27:09,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393869986] [2025-03-03 14:27:09,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:27:09,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 14:27:09,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:27:09,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 14:27:09,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:27:09,578 INFO L87 Difference]: Start difference. First operand has 261 states, 205 states have (on average 1.551219512195122) internal successors, (318), 209 states have internal predecessors, (318), 39 states have call successors, (39), 15 states have call predecessors, (39), 15 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-03 14:27:09,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:27:09,616 INFO L93 Difference]: Finished difference Result 374 states and 556 transitions. [2025-03-03 14:27:09,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 14:27:09,619 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 86 [2025-03-03 14:27:09,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:27:09,627 INFO L225 Difference]: With dead ends: 374 [2025-03-03 14:27:09,628 INFO L226 Difference]: Without dead ends: 254 [2025-03-03 14:27:09,631 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 87 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-03-03 14:27:09,632 INFO L435 NwaCegarLoop]: 393 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:27:09,633 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:27:09,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2025-03-03 14:27:09,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 254. [2025-03-03 14:27:09,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 199 states have (on average 1.5477386934673367) internal successors, (308), 202 states have internal predecessors, (308), 39 states have call successors, (39), 15 states have call predecessors, (39), 15 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-03 14:27:09,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 385 transitions. [2025-03-03 14:27:09,691 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 385 transitions. Word has length 86 [2025-03-03 14:27:09,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:27:09,692 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 385 transitions. [2025-03-03 14:27:09,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-03 14:27:09,693 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 385 transitions. [2025-03-03 14:27:09,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-03 14:27:09,696 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:27:09,697 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] [2025-03-03 14:27:09,706 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 14:27:09,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 14:27:09,898 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:27:09,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:27:09,898 INFO L85 PathProgramCache]: Analyzing trace with hash 146674226, now seen corresponding path program 1 times [2025-03-03 14:27:09,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:27:09,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370880501] [2025-03-03 14:27:09,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:27:09,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:27:09,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-03 14:27:09,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-03 14:27:09,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:27:09,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:27:10,124 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-03 14:27:10,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:27:10,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370880501] [2025-03-03 14:27:10,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370880501] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:27:10,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [932489322] [2025-03-03 14:27:10,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:27:10,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:27:10,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:27:10,128 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:27:10,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 14:27:10,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-03 14:27:10,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-03 14:27:10,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:27:10,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:27:10,373 INFO L256 TraceCheckSpWp]: Trace formula consists of 879 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 14:27:10,378 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:27:10,401 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-03 14:27:10,404 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:27:10,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [932489322] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:27:10,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:27:10,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 14:27:10,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419591000] [2025-03-03 14:27:10,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:27:10,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:27:10,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:27:10,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:27:10,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:27:10,406 INFO L87 Difference]: Start difference. First operand 254 states and 385 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-03 14:27:10,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:27:10,444 INFO L93 Difference]: Finished difference Result 363 states and 537 transitions. [2025-03-03 14:27:10,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:27:10,445 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 87 [2025-03-03 14:27:10,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:27:10,447 INFO L225 Difference]: With dead ends: 363 [2025-03-03 14:27:10,449 INFO L226 Difference]: Without dead ends: 256 [2025-03-03 14:27:10,450 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 87 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-03-03 14:27:10,451 INFO L435 NwaCegarLoop]: 384 mSDtfsCounter, 0 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 766 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:27:10,451 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 766 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:27:10,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2025-03-03 14:27:10,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 256. [2025-03-03 14:27:10,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 201 states have (on average 1.5422885572139304) internal successors, (310), 204 states have internal predecessors, (310), 39 states have call successors, (39), 15 states have call predecessors, (39), 15 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-03 14:27:10,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 387 transitions. [2025-03-03 14:27:10,474 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 387 transitions. Word has length 87 [2025-03-03 14:27:10,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:27:10,475 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 387 transitions. [2025-03-03 14:27:10,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-03 14:27:10,476 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 387 transitions. [2025-03-03 14:27:10,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-03 14:27:10,480 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:27:10,481 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:27:10,489 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 14:27:10,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-03 14:27:10,682 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:27:10,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:27:10,682 INFO L85 PathProgramCache]: Analyzing trace with hash -875651374, now seen corresponding path program 1 times [2025-03-03 14:27:10,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:27:10,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631699238] [2025-03-03 14:27:10,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:27:10,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:27:10,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-03 14:27:10,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-03 14:27:10,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:27:10,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:27:10,861 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-03 14:27:10,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:27:10,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631699238] [2025-03-03 14:27:10,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631699238] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:27:10,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1056919510] [2025-03-03 14:27:10,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:27:10,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:27:10,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:27:10,865 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:27:10,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 14:27:10,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-03 14:27:11,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-03 14:27:11,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:27:11,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:27:11,103 INFO L256 TraceCheckSpWp]: Trace formula consists of 891 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:27:11,106 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:27:11,126 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-03 14:27:11,127 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:27:11,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1056919510] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:27:11,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:27:11,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 14:27:11,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327908884] [2025-03-03 14:27:11,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:27:11,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:27:11,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:27:11,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:27:11,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:27:11,131 INFO L87 Difference]: Start difference. First operand 256 states and 387 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-03 14:27:11,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:27:11,158 INFO L93 Difference]: Finished difference Result 536 states and 824 transitions. [2025-03-03 14:27:11,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:27:11,159 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 92 [2025-03-03 14:27:11,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:27:11,161 INFO L225 Difference]: With dead ends: 536 [2025-03-03 14:27:11,161 INFO L226 Difference]: Without dead ends: 307 [2025-03-03 14:27:11,162 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 92 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-03-03 14:27:11,163 INFO L435 NwaCegarLoop]: 395 mSDtfsCounter, 99 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 733 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-03-03 14:27:11,163 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 733 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:27:11,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2025-03-03 14:27:11,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 299. [2025-03-03 14:27:11,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 233 states have (on average 1.55793991416309) internal successors, (363), 236 states have internal predecessors, (363), 50 states have call successors, (50), 15 states have call predecessors, (50), 15 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2025-03-03 14:27:11,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 462 transitions. [2025-03-03 14:27:11,189 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 462 transitions. Word has length 92 [2025-03-03 14:27:11,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:27:11,190 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 462 transitions. [2025-03-03 14:27:11,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-03 14:27:11,190 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 462 transitions. [2025-03-03 14:27:11,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-03 14:27:11,194 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:27:11,194 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:27:11,203 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 14:27:11,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:27:11,395 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:27:11,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:27:11,395 INFO L85 PathProgramCache]: Analyzing trace with hash -2127661779, now seen corresponding path program 1 times [2025-03-03 14:27:11,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:27:11,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68595311] [2025-03-03 14:27:11,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:27:11,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:27:11,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-03 14:27:11,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-03 14:27:11,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:27:11,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:27:11,540 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-03 14:27:11,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:27:11,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68595311] [2025-03-03 14:27:11,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68595311] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:27:11,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [399153951] [2025-03-03 14:27:11,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:27:11,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:27:11,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:27:11,544 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:27:11,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 14:27:11,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-03 14:27:11,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-03 14:27:11,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:27:11,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:27:11,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 896 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 14:27:11,754 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:27:11,803 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-03 14:27:11,805 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:27:11,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [399153951] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:27:11,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:27:11,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-03-03 14:27:11,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202081240] [2025-03-03 14:27:11,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:27:11,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:27:11,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:27:11,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:27:11,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:27:11,806 INFO L87 Difference]: Start difference. First operand 299 states and 462 transitions. Second operand has 5 states, 4 states have (on average 16.0) internal successors, (64), 5 states have internal predecessors, (64), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-03 14:27:11,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:27:11,864 INFO L93 Difference]: Finished difference Result 589 states and 914 transitions. [2025-03-03 14:27:11,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:27:11,864 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.0) internal successors, (64), 5 states have internal predecessors, (64), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 93 [2025-03-03 14:27:11,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:27:11,866 INFO L225 Difference]: With dead ends: 589 [2025-03-03 14:27:11,866 INFO L226 Difference]: Without dead ends: 301 [2025-03-03 14:27:11,868 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 91 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-03-03 14:27:11,869 INFO L435 NwaCegarLoop]: 377 mSDtfsCounter, 2 mSDsluCounter, 1120 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1497 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-03-03 14:27:11,870 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1497 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:27:11,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2025-03-03 14:27:11,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 301. [2025-03-03 14:27:11,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 234 states have (on average 1.5555555555555556) internal successors, (364), 238 states have internal predecessors, (364), 50 states have call successors, (50), 15 states have call predecessors, (50), 16 states have return successors, (51), 49 states have call predecessors, (51), 49 states have call successors, (51) [2025-03-03 14:27:11,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 465 transitions. [2025-03-03 14:27:11,889 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 465 transitions. Word has length 93 [2025-03-03 14:27:11,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:27:11,889 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 465 transitions. [2025-03-03 14:27:11,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.0) internal successors, (64), 5 states have internal predecessors, (64), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-03 14:27:11,889 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 465 transitions. [2025-03-03 14:27:11,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-03 14:27:11,892 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:27:11,892 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:27:11,901 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 14:27:12,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:27:12,093 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:27:12,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:27:12,094 INFO L85 PathProgramCache]: Analyzing trace with hash -607799003, now seen corresponding path program 1 times [2025-03-03 14:27:12,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:27:12,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295343046] [2025-03-03 14:27:12,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:27:12,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:27:12,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-03 14:27:12,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-03 14:27:12,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:27:12,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:27:12,254 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-03 14:27:12,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:27:12,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295343046] [2025-03-03 14:27:12,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295343046] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:27:12,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1469610878] [2025-03-03 14:27:12,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:27:12,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:27:12,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:27:12,257 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:27:12,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 14:27:12,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-03 14:27:12,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-03 14:27:12,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:27:12,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:27:12,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 897 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 14:27:12,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:27:12,488 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-03 14:27:12,490 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:27:12,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1469610878] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:27:12,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:27:12,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-03-03 14:27:12,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747713968] [2025-03-03 14:27:12,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:27:12,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:27:12,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:27:12,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:27:12,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:27:12,493 INFO L87 Difference]: Start difference. First operand 301 states and 465 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-03 14:27:12,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:27:12,564 INFO L93 Difference]: Finished difference Result 591 states and 919 transitions. [2025-03-03 14:27:12,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:27:12,565 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 94 [2025-03-03 14:27:12,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:27:12,567 INFO L225 Difference]: With dead ends: 591 [2025-03-03 14:27:12,568 INFO L226 Difference]: Without dead ends: 303 [2025-03-03 14:27:12,569 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 92 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-03-03 14:27:12,570 INFO L435 NwaCegarLoop]: 375 mSDtfsCounter, 2 mSDsluCounter, 1108 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1483 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-03-03 14:27:12,571 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1483 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:27:12,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2025-03-03 14:27:12,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 303. [2025-03-03 14:27:12,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 235 states have (on average 1.553191489361702) internal successors, (365), 240 states have internal predecessors, (365), 50 states have call successors, (50), 15 states have call predecessors, (50), 17 states have return successors, (56), 49 states have call predecessors, (56), 49 states have call successors, (56) [2025-03-03 14:27:12,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 471 transitions. [2025-03-03 14:27:12,589 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 471 transitions. Word has length 94 [2025-03-03 14:27:12,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:27:12,590 INFO L471 AbstractCegarLoop]: Abstraction has 303 states and 471 transitions. [2025-03-03 14:27:12,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-03 14:27:12,591 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 471 transitions. [2025-03-03 14:27:12,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-03 14:27:12,592 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:27:12,593 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] [2025-03-03 14:27:12,604 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-03 14:27:12,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:27:12,796 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:27:12,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:27:12,796 INFO L85 PathProgramCache]: Analyzing trace with hash 44835420, now seen corresponding path program 1 times [2025-03-03 14:27:12,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:27:12,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903153504] [2025-03-03 14:27:12,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:27:12,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:27:12,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-03 14:27:12,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-03 14:27:12,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:27:12,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:27:12,925 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-03 14:27:12,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:27:12,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903153504] [2025-03-03 14:27:12,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903153504] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:27:12,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:27:12,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:27:12,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708908262] [2025-03-03 14:27:12,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:27:12,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:27:12,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:27:12,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:27:12,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:27:12,927 INFO L87 Difference]: Start difference. First operand 303 states and 471 transitions. Second operand has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-03 14:27:12,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:27:12,968 INFO L93 Difference]: Finished difference Result 583 states and 910 transitions. [2025-03-03 14:27:12,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:27:12,968 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 95 [2025-03-03 14:27:12,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:27:12,970 INFO L225 Difference]: With dead ends: 583 [2025-03-03 14:27:12,970 INFO L226 Difference]: Without dead ends: 303 [2025-03-03 14:27:12,973 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-03-03 14:27:12,974 INFO L435 NwaCegarLoop]: 378 mSDtfsCounter, 2 mSDsluCounter, 1123 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1501 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-03-03 14:27:12,974 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1501 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:27:12,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2025-03-03 14:27:12,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 303. [2025-03-03 14:27:12,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 235 states have (on average 1.553191489361702) internal successors, (365), 240 states have internal predecessors, (365), 50 states have call successors, (50), 15 states have call predecessors, (50), 17 states have return successors, (55), 49 states have call predecessors, (55), 49 states have call successors, (55) [2025-03-03 14:27:12,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 470 transitions. [2025-03-03 14:27:12,988 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 470 transitions. Word has length 95 [2025-03-03 14:27:12,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:27:12,988 INFO L471 AbstractCegarLoop]: Abstraction has 303 states and 470 transitions. [2025-03-03 14:27:12,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-03 14:27:12,988 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 470 transitions. [2025-03-03 14:27:12,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-03 14:27:12,990 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:27:12,990 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] [2025-03-03 14:27:12,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 14:27:12,990 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:27:12,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:27:12,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1573493046, now seen corresponding path program 2 times [2025-03-03 14:27:12,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:27:12,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071968734] [2025-03-03 14:27:12,991 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 14:27:12,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:27:13,006 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 96 statements into 2 equivalence classes. [2025-03-03 14:27:13,017 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 96 of 96 statements. [2025-03-03 14:27:13,018 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 14:27:13,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:27:13,100 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-03 14:27:13,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:27:13,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071968734] [2025-03-03 14:27:13,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071968734] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:27:13,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:27:13,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:27:13,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153209744] [2025-03-03 14:27:13,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:27:13,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:27:13,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:27:13,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:27:13,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:27:13,102 INFO L87 Difference]: Start difference. First operand 303 states and 470 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-03 14:27:13,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:27:13,142 INFO L93 Difference]: Finished difference Result 581 states and 905 transitions. [2025-03-03 14:27:13,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:27:13,143 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 96 [2025-03-03 14:27:13,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:27:13,145 INFO L225 Difference]: With dead ends: 581 [2025-03-03 14:27:13,145 INFO L226 Difference]: Without dead ends: 303 [2025-03-03 14:27:13,146 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-03-03 14:27:13,147 INFO L435 NwaCegarLoop]: 376 mSDtfsCounter, 2 mSDsluCounter, 1111 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1487 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-03-03 14:27:13,147 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1487 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:27:13,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2025-03-03 14:27:13,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 303. [2025-03-03 14:27:13,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 235 states have (on average 1.553191489361702) internal successors, (365), 240 states have internal predecessors, (365), 50 states have call successors, (50), 15 states have call predecessors, (50), 17 states have return successors, (54), 49 states have call predecessors, (54), 49 states have call successors, (54) [2025-03-03 14:27:13,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 469 transitions. [2025-03-03 14:27:13,158 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 469 transitions. Word has length 96 [2025-03-03 14:27:13,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:27:13,158 INFO L471 AbstractCegarLoop]: Abstraction has 303 states and 469 transitions. [2025-03-03 14:27:13,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-03 14:27:13,159 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 469 transitions. [2025-03-03 14:27:13,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-03 14:27:13,160 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:27:13,161 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:27:13,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 14:27:13,161 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:27:13,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:27:13,161 INFO L85 PathProgramCache]: Analyzing trace with hash 2059945359, now seen corresponding path program 3 times [2025-03-03 14:27:13,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:27:13,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492247569] [2025-03-03 14:27:13,162 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 14:27:13,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:27:13,179 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 97 statements into 3 equivalence classes. [2025-03-03 14:27:13,188 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 85 of 97 statements. [2025-03-03 14:27:13,189 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-03 14:27:13,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:27:13,308 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-03 14:27:13,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:27:13,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492247569] [2025-03-03 14:27:13,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492247569] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:27:13,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:27:13,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:27:13,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821152208] [2025-03-03 14:27:13,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:27:13,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:27:13,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:27:13,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:27:13,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:27:13,311 INFO L87 Difference]: Start difference. First operand 303 states and 469 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-03 14:27:13,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:27:13,330 INFO L93 Difference]: Finished difference Result 454 states and 684 transitions. [2025-03-03 14:27:13,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:27:13,331 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 97 [2025-03-03 14:27:13,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:27:13,334 INFO L225 Difference]: With dead ends: 454 [2025-03-03 14:27:13,334 INFO L226 Difference]: Without dead ends: 352 [2025-03-03 14:27:13,334 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-03-03 14:27:13,335 INFO L435 NwaCegarLoop]: 384 mSDtfsCounter, 279 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 517 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-03-03 14:27:13,335 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 517 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:27:13,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2025-03-03 14:27:13,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 352. [2025-03-03 14:27:13,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 275 states have (on average 1.5527272727272727) internal successors, (427), 280 states have internal predecessors, (427), 54 states have call successors, (54), 21 states have call predecessors, (54), 22 states have return successors, (58), 53 states have call predecessors, (58), 53 states have call successors, (58) [2025-03-03 14:27:13,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 539 transitions. [2025-03-03 14:27:13,355 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 539 transitions. Word has length 97 [2025-03-03 14:27:13,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:27:13,355 INFO L471 AbstractCegarLoop]: Abstraction has 352 states and 539 transitions. [2025-03-03 14:27:13,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-03 14:27:13,356 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 539 transitions. [2025-03-03 14:27:13,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-03 14:27:13,359 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:27:13,359 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:27:13,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 14:27:13,359 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:27:13,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:27:13,360 INFO L85 PathProgramCache]: Analyzing trace with hash 780258127, now seen corresponding path program 1 times [2025-03-03 14:27:13,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:27:13,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597455264] [2025-03-03 14:27:13,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:27:13,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:27:13,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-03 14:27:13,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-03 14:27:13,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:27:13,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:27:13,554 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2025-03-03 14:27:13,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:27:13,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597455264] [2025-03-03 14:27:13,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597455264] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:27:13,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:27:13,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:27:13,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940198354] [2025-03-03 14:27:13,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:27:13,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:27:13,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:27:13,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:27:13,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:27:13,556 INFO L87 Difference]: Start difference. First operand 352 states and 539 transitions. Second operand has 5 states, 4 states have (on average 23.5) internal successors, (94), 5 states have internal predecessors, (94), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-03 14:27:13,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:27:13,597 INFO L93 Difference]: Finished difference Result 683 states and 1051 transitions. [2025-03-03 14:27:13,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:27:13,598 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 23.5) internal successors, (94), 5 states have internal predecessors, (94), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) Word has length 151 [2025-03-03 14:27:13,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:27:13,601 INFO L225 Difference]: With dead ends: 683 [2025-03-03 14:27:13,601 INFO L226 Difference]: Without dead ends: 354 [2025-03-03 14:27:13,602 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-03-03 14:27:13,603 INFO L435 NwaCegarLoop]: 378 mSDtfsCounter, 1 mSDsluCounter, 1122 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1500 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-03-03 14:27:13,603 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1500 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:27:13,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2025-03-03 14:27:13,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 354. [2025-03-03 14:27:13,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 276 states have (on average 1.5507246376811594) internal successors, (428), 282 states have internal predecessors, (428), 54 states have call successors, (54), 21 states have call predecessors, (54), 23 states have return successors, (60), 53 states have call predecessors, (60), 53 states have call successors, (60) [2025-03-03 14:27:13,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 542 transitions. [2025-03-03 14:27:13,622 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 542 transitions. Word has length 151 [2025-03-03 14:27:13,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:27:13,622 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 542 transitions. [2025-03-03 14:27:13,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 23.5) internal successors, (94), 5 states have internal predecessors, (94), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-03 14:27:13,623 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 542 transitions. [2025-03-03 14:27:13,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-03 14:27:13,625 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:27:13,625 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:27:13,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 14:27:13,626 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:27:13,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:27:13,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1483818106, now seen corresponding path program 1 times [2025-03-03 14:27:13,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:27:13,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952163962] [2025-03-03 14:27:13,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:27:13,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:27:13,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-03 14:27:13,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-03 14:27:13,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:27:13,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:27:13,836 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-03-03 14:27:13,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:27:13,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952163962] [2025-03-03 14:27:13,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952163962] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:27:13,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:27:13,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 14:27:13,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623102673] [2025-03-03 14:27:13,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:27:13,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 14:27:13,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:27:13,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 14:27:13,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:27:13,839 INFO L87 Difference]: Start difference. First operand 354 states and 542 transitions. Second operand has 8 states, 7 states have (on average 14.142857142857142) internal successors, (99), 8 states have internal predecessors, (99), 4 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) [2025-03-03 14:27:13,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:27:13,961 INFO L93 Difference]: Finished difference Result 688 states and 1060 transitions. [2025-03-03 14:27:13,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 14:27:13,962 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 14.142857142857142) internal successors, (99), 8 states have internal predecessors, (99), 4 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) Word has length 152 [2025-03-03 14:27:13,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:27:13,965 INFO L225 Difference]: With dead ends: 688 [2025-03-03 14:27:13,965 INFO L226 Difference]: Without dead ends: 359 [2025-03-03 14:27:13,966 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:27:13,967 INFO L435 NwaCegarLoop]: 370 mSDtfsCounter, 5 mSDsluCounter, 2191 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 2561 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:27:13,967 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 2561 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:27:13,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2025-03-03 14:27:13,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 359. [2025-03-03 14:27:13,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 280 states have (on average 1.5464285714285715) internal successors, (433), 286 states have internal predecessors, (433), 54 states have call successors, (54), 22 states have call predecessors, (54), 24 states have return successors, (65), 53 states have call predecessors, (65), 53 states have call successors, (65) [2025-03-03 14:27:13,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 552 transitions. [2025-03-03 14:27:13,986 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 552 transitions. Word has length 152 [2025-03-03 14:27:13,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:27:13,986 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 552 transitions. [2025-03-03 14:27:13,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 14.142857142857142) internal successors, (99), 8 states have internal predecessors, (99), 4 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) [2025-03-03 14:27:13,986 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 552 transitions. [2025-03-03 14:27:13,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-03 14:27:13,989 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:27:13,990 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:27:13,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 14:27:13,990 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:27:13,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:27:13,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1074031422, now seen corresponding path program 1 times [2025-03-03 14:27:13,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:27:13,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381487337] [2025-03-03 14:27:13,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:27:13,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:27:14,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-03 14:27:14,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-03 14:27:14,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:27:14,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:27:14,137 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-03-03 14:27:14,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:27:14,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381487337] [2025-03-03 14:27:14,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381487337] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:27:14,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1361001998] [2025-03-03 14:27:14,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:27:14,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:27:14,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:27:14,140 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:27:14,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 14:27:14,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-03 14:27:14,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-03 14:27:14,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:27:14,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:27:14,379 INFO L256 TraceCheckSpWp]: Trace formula consists of 1173 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:27:14,383 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:27:14,403 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2025-03-03 14:27:14,403 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:27:14,510 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-03-03 14:27:14,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1361001998] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:27:14,511 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:27:14,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-03 14:27:14,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275229509] [2025-03-03 14:27:14,511 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:27:14,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:27:14,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:27:14,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:27:14,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:27:14,513 INFO L87 Difference]: Start difference. First operand 359 states and 552 transitions. Second operand has 7 states, 7 states have (on average 19.571428571428573) internal successors, (137), 7 states have internal predecessors, (137), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-03 14:27:14,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:27:14,620 INFO L93 Difference]: Finished difference Result 837 states and 1335 transitions. [2025-03-03 14:27:14,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:27:14,621 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.571428571428573) internal successors, (137), 7 states have internal predecessors, (137), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 153 [2025-03-03 14:27:14,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:27:14,625 INFO L225 Difference]: With dead ends: 837 [2025-03-03 14:27:14,625 INFO L226 Difference]: Without dead ends: 681 [2025-03-03 14:27:14,626 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 303 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-03-03 14:27:14,626 INFO L435 NwaCegarLoop]: 412 mSDtfsCounter, 375 mSDsluCounter, 978 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 420 SdHoareTripleChecker+Valid, 1390 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:27:14,626 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [420 Valid, 1390 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:27:14,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2025-03-03 14:27:14,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 657. [2025-03-03 14:27:14,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 657 states, 514 states have (on average 1.6070038910505837) internal successors, (826), 520 states have internal predecessors, (826), 118 states have call successors, (118), 22 states have call predecessors, (118), 24 states have return successors, (139), 117 states have call predecessors, (139), 117 states have call successors, (139) [2025-03-03 14:27:14,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 1083 transitions. [2025-03-03 14:27:14,653 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 1083 transitions. Word has length 153 [2025-03-03 14:27:14,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:27:14,654 INFO L471 AbstractCegarLoop]: Abstraction has 657 states and 1083 transitions. [2025-03-03 14:27:14,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.571428571428573) internal successors, (137), 7 states have internal predecessors, (137), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-03 14:27:14,654 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 1083 transitions. [2025-03-03 14:27:14,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-03-03 14:27:14,657 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:27:14,658 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:27:14,666 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-03 14:27:14,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:27:14,858 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:27:14,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:27:14,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1146041790, now seen corresponding path program 1 times [2025-03-03 14:27:14,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:27:14,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744985506] [2025-03-03 14:27:14,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:27:14,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:27:14,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-03 14:27:14,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-03 14:27:14,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:27:14,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:27:14,925 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-03-03 14:27:14,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:27:14,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744985506] [2025-03-03 14:27:14,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744985506] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:27:14,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:27:14,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:27:14,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501397576] [2025-03-03 14:27:14,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:27:14,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:27:14,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:27:14,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:27:14,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:27:14,927 INFO L87 Difference]: Start difference. First operand 657 states and 1083 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 14:27:14,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:27:14,982 INFO L93 Difference]: Finished difference Result 1548 states and 2591 transitions. [2025-03-03 14:27:14,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:27:14,982 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 159 [2025-03-03 14:27:14,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:27:14,988 INFO L225 Difference]: With dead ends: 1548 [2025-03-03 14:27:14,988 INFO L226 Difference]: Without dead ends: 960 [2025-03-03 14:27:14,990 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-03-03 14:27:14,990 INFO L435 NwaCegarLoop]: 398 mSDtfsCounter, 97 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 779 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-03-03 14:27:14,990 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 779 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:27:14,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 960 states. [2025-03-03 14:27:15,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 960 to 952. [2025-03-03 14:27:15,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 952 states, 745 states have (on average 1.6187919463087248) internal successors, (1206), 751 states have internal predecessors, (1206), 182 states have call successors, (182), 22 states have call predecessors, (182), 24 states have return successors, (213), 181 states have call predecessors, (213), 181 states have call successors, (213) [2025-03-03 14:27:15,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 952 states and 1601 transitions. [2025-03-03 14:27:15,032 INFO L78 Accepts]: Start accepts. Automaton has 952 states and 1601 transitions. Word has length 159 [2025-03-03 14:27:15,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:27:15,033 INFO L471 AbstractCegarLoop]: Abstraction has 952 states and 1601 transitions. [2025-03-03 14:27:15,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 14:27:15,033 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 1601 transitions. [2025-03-03 14:27:15,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-03 14:27:15,038 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:27:15,038 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:27:15,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 14:27:15,039 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:27:15,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:27:15,039 INFO L85 PathProgramCache]: Analyzing trace with hash -247476034, now seen corresponding path program 1 times [2025-03-03 14:27:15,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:27:15,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195809365] [2025-03-03 14:27:15,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:27:15,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:27:15,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-03 14:27:15,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-03 14:27:15,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:27:15,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:27:15,121 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-03-03 14:27:15,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:27:15,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195809365] [2025-03-03 14:27:15,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195809365] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:27:15,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:27:15,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:27:15,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869102753] [2025-03-03 14:27:15,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:27:15,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:27:15,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:27:15,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:27:15,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:27:15,123 INFO L87 Difference]: Start difference. First operand 952 states and 1601 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 14:27:15,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:27:15,175 INFO L93 Difference]: Finished difference Result 2252 states and 3809 transitions. [2025-03-03 14:27:15,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:27:15,175 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 160 [2025-03-03 14:27:15,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:27:15,183 INFO L225 Difference]: With dead ends: 2252 [2025-03-03 14:27:15,184 INFO L226 Difference]: Without dead ends: 1420 [2025-03-03 14:27:15,187 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-03-03 14:27:15,187 INFO L435 NwaCegarLoop]: 385 mSDtfsCounter, 95 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 762 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-03-03 14:27:15,188 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 762 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:27:15,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1420 states. [2025-03-03 14:27:15,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1420 to 1412. [2025-03-03 14:27:15,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1412 states, 1110 states have (on average 1.6261261261261262) internal successors, (1805), 1116 states have internal predecessors, (1805), 277 states have call successors, (277), 22 states have call predecessors, (277), 24 states have return successors, (308), 276 states have call predecessors, (308), 276 states have call successors, (308) [2025-03-03 14:27:15,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1412 states to 1412 states and 2390 transitions. [2025-03-03 14:27:15,269 INFO L78 Accepts]: Start accepts. Automaton has 1412 states and 2390 transitions. Word has length 160 [2025-03-03 14:27:15,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:27:15,270 INFO L471 AbstractCegarLoop]: Abstraction has 1412 states and 2390 transitions. [2025-03-03 14:27:15,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 14:27:15,271 INFO L276 IsEmpty]: Start isEmpty. Operand 1412 states and 2390 transitions. [2025-03-03 14:27:15,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-03 14:27:15,278 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:27:15,278 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:27:15,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 14:27:15,279 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:27:15,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:27:15,279 INFO L85 PathProgramCache]: Analyzing trace with hash -6814271, now seen corresponding path program 1 times [2025-03-03 14:27:15,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:27:15,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733949949] [2025-03-03 14:27:15,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:27:15,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:27:15,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-03 14:27:15,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-03 14:27:15,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:27:15,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:27:15,360 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-03-03 14:27:15,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:27:15,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733949949] [2025-03-03 14:27:15,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733949949] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:27:15,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:27:15,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:27:15,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913608129] [2025-03-03 14:27:15,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:27:15,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:27:15,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:27:15,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:27:15,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:27:15,362 INFO L87 Difference]: Start difference. First operand 1412 states and 2390 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 14:27:15,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:27:15,441 INFO L93 Difference]: Finished difference Result 3281 states and 5598 transitions. [2025-03-03 14:27:15,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:27:15,442 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 161 [2025-03-03 14:27:15,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:27:15,454 INFO L225 Difference]: With dead ends: 3281 [2025-03-03 14:27:15,455 INFO L226 Difference]: Without dead ends: 2111 [2025-03-03 14:27:15,460 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-03-03 14:27:15,461 INFO L435 NwaCegarLoop]: 383 mSDtfsCounter, 93 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 757 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-03-03 14:27:15,461 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 757 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:27:15,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2111 states. [2025-03-03 14:27:15,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2111 to 2103. [2025-03-03 14:27:15,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2103 states, 1678 states have (on average 1.632300357568534) internal successors, (2739), 1684 states have internal predecessors, (2739), 400 states have call successors, (400), 22 states have call predecessors, (400), 24 states have return successors, (447), 399 states have call predecessors, (447), 399 states have call successors, (447) [2025-03-03 14:27:15,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2103 states to 2103 states and 3586 transitions. [2025-03-03 14:27:15,574 INFO L78 Accepts]: Start accepts. Automaton has 2103 states and 3586 transitions. Word has length 161 [2025-03-03 14:27:15,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:27:15,574 INFO L471 AbstractCegarLoop]: Abstraction has 2103 states and 3586 transitions. [2025-03-03 14:27:15,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 14:27:15,574 INFO L276 IsEmpty]: Start isEmpty. Operand 2103 states and 3586 transitions. [2025-03-03 14:27:15,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-03 14:27:15,586 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:27:15,587 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:27:15,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 14:27:15,587 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:27:15,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:27:15,587 INFO L85 PathProgramCache]: Analyzing trace with hash -2106180897, now seen corresponding path program 1 times [2025-03-03 14:27:15,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:27:15,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847994094] [2025-03-03 14:27:15,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:27:15,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:27:15,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-03 14:27:15,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-03 14:27:15,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:27:15,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:27:15,659 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-03-03 14:27:15,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:27:15,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847994094] [2025-03-03 14:27:15,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847994094] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:27:15,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:27:15,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:27:15,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830369484] [2025-03-03 14:27:15,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:27:15,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:27:15,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:27:15,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:27:15,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:27:15,661 INFO L87 Difference]: Start difference. First operand 2103 states and 3586 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 14:27:15,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:27:15,780 INFO L93 Difference]: Finished difference Result 4869 states and 8364 transitions. [2025-03-03 14:27:15,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:27:15,781 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 162 [2025-03-03 14:27:15,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:27:15,799 INFO L225 Difference]: With dead ends: 4869 [2025-03-03 14:27:15,799 INFO L226 Difference]: Without dead ends: 3208 [2025-03-03 14:27:15,806 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-03-03 14:27:15,806 INFO L435 NwaCegarLoop]: 383 mSDtfsCounter, 91 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 757 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-03-03 14:27:15,806 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 757 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:27:15,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3208 states. [2025-03-03 14:27:15,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3208 to 3200. [2025-03-03 14:27:15,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3200 states, 2596 states have (on average 1.6363636363636365) internal successors, (4248), 2602 states have internal predecessors, (4248), 579 states have call successors, (579), 22 states have call predecessors, (579), 24 states have return successors, (652), 578 states have call predecessors, (652), 578 states have call successors, (652) [2025-03-03 14:27:15,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3200 states to 3200 states and 5479 transitions. [2025-03-03 14:27:15,982 INFO L78 Accepts]: Start accepts. Automaton has 3200 states and 5479 transitions. Word has length 162 [2025-03-03 14:27:15,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:27:15,982 INFO L471 AbstractCegarLoop]: Abstraction has 3200 states and 5479 transitions. [2025-03-03 14:27:15,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 14:27:15,983 INFO L276 IsEmpty]: Start isEmpty. Operand 3200 states and 5479 transitions. [2025-03-03 14:27:16,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-03 14:27:16,002 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:27:16,002 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:27:16,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 14:27:16,003 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:27:16,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:27:16,003 INFO L85 PathProgramCache]: Analyzing trace with hash -1951339936, now seen corresponding path program 1 times [2025-03-03 14:27:16,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:27:16,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980227288] [2025-03-03 14:27:16,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:27:16,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:27:16,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-03 14:27:16,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-03 14:27:16,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:27:16,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:27:16,105 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-03-03 14:27:16,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:27:16,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980227288] [2025-03-03 14:27:16,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980227288] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:27:16,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:27:16,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:27:16,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319346887] [2025-03-03 14:27:16,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:27:16,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:27:16,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:27:16,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:27:16,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:27:16,107 INFO L87 Difference]: Start difference. First operand 3200 states and 5479 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 14:27:16,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:27:16,253 INFO L93 Difference]: Finished difference Result 7731 states and 13307 transitions. [2025-03-03 14:27:16,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:27:16,254 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 163 [2025-03-03 14:27:16,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:27:16,282 INFO L225 Difference]: With dead ends: 7731 [2025-03-03 14:27:16,282 INFO L226 Difference]: Without dead ends: 5200 [2025-03-03 14:27:16,293 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-03-03 14:27:16,294 INFO L435 NwaCegarLoop]: 396 mSDtfsCounter, 89 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 777 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-03-03 14:27:16,294 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 777 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:27:16,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5200 states. [2025-03-03 14:27:16,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5200 to 5192. [2025-03-03 14:27:16,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5192 states, 4212 states have (on average 1.628917378917379) internal successors, (6861), 4218 states have internal predecessors, (6861), 955 states have call successors, (955), 22 states have call predecessors, (955), 24 states have return successors, (1072), 954 states have call predecessors, (1072), 954 states have call successors, (1072) [2025-03-03 14:27:16,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5192 states to 5192 states and 8888 transitions. [2025-03-03 14:27:16,601 INFO L78 Accepts]: Start accepts. Automaton has 5192 states and 8888 transitions. Word has length 163 [2025-03-03 14:27:16,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:27:16,602 INFO L471 AbstractCegarLoop]: Abstraction has 5192 states and 8888 transitions. [2025-03-03 14:27:16,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 14:27:16,602 INFO L276 IsEmpty]: Start isEmpty. Operand 5192 states and 8888 transitions. [2025-03-03 14:27:16,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-03 14:27:16,628 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:27:16,629 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:27:16,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 14:27:16,629 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:27:16,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:27:16,629 INFO L85 PathProgramCache]: Analyzing trace with hash 130858048, now seen corresponding path program 1 times [2025-03-03 14:27:16,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:27:16,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067951988] [2025-03-03 14:27:16,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:27:16,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:27:16,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-03 14:27:16,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-03 14:27:16,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:27:16,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:27:16,687 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-03-03 14:27:16,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:27:16,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067951988] [2025-03-03 14:27:16,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067951988] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:27:16,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:27:16,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:27:16,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313358830] [2025-03-03 14:27:16,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:27:16,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:27:16,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:27:16,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:27:16,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:27:16,689 INFO L87 Difference]: Start difference. First operand 5192 states and 8888 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 14:27:16,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:27:16,993 INFO L93 Difference]: Finished difference Result 12768 states and 22000 transitions. [2025-03-03 14:27:16,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:27:16,993 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 164 [2025-03-03 14:27:16,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:27:17,045 INFO L225 Difference]: With dead ends: 12768 [2025-03-03 14:27:17,046 INFO L226 Difference]: Without dead ends: 8616 [2025-03-03 14:27:17,065 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-03-03 14:27:17,066 INFO L435 NwaCegarLoop]: 383 mSDtfsCounter, 87 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 760 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-03-03 14:27:17,066 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 760 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:27:17,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8616 states. [2025-03-03 14:27:17,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8616 to 8608. [2025-03-03 14:27:17,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8608 states, 7022 states have (on average 1.626744517231558) internal successors, (11423), 7028 states have internal predecessors, (11423), 1561 states have call successors, (1561), 22 states have call predecessors, (1561), 24 states have return successors, (1756), 1560 states have call predecessors, (1756), 1560 states have call successors, (1756) [2025-03-03 14:27:17,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8608 states to 8608 states and 14740 transitions. [2025-03-03 14:27:17,492 INFO L78 Accepts]: Start accepts. Automaton has 8608 states and 14740 transitions. Word has length 164 [2025-03-03 14:27:17,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:27:17,492 INFO L471 AbstractCegarLoop]: Abstraction has 8608 states and 14740 transitions. [2025-03-03 14:27:17,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 14:27:17,493 INFO L276 IsEmpty]: Start isEmpty. Operand 8608 states and 14740 transitions. [2025-03-03 14:27:17,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-03 14:27:17,535 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:27:17,536 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:27:17,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 14:27:17,536 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:27:17,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:27:17,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1600682337, now seen corresponding path program 1 times [2025-03-03 14:27:17,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:27:17,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241854997] [2025-03-03 14:27:17,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:27:17,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:27:17,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-03 14:27:17,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-03 14:27:17,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:27:17,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:27:17,600 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-03-03 14:27:17,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:27:17,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241854997] [2025-03-03 14:27:17,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241854997] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:27:17,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:27:17,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:27:17,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28973325] [2025-03-03 14:27:17,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:27:17,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:27:17,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:27:17,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:27:17,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:27:17,602 INFO L87 Difference]: Start difference. First operand 8608 states and 14740 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 14:27:17,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:27:17,952 INFO L93 Difference]: Finished difference Result 22225 states and 38223 transitions. [2025-03-03 14:27:17,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:27:17,953 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 165 [2025-03-03 14:27:17,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:27:18,016 INFO L225 Difference]: With dead ends: 22225 [2025-03-03 14:27:18,016 INFO L226 Difference]: Without dead ends: 15072 [2025-03-03 14:27:18,048 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-03-03 14:27:18,049 INFO L435 NwaCegarLoop]: 387 mSDtfsCounter, 85 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 766 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-03-03 14:27:18,049 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 766 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:27:18,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15072 states. [2025-03-03 14:27:18,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15072 to 15064. [2025-03-03 14:27:18,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15064 states, 12275 states have (on average 1.6172708757637475) internal successors, (19852), 12281 states have internal predecessors, (19852), 2764 states have call successors, (2764), 22 states have call predecessors, (2764), 24 states have return successors, (3103), 2763 states have call predecessors, (3103), 2763 states have call successors, (3103) [2025-03-03 14:27:18,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15064 states to 15064 states and 25719 transitions. [2025-03-03 14:27:18,802 INFO L78 Accepts]: Start accepts. Automaton has 15064 states and 25719 transitions. Word has length 165 [2025-03-03 14:27:18,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:27:18,803 INFO L471 AbstractCegarLoop]: Abstraction has 15064 states and 25719 transitions. [2025-03-03 14:27:18,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 14:27:18,804 INFO L276 IsEmpty]: Start isEmpty. Operand 15064 states and 25719 transitions. [2025-03-03 14:27:18,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-03 14:27:18,867 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:27:18,867 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:27:18,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 14:27:18,868 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:27:18,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:27:18,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1958093215, now seen corresponding path program 1 times [2025-03-03 14:27:18,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:27:18,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945241904] [2025-03-03 14:27:18,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:27:18,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:27:18,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-03 14:27:18,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-03 14:27:18,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:27:18,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:27:18,947 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-03-03 14:27:18,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:27:18,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945241904] [2025-03-03 14:27:18,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945241904] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:27:18,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:27:18,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:27:18,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338013396] [2025-03-03 14:27:18,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:27:18,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:27:18,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:27:18,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:27:18,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:27:18,949 INFO L87 Difference]: Start difference. First operand 15064 states and 25719 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 14:27:19,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:27:19,712 INFO L93 Difference]: Finished difference Result 39786 states and 68271 transitions. [2025-03-03 14:27:19,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:27:19,712 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 166 [2025-03-03 14:27:19,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:27:19,834 INFO L225 Difference]: With dead ends: 39786 [2025-03-03 14:27:19,834 INFO L226 Difference]: Without dead ends: 26776 [2025-03-03 14:27:19,890 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-03-03 14:27:19,890 INFO L435 NwaCegarLoop]: 383 mSDtfsCounter, 83 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 760 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-03-03 14:27:19,891 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 760 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:27:19,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26776 states. [2025-03-03 14:27:20,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26776 to 26768. [2025-03-03 14:27:20,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26768 states, 21940 states have (on average 1.6132178669097539) internal successors, (35394), 21946 states have internal predecessors, (35394), 4803 states have call successors, (4803), 22 states have call predecessors, (4803), 24 states have return successors, (5416), 4802 states have call predecessors, (5416), 4802 states have call successors, (5416) [2025-03-03 14:27:20,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26768 states to 26768 states and 45613 transitions. [2025-03-03 14:27:20,972 INFO L78 Accepts]: Start accepts. Automaton has 26768 states and 45613 transitions. Word has length 166 [2025-03-03 14:27:20,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:27:20,973 INFO L471 AbstractCegarLoop]: Abstraction has 26768 states and 45613 transitions. [2025-03-03 14:27:20,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 14:27:20,973 INFO L276 IsEmpty]: Start isEmpty. Operand 26768 states and 45613 transitions. [2025-03-03 14:27:21,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-03 14:27:21,065 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:27:21,066 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:27:21,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 14:27:21,066 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:27:21,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:27:21,067 INFO L85 PathProgramCache]: Analyzing trace with hash 850586110, now seen corresponding path program 1 times [2025-03-03 14:27:21,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:27:21,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280513048] [2025-03-03 14:27:21,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:27:21,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:27:21,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-03 14:27:21,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-03 14:27:21,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:27:21,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:27:21,131 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-03-03 14:27:21,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:27:21,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280513048] [2025-03-03 14:27:21,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280513048] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:27:21,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:27:21,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:27:21,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677038180] [2025-03-03 14:27:21,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:27:21,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:27:21,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:27:21,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:27:21,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:27:21,134 INFO L87 Difference]: Start difference. First operand 26768 states and 45613 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 14:27:22,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:27:22,540 INFO L93 Difference]: Finished difference Result 72793 states and 124558 transitions. [2025-03-03 14:27:22,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:27:22,540 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 167 [2025-03-03 14:27:22,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:27:22,831 INFO L225 Difference]: With dead ends: 72793 [2025-03-03 14:27:22,831 INFO L226 Difference]: Without dead ends: 48802 [2025-03-03 14:27:22,944 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-03-03 14:27:22,945 INFO L435 NwaCegarLoop]: 385 mSDtfsCounter, 81 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 762 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-03-03 14:27:22,945 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 762 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:27:23,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48802 states. [2025-03-03 14:27:24,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48802 to 48794. [2025-03-03 14:27:24,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48794 states, 40251 states have (on average 1.6077116096494497) internal successors, (64712), 40257 states have internal predecessors, (64712), 8518 states have call successors, (8518), 22 states have call predecessors, (8518), 24 states have return successors, (9663), 8517 states have call predecessors, (9663), 8517 states have call successors, (9663) [2025-03-03 14:27:25,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48794 states to 48794 states and 82893 transitions. [2025-03-03 14:27:25,036 INFO L78 Accepts]: Start accepts. Automaton has 48794 states and 82893 transitions. Word has length 167 [2025-03-03 14:27:25,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:27:25,036 INFO L471 AbstractCegarLoop]: Abstraction has 48794 states and 82893 transitions. [2025-03-03 14:27:25,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 14:27:25,037 INFO L276 IsEmpty]: Start isEmpty. Operand 48794 states and 82893 transitions. [2025-03-03 14:27:25,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-03 14:27:25,144 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:27:25,144 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:27:25,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 14:27:25,145 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:27:25,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:27:25,146 INFO L85 PathProgramCache]: Analyzing trace with hash -407053022, now seen corresponding path program 1 times [2025-03-03 14:27:25,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:27:25,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318872963] [2025-03-03 14:27:25,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:27:25,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:27:25,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-03 14:27:25,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-03 14:27:25,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:27:25,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:27:25,213 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-03-03 14:27:25,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:27:25,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318872963] [2025-03-03 14:27:25,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318872963] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:27:25,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:27:25,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:27:25,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506556249] [2025-03-03 14:27:25,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:27:25,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:27:25,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:27:25,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:27:25,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:27:25,216 INFO L87 Difference]: Start difference. First operand 48794 states and 82893 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 14:27:26,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:27:26,853 INFO L93 Difference]: Finished difference Result 90769 states and 154610 transitions. [2025-03-03 14:27:26,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:27:26,854 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 168 [2025-03-03 14:27:26,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:27:27,269 INFO L225 Difference]: With dead ends: 90769 [2025-03-03 14:27:27,269 INFO L226 Difference]: Without dead ends: 90613 [2025-03-03 14:27:27,326 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-03-03 14:27:27,327 INFO L435 NwaCegarLoop]: 392 mSDtfsCounter, 76 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 774 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-03-03 14:27:27,328 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 774 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:27:27,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90613 states. [2025-03-03 14:27:30,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90613 to 90605. [2025-03-03 14:27:30,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90605 states, 75263 states have (on average 1.600587273959316) internal successors, (120465), 75269 states have internal predecessors, (120465), 15317 states have call successors, (15317), 22 states have call predecessors, (15317), 24 states have return successors, (17508), 15316 states have call predecessors, (17508), 15316 states have call successors, (17508) [2025-03-03 14:27:30,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90605 states to 90605 states and 153290 transitions. [2025-03-03 14:27:30,505 INFO L78 Accepts]: Start accepts. Automaton has 90605 states and 153290 transitions. Word has length 168 [2025-03-03 14:27:30,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:27:30,506 INFO L471 AbstractCegarLoop]: Abstraction has 90605 states and 153290 transitions. [2025-03-03 14:27:30,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 14:27:30,507 INFO L276 IsEmpty]: Start isEmpty. Operand 90605 states and 153290 transitions. [2025-03-03 14:27:30,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-03 14:27:30,663 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:27:30,663 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:27:30,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 14:27:30,664 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:27:30,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:27:30,664 INFO L85 PathProgramCache]: Analyzing trace with hash -878527203, now seen corresponding path program 1 times [2025-03-03 14:27:30,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:27:30,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801926845] [2025-03-03 14:27:30,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:27:30,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:27:30,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-03 14:27:30,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-03 14:27:30,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:27:30,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:27:30,908 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-03 14:27:30,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:27:30,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801926845] [2025-03-03 14:27:30,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801926845] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:27:30,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1018672636] [2025-03-03 14:27:30,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:27:30,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:27:30,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:27:30,911 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:27:30,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-03 14:27:31,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-03 14:27:31,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-03 14:27:31,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:27:31,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:27:31,189 INFO L256 TraceCheckSpWp]: Trace formula consists of 1224 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-03 14:27:31,193 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:27:31,714 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 55 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-03 14:27:31,714 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:27:32,397 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-03 14:27:32,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1018672636] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:27:32,397 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:27:32,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 12] total 32 [2025-03-03 14:27:32,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916677327] [2025-03-03 14:27:32,397 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:27:32,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-03 14:27:32,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:27:32,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-03 14:27:32,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=849, Unknown=0, NotChecked=0, Total=992 [2025-03-03 14:27:32,400 INFO L87 Difference]: Start difference. First operand 90605 states and 153290 transitions. Second operand has 32 states, 32 states have (on average 9.1875) internal successors, (294), 29 states have internal predecessors, (294), 17 states have call successors, (45), 5 states have call predecessors, (45), 13 states have return successors, (45), 19 states have call predecessors, (45), 17 states have call successors, (45) [2025-03-03 14:27:38,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:27:38,001 INFO L93 Difference]: Finished difference Result 180859 states and 311406 transitions. [2025-03-03 14:27:38,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-03 14:27:38,004 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 9.1875) internal successors, (294), 29 states have internal predecessors, (294), 17 states have call successors, (45), 5 states have call predecessors, (45), 13 states have return successors, (45), 19 states have call predecessors, (45), 17 states have call successors, (45) Word has length 169 [2025-03-03 14:27:38,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:27:38,730 INFO L225 Difference]: With dead ends: 180859 [2025-03-03 14:27:38,730 INFO L226 Difference]: Without dead ends: 180720 [2025-03-03 14:27:38,804 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 322 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 412 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=434, Invalid=2218, Unknown=0, NotChecked=0, Total=2652 [2025-03-03 14:27:38,806 INFO L435 NwaCegarLoop]: 618 mSDtfsCounter, 1442 mSDsluCounter, 9093 mSDsCounter, 0 mSdLazyCounter, 2240 mSolverCounterSat, 320 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1445 SdHoareTripleChecker+Valid, 9711 SdHoareTripleChecker+Invalid, 2560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 320 IncrementalHoareTripleChecker+Valid, 2240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:27:38,809 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1445 Valid, 9711 Invalid, 2560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [320 Valid, 2240 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 14:27:38,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180720 states. [2025-03-03 14:27:44,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180720 to 180620. [2025-03-03 14:27:44,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180620 states, 150106 states have (on average 1.6014283239843843) internal successors, (240384), 150013 states have internal predecessors, (240384), 30436 states have call successors, (30436), 69 states have call predecessors, (30436), 77 states have return successors, (38094), 30549 states have call predecessors, (38094), 30432 states have call successors, (38094) [2025-03-03 14:27:45,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180620 states to 180620 states and 308914 transitions. [2025-03-03 14:27:45,360 INFO L78 Accepts]: Start accepts. Automaton has 180620 states and 308914 transitions. Word has length 169 [2025-03-03 14:27:45,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:27:45,360 INFO L471 AbstractCegarLoop]: Abstraction has 180620 states and 308914 transitions. [2025-03-03 14:27:45,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 9.1875) internal successors, (294), 29 states have internal predecessors, (294), 17 states have call successors, (45), 5 states have call predecessors, (45), 13 states have return successors, (45), 19 states have call predecessors, (45), 17 states have call successors, (45) [2025-03-03 14:27:45,361 INFO L276 IsEmpty]: Start isEmpty. Operand 180620 states and 308914 transitions. [2025-03-03 14:27:45,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-03 14:27:45,679 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:27:45,679 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:27:45,687 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-03 14:27:45,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:27:45,880 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:27:45,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:27:45,880 INFO L85 PathProgramCache]: Analyzing trace with hash -680547984, now seen corresponding path program 1 times [2025-03-03 14:27:45,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:27:45,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806687368] [2025-03-03 14:27:45,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:27:45,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:27:45,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-03 14:27:45,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-03 14:27:45,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:27:45,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:27:45,954 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-03-03 14:27:45,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:27:45,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806687368] [2025-03-03 14:27:45,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806687368] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:27:45,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:27:45,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:27:45,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276052170] [2025-03-03 14:27:45,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:27:45,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:27:45,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:27:45,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:27:45,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:27:45,956 INFO L87 Difference]: Start difference. First operand 180620 states and 308914 transitions. Second operand has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 4 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16)