./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec27_product28.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_spec27_product28.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 4fb12138b73b283c9fdc444b2c9ebb4aa3340005d69e98d463fd0b0beb9c1e74 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 14:22:25,489 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 14:22:25,538 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 14:22:25,543 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 14:22:25,543 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 14:22:25,557 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 14:22:25,557 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 14:22:25,558 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 14:22:25,558 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 14:22:25,558 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 14:22:25,558 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 14:22:25,558 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 14:22:25,558 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 14:22:25,558 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 14:22:25,558 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 14:22:25,559 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 14:22:25,559 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 14:22:25,559 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 14:22:25,559 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 14:22:25,559 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 14:22:25,559 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 14:22:25,559 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 14:22:25,559 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 14:22:25,559 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 14:22:25,559 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 14:22:25,559 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 14:22:25,560 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 14:22:25,560 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 14:22:25,560 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 14:22:25,560 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 14:22:25,560 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 14:22:25,560 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 14:22:25,560 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:22:25,560 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 14:22:25,560 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 14:22:25,560 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 14:22:25,560 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 14:22:25,560 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 14:22:25,560 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 14:22:25,561 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 14:22:25,561 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 14:22:25,561 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 14:22:25,561 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 14:22:25,561 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 -> 4fb12138b73b283c9fdc444b2c9ebb4aa3340005d69e98d463fd0b0beb9c1e74 [2025-03-03 14:22:25,762 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 14:22:25,767 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 14:22:25,768 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 14:22:25,769 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 14:22:25,769 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 14:22:25,770 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec27_product28.cil.c [2025-03-03 14:22:26,896 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/451acd1b7/8754162d177a4728a018468c11887540/FLAGf1b498416 [2025-03-03 14:22:27,198 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 14:22:27,199 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec27_product28.cil.c [2025-03-03 14:22:27,210 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/451acd1b7/8754162d177a4728a018468c11887540/FLAGf1b498416 [2025-03-03 14:22:27,221 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/451acd1b7/8754162d177a4728a018468c11887540 [2025-03-03 14:22:27,223 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 14:22:27,224 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 14:22:27,225 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 14:22:27,225 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 14:22:27,228 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 14:22:27,228 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:22:27" (1/1) ... [2025-03-03 14:22:27,229 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75254f70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:27, skipping insertion in model container [2025-03-03 14:22:27,229 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:22:27" (1/1) ... [2025-03-03 14:22:27,264 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 14:22:27,604 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_spec27_product28.cil.c[32786,32799] [2025-03-03 14:22:27,653 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:22:27,670 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 14:22:27,676 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"VerifyForward_spec.i","") [48] [2025-03-03 14:22:27,677 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [95] [2025-03-03 14:22:27,677 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [386] [2025-03-03 14:22:27,677 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [532] [2025-03-03 14:22:27,677 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [898] [2025-03-03 14:22:27,677 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [1300] [2025-03-03 14:22:27,677 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [1622] [2025-03-03 14:22:27,678 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [1631] [2025-03-03 14:22:27,678 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [1648] [2025-03-03 14:22:27,678 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [1683] [2025-03-03 14:22:27,678 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [2752] [2025-03-03 14:22:27,719 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_spec27_product28.cil.c[32786,32799] [2025-03-03 14:22:27,752 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:22:27,774 INFO L204 MainTranslator]: Completed translation [2025-03-03 14:22:27,775 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:27 WrapperNode [2025-03-03 14:22:27,776 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 14:22:27,777 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 14:22:27,777 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 14:22:27,777 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 14:22:27,781 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:22:27" (1/1) ... [2025-03-03 14:22:27,798 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:22:27" (1/1) ... [2025-03-03 14:22:27,826 INFO L138 Inliner]: procedures = 128, calls = 197, calls flagged for inlining = 54, calls inlined = 45, statements flattened = 863 [2025-03-03 14:22:27,826 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 14:22:27,827 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 14:22:27,827 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 14:22:27,827 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 14:22:27,833 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:27" (1/1) ... [2025-03-03 14:22:27,833 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:27" (1/1) ... [2025-03-03 14:22:27,837 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:27" (1/1) ... [2025-03-03 14:22:27,855 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:22:27,856 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:27" (1/1) ... [2025-03-03 14:22:27,856 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:27" (1/1) ... [2025-03-03 14:22:27,866 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:27" (1/1) ... [2025-03-03 14:22:27,868 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:27" (1/1) ... [2025-03-03 14:22:27,870 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:27" (1/1) ... [2025-03-03 14:22:27,872 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:27" (1/1) ... [2025-03-03 14:22:27,875 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 14:22:27,876 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 14:22:27,876 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 14:22:27,876 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 14:22:27,876 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:27" (1/1) ... [2025-03-03 14:22:27,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:22:27,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:22:27,910 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:22:27,915 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:22:27,931 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2025-03-03 14:22:27,931 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2025-03-03 14:22:27,931 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2025-03-03 14:22:27,931 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2025-03-03 14:22:27,931 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2025-03-03 14:22:27,931 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2025-03-03 14:22:27,931 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-03-03 14:22:27,931 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-03-03 14:22:27,931 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-03-03 14:22:27,931 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-03-03 14:22:27,931 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2025-03-03 14:22:27,931 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2025-03-03 14:22:27,931 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-03-03 14:22:27,932 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-03-03 14:22:27,932 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2025-03-03 14:22:27,932 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2025-03-03 14:22:27,932 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2025-03-03 14:22:27,932 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2025-03-03 14:22:27,932 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-03-03 14:22:27,932 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-03-03 14:22:27,932 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-03-03 14:22:27,932 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-03-03 14:22:27,932 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-03-03 14:22:27,932 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-03-03 14:22:27,932 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 14:22:27,932 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2025-03-03 14:22:27,932 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2025-03-03 14:22:27,932 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2025-03-03 14:22:27,932 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2025-03-03 14:22:27,932 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-03-03 14:22:27,932 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-03-03 14:22:27,932 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-03-03 14:22:27,932 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-03-03 14:22:27,932 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-03-03 14:22:27,932 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-03-03 14:22:27,933 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2025-03-03 14:22:27,933 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2025-03-03 14:22:27,933 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2025-03-03 14:22:27,933 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2025-03-03 14:22:27,933 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-03-03 14:22:27,933 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-03-03 14:22:27,933 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2025-03-03 14:22:27,933 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2025-03-03 14:22:27,934 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-03-03 14:22:27,934 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-03-03 14:22:27,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 14:22:27,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 14:22:27,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-03 14:22:27,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-03 14:22:27,934 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-03-03 14:22:27,934 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-03-03 14:22:27,934 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 14:22:27,934 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 14:22:28,091 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 14:22:28,093 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 14:22:28,301 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2729-1: getClientId_#res#1 := getClientId_~retValue_acc~43#1; [2025-03-03 14:22:28,312 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1207: #res := ~retValue_acc~16; [2025-03-03 14:22:28,319 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1281: #res := ~retValue_acc~18; [2025-03-03 14:22:28,330 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1540: #res := ~retValue_acc~23; [2025-03-03 14:22:28,369 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2386: #res#1 := ~retValue_acc~38#1; [2025-03-03 14:22:28,370 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2341-1: getClientKeyringSize_#res#1 := getClientKeyringSize_~retValue_acc~37#1; [2025-03-03 14:22:28,401 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2610: #res := ~retValue_acc~41; [2025-03-03 14:22:28,431 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2294: #res := ~retValue_acc~36; [2025-03-03 14:22:28,451 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L529-1: createEmail_#res#1 := createEmail_~retValue_acc~4#1; [2025-03-03 14:22:28,463 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1133: #res := ~retValue_acc~14; [2025-03-03 14:22:28,477 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1170: #res := ~retValue_acc~15; [2025-03-03 14:22:28,482 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1244: #res := ~retValue_acc~17; [2025-03-03 14:22:28,499 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1018: #res := ~retValue_acc~11; [2025-03-03 14:22:28,746 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1497-1: is_queue_empty_#res#1 := is_queue_empty_~retValue_acc~20#1; [2025-03-03 14:22:28,746 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1506-1: get_queued_client_#res#1 := get_queued_client_~retValue_acc~21#1; [2025-03-03 14:22:28,746 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1680-1: valid_product_#res#1 := valid_product_~retValue_acc~26#1; [2025-03-03 14:22:28,746 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1515-1: get_queued_email_#res#1 := get_queued_email_~retValue_acc~22#1; [2025-03-03 14:22:28,746 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2556-1: getClientKeyringPublicKey_#res#1 := getClientKeyringPublicKey_~retValue_acc~40#1; [2025-03-03 14:22:28,747 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2449-1: getClientKeyringUser_#res#1 := getClientKeyringUser_~retValue_acc~39#1; [2025-03-03 14:22:28,755 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L981: #res := ~retValue_acc~10; [2025-03-03 14:22:28,764 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L505: #res#1 := ~retValue_acc~2#1; [2025-03-03 14:22:28,764 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L485-1: isReadable__wrappee__Keys_#res#1 := isReadable__wrappee__Keys_~retValue_acc~1#1; [2025-03-03 14:22:28,865 INFO L? ?]: Removed 406 outVars from TransFormulas that were not future-live. [2025-03-03 14:22:28,865 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 14:22:28,882 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 14:22:28,883 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 14:22:28,884 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:22:28 BoogieIcfgContainer [2025-03-03 14:22:28,884 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 14:22:28,886 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 14:22:28,886 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 14:22:28,890 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 14:22:28,890 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 02:22:27" (1/3) ... [2025-03-03 14:22:28,890 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e6f6c60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:22:28, skipping insertion in model container [2025-03-03 14:22:28,891 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:27" (2/3) ... [2025-03-03 14:22:28,891 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e6f6c60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:22:28, skipping insertion in model container [2025-03-03 14:22:28,891 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:22:28" (3/3) ... [2025-03-03 14:22:28,892 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec27_product28.cil.c [2025-03-03 14:22:28,902 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 14:22:28,905 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec27_product28.cil.c that has 24 procedures, 333 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 14:22:28,959 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 14:22:28,970 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;@4269c95e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 14:22:28,970 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 14:22:28,975 INFO L276 IsEmpty]: Start isEmpty. Operand has 333 states, 257 states have (on average 1.517509727626459) internal successors, (390), 261 states have internal predecessors, (390), 51 states have call successors, (51), 23 states have call predecessors, (51), 23 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2025-03-03 14:22:28,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-03 14:22:28,988 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:28,988 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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:22:28,989 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:28,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:28,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1376724864, now seen corresponding path program 1 times [2025-03-03 14:22:28,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:28,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442686799] [2025-03-03 14:22:28,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:28,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:29,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-03 14:22:29,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-03 14:22:29,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:29,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:29,620 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-03 14:22:29,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:29,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442686799] [2025-03-03 14:22:29,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442686799] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:22:29,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1773009488] [2025-03-03 14:22:29,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:29,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:22:29,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:22:29,625 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:22:29,627 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:22:29,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-03 14:22:29,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-03 14:22:29,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:29,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:29,928 INFO L256 TraceCheckSpWp]: Trace formula consists of 1133 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 14:22:29,934 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:22:29,948 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-03-03 14:22:29,948 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:22:29,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1773009488] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:29,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:22:29,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 5 [2025-03-03 14:22:29,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57022393] [2025-03-03 14:22:29,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:29,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 14:22:29,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:29,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 14:22:29,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:22:29,976 INFO L87 Difference]: Start difference. First operand has 333 states, 257 states have (on average 1.517509727626459) internal successors, (390), 261 states have internal predecessors, (390), 51 states have call successors, (51), 23 states have call predecessors, (51), 23 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) Second operand has 2 states, 2 states have (on average 38.0) internal successors, (76), 2 states have internal predecessors, (76), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-03 14:22:30,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:30,013 INFO L93 Difference]: Finished difference Result 518 states and 748 transitions. [2025-03-03 14:22:30,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 14:22:30,015 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 38.0) internal successors, (76), 2 states have internal predecessors, (76), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 139 [2025-03-03 14:22:30,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:30,024 INFO L225 Difference]: With dead ends: 518 [2025-03-03 14:22:30,024 INFO L226 Difference]: Without dead ends: 326 [2025-03-03 14:22:30,028 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 140 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:22:30,030 INFO L435 NwaCegarLoop]: 489 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, 489 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:22:30,031 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 489 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:30,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2025-03-03 14:22:30,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 326. [2025-03-03 14:22:30,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 251 states have (on average 1.5139442231075697) internal successors, (380), 254 states have internal predecessors, (380), 51 states have call successors, (51), 23 states have call predecessors, (51), 23 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-03 14:22:30,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 481 transitions. [2025-03-03 14:22:30,097 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 481 transitions. Word has length 139 [2025-03-03 14:22:30,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:30,099 INFO L471 AbstractCegarLoop]: Abstraction has 326 states and 481 transitions. [2025-03-03 14:22:30,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 38.0) internal successors, (76), 2 states have internal predecessors, (76), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-03 14:22:30,099 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 481 transitions. [2025-03-03 14:22:30,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-03 14:22:30,107 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:30,107 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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:22:30,117 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:22:30,313 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:22:30,315 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:30,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:30,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1297017079, now seen corresponding path program 1 times [2025-03-03 14:22:30,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:30,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040006267] [2025-03-03 14:22:30,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:30,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:30,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-03 14:22:30,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-03 14:22:30,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:30,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:30,600 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-03 14:22:30,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:30,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040006267] [2025-03-03 14:22:30,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040006267] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:22:30,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1714931595] [2025-03-03 14:22:30,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:30,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:22:30,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:22:30,604 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:22:30,607 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:22:30,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-03 14:22:30,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-03 14:22:30,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:30,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:30,894 INFO L256 TraceCheckSpWp]: Trace formula consists of 1134 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 14:22:30,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:22:30,934 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-03-03 14:22:30,935 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:22:30,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1714931595] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:30,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:22:30,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 14:22:30,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059458135] [2025-03-03 14:22:30,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:30,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:22:30,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:30,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:22:30,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:22:30,940 INFO L87 Difference]: Start difference. First operand 326 states and 481 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-03 14:22:30,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:30,965 INFO L93 Difference]: Finished difference Result 507 states and 729 transitions. [2025-03-03 14:22:30,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:22:30,966 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 140 [2025-03-03 14:22:30,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:30,968 INFO L225 Difference]: With dead ends: 507 [2025-03-03 14:22:30,969 INFO L226 Difference]: Without dead ends: 328 [2025-03-03 14:22:30,970 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 140 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:22:30,970 INFO L435 NwaCegarLoop]: 480 mSDtfsCounter, 0 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 958 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:22:30,971 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 958 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:30,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2025-03-03 14:22:30,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 328. [2025-03-03 14:22:30,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 253 states have (on average 1.5098814229249011) internal successors, (382), 256 states have internal predecessors, (382), 51 states have call successors, (51), 23 states have call predecessors, (51), 23 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-03 14:22:30,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 483 transitions. [2025-03-03 14:22:30,998 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 483 transitions. Word has length 140 [2025-03-03 14:22:30,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:30,999 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 483 transitions. [2025-03-03 14:22:31,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-03 14:22:31,000 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 483 transitions. [2025-03-03 14:22:31,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-03 14:22:31,003 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:31,003 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:31,011 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:22:31,203 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:22:31,204 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:31,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:31,204 INFO L85 PathProgramCache]: Analyzing trace with hash 708920363, now seen corresponding path program 1 times [2025-03-03 14:22:31,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:31,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202400505] [2025-03-03 14:22:31,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:31,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:31,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-03 14:22:31,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-03 14:22:31,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:31,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:31,446 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-03 14:22:31,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:31,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202400505] [2025-03-03 14:22:31,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202400505] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:22:31,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1955125467] [2025-03-03 14:22:31,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:31,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:22:31,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:22:31,451 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:22:31,453 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:22:31,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-03 14:22:31,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-03 14:22:31,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:31,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:31,719 INFO L256 TraceCheckSpWp]: Trace formula consists of 1146 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:22:31,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:22:31,744 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-03-03 14:22:31,745 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:22:31,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1955125467] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:31,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:22:31,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 14:22:31,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256186266] [2025-03-03 14:22:31,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:31,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:22:31,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:31,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:22:31,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:22:31,751 INFO L87 Difference]: Start difference. First operand 328 states and 483 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-03 14:22:31,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:31,795 INFO L93 Difference]: Finished difference Result 680 states and 1016 transitions. [2025-03-03 14:22:31,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:22:31,796 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 145 [2025-03-03 14:22:31,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:31,802 INFO L225 Difference]: With dead ends: 680 [2025-03-03 14:22:31,803 INFO L226 Difference]: Without dead ends: 379 [2025-03-03 14:22:31,807 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 145 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:22:31,807 INFO L435 NwaCegarLoop]: 486 mSDtfsCounter, 99 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 919 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:22:31,810 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 919 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:31,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2025-03-03 14:22:31,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 371. [2025-03-03 14:22:31,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 285 states have (on average 1.5263157894736843) internal successors, (435), 288 states have internal predecessors, (435), 62 states have call successors, (62), 23 states have call predecessors, (62), 23 states have return successors, (61), 61 states have call predecessors, (61), 61 states have call successors, (61) [2025-03-03 14:22:31,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 558 transitions. [2025-03-03 14:22:31,837 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 558 transitions. Word has length 145 [2025-03-03 14:22:31,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:31,838 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 558 transitions. [2025-03-03 14:22:31,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-03 14:22:31,839 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 558 transitions. [2025-03-03 14:22:31,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-03 14:22:31,842 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:31,842 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:31,852 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 14:22:32,043 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:22:32,043 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:32,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:32,044 INFO L85 PathProgramCache]: Analyzing trace with hash 370433116, now seen corresponding path program 1 times [2025-03-03 14:22:32,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:32,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049684147] [2025-03-03 14:22:32,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:32,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:32,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-03 14:22:32,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-03 14:22:32,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:32,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:32,227 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-03 14:22:32,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:32,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049684147] [2025-03-03 14:22:32,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049684147] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:22:32,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [876897040] [2025-03-03 14:22:32,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:32,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:22:32,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:22:32,230 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:22:32,231 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:22:32,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-03 14:22:32,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-03 14:22:32,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:32,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:32,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 1151 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 14:22:32,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:22:32,568 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-03 14:22:32,569 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:22:32,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [876897040] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:32,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:22:32,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-03-03 14:22:32,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21966006] [2025-03-03 14:22:32,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:32,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:22:32,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:32,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:22:32,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:22:32,570 INFO L87 Difference]: Start difference. First operand 371 states and 558 transitions. Second operand has 5 states, 4 states have (on average 22.75) internal successors, (91), 5 states have internal predecessors, (91), 3 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-03 14:22:32,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:32,635 INFO L93 Difference]: Finished difference Result 733 states and 1106 transitions. [2025-03-03 14:22:32,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:22:32,636 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 22.75) internal successors, (91), 5 states have internal predecessors, (91), 3 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) Word has length 146 [2025-03-03 14:22:32,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:32,638 INFO L225 Difference]: With dead ends: 733 [2025-03-03 14:22:32,639 INFO L226 Difference]: Without dead ends: 373 [2025-03-03 14:22:32,640 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 144 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:22:32,641 INFO L435 NwaCegarLoop]: 473 mSDtfsCounter, 2 mSDsluCounter, 1408 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1881 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:22:32,642 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1881 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:32,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2025-03-03 14:22:32,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 373. [2025-03-03 14:22:32,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 286 states have (on average 1.5244755244755244) internal successors, (436), 290 states have internal predecessors, (436), 62 states have call successors, (62), 23 states have call predecessors, (62), 24 states have return successors, (63), 61 states have call predecessors, (63), 61 states have call successors, (63) [2025-03-03 14:22:32,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 561 transitions. [2025-03-03 14:22:32,663 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 561 transitions. Word has length 146 [2025-03-03 14:22:32,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:32,664 INFO L471 AbstractCegarLoop]: Abstraction has 373 states and 561 transitions. [2025-03-03 14:22:32,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 22.75) internal successors, (91), 5 states have internal predecessors, (91), 3 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-03 14:22:32,664 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 561 transitions. [2025-03-03 14:22:32,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-03 14:22:32,669 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:32,669 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2025-03-03 14:22:32,677 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:22:32,869 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:22:32,870 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:32,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:32,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1883615013, now seen corresponding path program 1 times [2025-03-03 14:22:32,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:32,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274388723] [2025-03-03 14:22:32,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:32,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:32,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-03 14:22:32,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-03 14:22:32,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:32,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:33,023 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-03 14:22:33,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:33,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274388723] [2025-03-03 14:22:33,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274388723] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:22:33,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1021140971] [2025-03-03 14:22:33,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:33,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:22:33,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:22:33,025 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:22:33,027 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:22:33,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-03 14:22:33,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-03 14:22:33,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:33,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:33,249 INFO L256 TraceCheckSpWp]: Trace formula consists of 1152 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 14:22:33,253 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:22:33,298 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-03 14:22:33,301 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:22:33,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1021140971] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:33,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:22:33,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-03-03 14:22:33,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849006420] [2025-03-03 14:22:33,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:33,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:22:33,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:33,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:22:33,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:22:33,303 INFO L87 Difference]: Start difference. First operand 373 states and 561 transitions. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 3 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-03 14:22:33,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:33,359 INFO L93 Difference]: Finished difference Result 735 states and 1111 transitions. [2025-03-03 14:22:33,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:22:33,360 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 3 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 147 [2025-03-03 14:22:33,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:33,363 INFO L225 Difference]: With dead ends: 735 [2025-03-03 14:22:33,364 INFO L226 Difference]: Without dead ends: 375 [2025-03-03 14:22:33,366 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 145 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:22:33,368 INFO L435 NwaCegarLoop]: 471 mSDtfsCounter, 2 mSDsluCounter, 1396 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1867 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:22:33,368 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1867 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:33,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2025-03-03 14:22:33,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 375. [2025-03-03 14:22:33,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 287 states have (on average 1.5226480836236933) internal successors, (437), 292 states have internal predecessors, (437), 62 states have call successors, (62), 23 states have call predecessors, (62), 25 states have return successors, (68), 61 states have call predecessors, (68), 61 states have call successors, (68) [2025-03-03 14:22:33,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 567 transitions. [2025-03-03 14:22:33,389 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 567 transitions. Word has length 147 [2025-03-03 14:22:33,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:33,389 INFO L471 AbstractCegarLoop]: Abstraction has 375 states and 567 transitions. [2025-03-03 14:22:33,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 3 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-03 14:22:33,389 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 567 transitions. [2025-03-03 14:22:33,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-03 14:22:33,391 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:33,392 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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:22:33,400 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-03 14:22:33,592 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:22:33,592 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:33,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:33,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1457250142, now seen corresponding path program 1 times [2025-03-03 14:22:33,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:33,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231627322] [2025-03-03 14:22:33,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:33,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:33,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-03 14:22:33,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-03 14:22:33,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:33,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:33,728 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-03 14:22:33,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:33,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231627322] [2025-03-03 14:22:33,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231627322] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:33,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:33,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:22:33,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141344035] [2025-03-03 14:22:33,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:33,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:22:33,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:33,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:22:33,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:22:33,730 INFO L87 Difference]: Start difference. First operand 375 states and 567 transitions. Second operand has 5 states, 4 states have (on average 22.25) internal successors, (89), 5 states have internal predecessors, (89), 3 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-03 14:22:33,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:33,765 INFO L93 Difference]: Finished difference Result 727 states and 1102 transitions. [2025-03-03 14:22:33,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:22:33,766 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 22.25) internal successors, (89), 5 states have internal predecessors, (89), 3 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) Word has length 148 [2025-03-03 14:22:33,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:33,768 INFO L225 Difference]: With dead ends: 727 [2025-03-03 14:22:33,769 INFO L226 Difference]: Without dead ends: 375 [2025-03-03 14:22:33,770 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:22:33,771 INFO L435 NwaCegarLoop]: 474 mSDtfsCounter, 2 mSDsluCounter, 1411 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1885 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:22:33,771 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1885 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:33,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2025-03-03 14:22:33,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 375. [2025-03-03 14:22:33,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 287 states have (on average 1.5226480836236933) internal successors, (437), 292 states have internal predecessors, (437), 62 states have call successors, (62), 23 states have call predecessors, (62), 25 states have return successors, (67), 61 states have call predecessors, (67), 61 states have call successors, (67) [2025-03-03 14:22:33,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 566 transitions. [2025-03-03 14:22:33,790 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 566 transitions. Word has length 148 [2025-03-03 14:22:33,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:33,790 INFO L471 AbstractCegarLoop]: Abstraction has 375 states and 566 transitions. [2025-03-03 14:22:33,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 22.25) internal successors, (89), 5 states have internal predecessors, (89), 3 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-03 14:22:33,790 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 566 transitions. [2025-03-03 14:22:33,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-03 14:22:33,792 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:33,792 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2025-03-03 14:22:33,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 14:22:33,792 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:33,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:33,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1810174587, now seen corresponding path program 2 times [2025-03-03 14:22:33,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:33,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855098345] [2025-03-03 14:22:33,793 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 14:22:33,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:33,811 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 149 statements into 2 equivalence classes. [2025-03-03 14:22:33,817 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 81 of 149 statements. [2025-03-03 14:22:33,817 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-03 14:22:33,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:33,919 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-03 14:22:33,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:33,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855098345] [2025-03-03 14:22:33,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855098345] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:33,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:33,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 14:22:33,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707197685] [2025-03-03 14:22:33,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:33,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 14:22:33,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:33,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 14:22:33,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:22:33,922 INFO L87 Difference]: Start difference. First operand 375 states and 566 transitions. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 7 states have internal predecessors, (91), 3 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (18), 4 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-03 14:22:34,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:34,214 INFO L93 Difference]: Finished difference Result 998 states and 1489 transitions. [2025-03-03 14:22:34,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 14:22:34,214 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 7 states have internal predecessors, (91), 3 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (18), 4 states have call predecessors, (18), 3 states have call successors, (18) Word has length 149 [2025-03-03 14:22:34,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:34,218 INFO L225 Difference]: With dead ends: 998 [2025-03-03 14:22:34,218 INFO L226 Difference]: Without dead ends: 827 [2025-03-03 14:22:34,219 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-03-03 14:22:34,220 INFO L435 NwaCegarLoop]: 507 mSDtfsCounter, 549 mSDsluCounter, 2875 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 565 SdHoareTripleChecker+Valid, 3382 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:34,220 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [565 Valid, 3382 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 14:22:34,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 827 states. [2025-03-03 14:22:34,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 827 to 745. [2025-03-03 14:22:34,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 745 states, 572 states have (on average 1.527972027972028) internal successors, (874), 579 states have internal predecessors, (874), 122 states have call successors, (122), 47 states have call predecessors, (122), 50 states have return successors, (136), 122 states have call predecessors, (136), 120 states have call successors, (136) [2025-03-03 14:22:34,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 1132 transitions. [2025-03-03 14:22:34,250 INFO L78 Accepts]: Start accepts. Automaton has 745 states and 1132 transitions. Word has length 149 [2025-03-03 14:22:34,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:34,250 INFO L471 AbstractCegarLoop]: Abstraction has 745 states and 1132 transitions. [2025-03-03 14:22:34,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 7 states have internal predecessors, (91), 3 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (18), 4 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-03 14:22:34,250 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 1132 transitions. [2025-03-03 14:22:34,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-03 14:22:34,253 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:34,253 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1] [2025-03-03 14:22:34,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 14:22:34,254 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:34,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:34,254 INFO L85 PathProgramCache]: Analyzing trace with hash -418983826, now seen corresponding path program 1 times [2025-03-03 14:22:34,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:34,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845011904] [2025-03-03 14:22:34,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:34,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:34,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-03 14:22:34,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-03 14:22:34,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:34,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:34,395 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-03 14:22:34,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:34,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845011904] [2025-03-03 14:22:34,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845011904] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:34,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:34,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:22:34,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890407458] [2025-03-03 14:22:34,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:34,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:22:34,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:34,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:22:34,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:22:34,398 INFO L87 Difference]: Start difference. First operand 745 states and 1132 transitions. Second operand has 5 states, 4 states have (on average 23.0) internal successors, (92), 5 states have internal predecessors, (92), 3 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-03 14:22:34,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:34,444 INFO L93 Difference]: Finished difference Result 1459 states and 2224 transitions. [2025-03-03 14:22:34,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:22:34,445 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 23.0) internal successors, (92), 5 states have internal predecessors, (92), 3 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) Word has length 150 [2025-03-03 14:22:34,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:34,449 INFO L225 Difference]: With dead ends: 1459 [2025-03-03 14:22:34,449 INFO L226 Difference]: Without dead ends: 749 [2025-03-03 14:22:34,451 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:22:34,451 INFO L435 NwaCegarLoop]: 475 mSDtfsCounter, 1 mSDsluCounter, 1413 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1888 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:22:34,451 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1888 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:34,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 749 states. [2025-03-03 14:22:34,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 749 to 749. [2025-03-03 14:22:34,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 749 states, 574 states have (on average 1.5261324041811846) internal successors, (876), 583 states have internal predecessors, (876), 122 states have call successors, (122), 47 states have call predecessors, (122), 52 states have return successors, (139), 122 states have call predecessors, (139), 120 states have call successors, (139) [2025-03-03 14:22:34,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 749 states and 1137 transitions. [2025-03-03 14:22:34,488 INFO L78 Accepts]: Start accepts. Automaton has 749 states and 1137 transitions. Word has length 150 [2025-03-03 14:22:34,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:34,488 INFO L471 AbstractCegarLoop]: Abstraction has 749 states and 1137 transitions. [2025-03-03 14:22:34,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 23.0) internal successors, (92), 5 states have internal predecessors, (92), 3 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-03 14:22:34,488 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states and 1137 transitions. [2025-03-03 14:22:34,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-03 14:22:34,492 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:34,493 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1, 1, 1, 1] [2025-03-03 14:22:34,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 14:22:34,493 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:34,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:34,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1643429416, now seen corresponding path program 1 times [2025-03-03 14:22:34,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:34,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107260462] [2025-03-03 14:22:34,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:34,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:34,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-03 14:22:34,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-03 14:22:34,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:34,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:34,639 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-03 14:22:34,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:34,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107260462] [2025-03-03 14:22:34,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107260462] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:34,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:34,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 14:22:34,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791726944] [2025-03-03 14:22:34,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:34,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 14:22:34,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:34,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 14:22:34,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:22:34,642 INFO L87 Difference]: Start difference. First operand 749 states and 1137 transitions. Second operand has 8 states, 7 states have (on average 13.714285714285714) internal successors, (96), 8 states have internal predecessors, (96), 4 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-03 14:22:34,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:34,780 INFO L93 Difference]: Finished difference Result 1457 states and 2216 transitions. [2025-03-03 14:22:34,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 14:22:34,781 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 13.714285714285714) internal successors, (96), 8 states have internal predecessors, (96), 4 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) Word has length 151 [2025-03-03 14:22:34,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:34,785 INFO L225 Difference]: With dead ends: 1457 [2025-03-03 14:22:34,785 INFO L226 Difference]: Without dead ends: 753 [2025-03-03 14:22:34,787 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:22:34,788 INFO L435 NwaCegarLoop]: 465 mSDtfsCounter, 7 mSDsluCounter, 2761 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 3226 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:34,788 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 3226 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:22:34,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 753 states. [2025-03-03 14:22:34,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 753 to 751. [2025-03-03 14:22:34,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 751 states, 576 states have (on average 1.5243055555555556) internal successors, (878), 584 states have internal predecessors, (878), 122 states have call successors, (122), 48 states have call predecessors, (122), 52 states have return successors, (137), 122 states have call predecessors, (137), 120 states have call successors, (137) [2025-03-03 14:22:34,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 751 states and 1137 transitions. [2025-03-03 14:22:34,816 INFO L78 Accepts]: Start accepts. Automaton has 751 states and 1137 transitions. Word has length 151 [2025-03-03 14:22:34,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:34,817 INFO L471 AbstractCegarLoop]: Abstraction has 751 states and 1137 transitions. [2025-03-03 14:22:34,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 13.714285714285714) internal successors, (96), 8 states have internal predecessors, (96), 4 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-03 14:22:34,817 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 1137 transitions. [2025-03-03 14:22:34,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-03 14:22:34,820 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:34,820 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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:22:34,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 14:22:34,821 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:34,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:34,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1608446241, now seen corresponding path program 1 times [2025-03-03 14:22:34,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:34,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265387722] [2025-03-03 14:22:34,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:34,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:34,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-03 14:22:34,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-03 14:22:34,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:34,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:34,925 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-03-03 14:22:34,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:34,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265387722] [2025-03-03 14:22:34,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265387722] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:22:34,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1082902205] [2025-03-03 14:22:34,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:34,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:22:34,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:22:34,927 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:22:34,929 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:22:35,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-03 14:22:35,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-03 14:22:35,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:35,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:35,167 INFO L256 TraceCheckSpWp]: Trace formula consists of 1157 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 14:22:35,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:22:35,211 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-03-03 14:22:35,211 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:22:35,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1082902205] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:35,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:22:35,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-03-03 14:22:35,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278865186] [2025-03-03 14:22:35,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:35,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:22:35,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:35,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:22:35,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:22:35,213 INFO L87 Difference]: Start difference. First operand 751 states and 1137 transitions. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-03 14:22:35,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:35,266 INFO L93 Difference]: Finished difference Result 1133 states and 1715 transitions. [2025-03-03 14:22:35,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:22:35,267 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 152 [2025-03-03 14:22:35,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:35,271 INFO L225 Difference]: With dead ends: 1133 [2025-03-03 14:22:35,271 INFO L226 Difference]: Without dead ends: 757 [2025-03-03 14:22:35,273 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 150 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:22:35,273 INFO L435 NwaCegarLoop]: 474 mSDtfsCounter, 1 mSDsluCounter, 1404 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1878 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:35,273 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1878 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:35,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 757 states. [2025-03-03 14:22:35,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 757 to 753. [2025-03-03 14:22:35,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 753 states, 577 states have (on average 1.5233968804159446) internal successors, (879), 586 states have internal predecessors, (879), 122 states have call successors, (122), 48 states have call predecessors, (122), 53 states have return successors, (140), 122 states have call predecessors, (140), 120 states have call successors, (140) [2025-03-03 14:22:35,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 753 states and 1141 transitions. [2025-03-03 14:22:35,303 INFO L78 Accepts]: Start accepts. Automaton has 753 states and 1141 transitions. Word has length 152 [2025-03-03 14:22:35,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:35,303 INFO L471 AbstractCegarLoop]: Abstraction has 753 states and 1141 transitions. [2025-03-03 14:22:35,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-03 14:22:35,304 INFO L276 IsEmpty]: Start isEmpty. Operand 753 states and 1141 transitions. [2025-03-03 14:22:35,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-03 14:22:35,307 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:35,307 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1, 1, 1] [2025-03-03 14:22:35,315 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-03 14:22:35,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:22:35,508 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:35,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:35,509 INFO L85 PathProgramCache]: Analyzing trace with hash 2048838733, now seen corresponding path program 2 times [2025-03-03 14:22:35,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:35,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100413769] [2025-03-03 14:22:35,509 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 14:22:35,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:35,532 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 152 statements into 2 equivalence classes. [2025-03-03 14:22:35,538 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 84 of 152 statements. [2025-03-03 14:22:35,539 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-03 14:22:35,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:35,693 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-03-03 14:22:35,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:35,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100413769] [2025-03-03 14:22:35,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100413769] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:35,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:35,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 14:22:35,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96057092] [2025-03-03 14:22:35,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:35,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 14:22:35,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:35,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 14:22:35,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:22:35,695 INFO L87 Difference]: Start difference. First operand 753 states and 1141 transitions. Second operand has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 3 states have call successors, (20), 1 states have call predecessors, (20), 3 states have return successors, (18), 5 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-03 14:22:35,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:35,811 INFO L93 Difference]: Finished difference Result 1183 states and 1756 transitions. [2025-03-03 14:22:35,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 14:22:35,812 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 3 states have call successors, (20), 1 states have call predecessors, (20), 3 states have return successors, (18), 5 states have call predecessors, (18), 3 states have call successors, (18) Word has length 152 [2025-03-03 14:22:35,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:35,817 INFO L225 Difference]: With dead ends: 1183 [2025-03-03 14:22:35,817 INFO L226 Difference]: Without dead ends: 843 [2025-03-03 14:22:35,819 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:22:35,819 INFO L435 NwaCegarLoop]: 508 mSDtfsCounter, 40 mSDsluCounter, 3495 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 4003 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:35,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 4003 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:22:35,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2025-03-03 14:22:35,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 835. [2025-03-03 14:22:35,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 835 states, 628 states have (on average 1.5111464968152866) internal successors, (949), 643 states have internal predecessors, (949), 150 states have call successors, (150), 48 states have call predecessors, (150), 56 states have return successors, (178), 149 states have call predecessors, (178), 148 states have call successors, (178) [2025-03-03 14:22:35,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 835 states to 835 states and 1277 transitions. [2025-03-03 14:22:35,855 INFO L78 Accepts]: Start accepts. Automaton has 835 states and 1277 transitions. Word has length 152 [2025-03-03 14:22:35,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:35,856 INFO L471 AbstractCegarLoop]: Abstraction has 835 states and 1277 transitions. [2025-03-03 14:22:35,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 3 states have call successors, (20), 1 states have call predecessors, (20), 3 states have return successors, (18), 5 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-03 14:22:35,856 INFO L276 IsEmpty]: Start isEmpty. Operand 835 states and 1277 transitions. [2025-03-03 14:22:35,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-03 14:22:35,860 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:35,860 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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, 1, 1] [2025-03-03 14:22:35,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 14:22:35,860 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:35,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:35,861 INFO L85 PathProgramCache]: Analyzing trace with hash -50781974, now seen corresponding path program 1 times [2025-03-03 14:22:35,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:35,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468021115] [2025-03-03 14:22:35,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:35,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:35,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-03 14:22:35,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-03 14:22:35,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:35,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:35,960 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-03-03 14:22:35,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:35,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468021115] [2025-03-03 14:22:35,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468021115] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:22:35,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2058394754] [2025-03-03 14:22:35,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:35,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:22:35,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:22:35,963 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:22:35,965 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:22:36,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-03 14:22:36,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-03 14:22:36,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:36,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:36,229 INFO L256 TraceCheckSpWp]: Trace formula consists of 1155 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 14:22:36,232 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:22:36,261 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-03-03 14:22:36,261 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:22:36,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2058394754] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:36,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:22:36,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-03-03 14:22:36,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949748314] [2025-03-03 14:22:36,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:36,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:22:36,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:36,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:22:36,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:22:36,262 INFO L87 Difference]: Start difference. First operand 835 states and 1277 transitions. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 3 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-03 14:22:36,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:36,328 INFO L93 Difference]: Finished difference Result 1631 states and 2505 transitions. [2025-03-03 14:22:36,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:22:36,329 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 3 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 153 [2025-03-03 14:22:36,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:36,334 INFO L225 Difference]: With dead ends: 1631 [2025-03-03 14:22:36,335 INFO L226 Difference]: Without dead ends: 841 [2025-03-03 14:22:36,337 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:22:36,338 INFO L435 NwaCegarLoop]: 471 mSDtfsCounter, 1 mSDsluCounter, 1396 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1867 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:36,338 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1867 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:36,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 841 states. [2025-03-03 14:22:36,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 841 to 839. [2025-03-03 14:22:36,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 839 states, 630 states have (on average 1.5095238095238095) internal successors, (951), 647 states have internal predecessors, (951), 150 states have call successors, (150), 48 states have call predecessors, (150), 58 states have return successors, (184), 149 states have call predecessors, (184), 148 states have call successors, (184) [2025-03-03 14:22:36,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 1285 transitions. [2025-03-03 14:22:36,380 INFO L78 Accepts]: Start accepts. Automaton has 839 states and 1285 transitions. Word has length 153 [2025-03-03 14:22:36,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:36,381 INFO L471 AbstractCegarLoop]: Abstraction has 839 states and 1285 transitions. [2025-03-03 14:22:36,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 3 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-03 14:22:36,381 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 1285 transitions. [2025-03-03 14:22:36,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-03 14:22:36,385 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:36,385 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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, 1] [2025-03-03 14:22:36,393 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-03 14:22:36,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:22:36,586 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:36,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:36,586 INFO L85 PathProgramCache]: Analyzing trace with hash -932991149, now seen corresponding path program 2 times [2025-03-03 14:22:36,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:36,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382314427] [2025-03-03 14:22:36,586 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 14:22:36,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:36,607 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 154 statements into 2 equivalence classes. [2025-03-03 14:22:36,618 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 154 of 154 statements. [2025-03-03 14:22:36,620 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 14:22:36,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:36,699 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-03-03 14:22:36,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:36,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382314427] [2025-03-03 14:22:36,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382314427] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:22:36,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1311022742] [2025-03-03 14:22:36,700 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 14:22:36,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:22:36,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:22:36,702 INFO L229 MonitoredProcess]: Starting monitored process 9 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:22:36,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-03 14:22:36,851 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 154 statements into 2 equivalence classes. [2025-03-03 14:22:36,942 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 154 of 154 statements. [2025-03-03 14:22:36,942 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 14:22:36,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:36,947 INFO L256 TraceCheckSpWp]: Trace formula consists of 1153 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:22:36,951 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:22:36,974 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-03 14:22:36,975 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:22:37,061 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-03 14:22:37,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1311022742] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:22:37,062 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:22:37,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2025-03-03 14:22:37,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149707812] [2025-03-03 14:22:37,062 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:22:37,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 14:22:37,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:37,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 14:22:37,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:22:37,065 INFO L87 Difference]: Start difference. First operand 839 states and 1285 transitions. Second operand has 9 states, 9 states have (on average 16.11111111111111) internal successors, (145), 9 states have internal predecessors, (145), 3 states have call successors, (38), 2 states have call predecessors, (38), 3 states have return successors, (36), 3 states have call predecessors, (36), 3 states have call successors, (36) [2025-03-03 14:22:37,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:37,232 INFO L93 Difference]: Finished difference Result 1999 states and 3150 transitions. [2025-03-03 14:22:37,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 14:22:37,232 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 16.11111111111111) internal successors, (145), 9 states have internal predecessors, (145), 3 states have call successors, (38), 2 states have call predecessors, (38), 3 states have return successors, (36), 3 states have call predecessors, (36), 3 states have call successors, (36) Word has length 154 [2025-03-03 14:22:37,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:37,240 INFO L225 Difference]: With dead ends: 1999 [2025-03-03 14:22:37,240 INFO L226 Difference]: Without dead ends: 1356 [2025-03-03 14:22:37,242 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 304 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:22:37,243 INFO L435 NwaCegarLoop]: 496 mSDtfsCounter, 386 mSDsluCounter, 2628 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 3124 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:37,244 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [432 Valid, 3124 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:22:37,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1356 states. [2025-03-03 14:22:37,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1356 to 1308. [2025-03-03 14:22:37,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1308 states, 1004 states have (on average 1.5766932270916334) internal successors, (1583), 1013 states have internal predecessors, (1583), 249 states have call successors, (249), 47 states have call predecessors, (249), 54 states have return successors, (297), 253 states have call predecessors, (297), 247 states have call successors, (297) [2025-03-03 14:22:37,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1308 states to 1308 states and 2129 transitions. [2025-03-03 14:22:37,321 INFO L78 Accepts]: Start accepts. Automaton has 1308 states and 2129 transitions. Word has length 154 [2025-03-03 14:22:37,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:37,322 INFO L471 AbstractCegarLoop]: Abstraction has 1308 states and 2129 transitions. [2025-03-03 14:22:37,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 16.11111111111111) internal successors, (145), 9 states have internal predecessors, (145), 3 states have call successors, (38), 2 states have call predecessors, (38), 3 states have return successors, (36), 3 states have call predecessors, (36), 3 states have call successors, (36) [2025-03-03 14:22:37,322 INFO L276 IsEmpty]: Start isEmpty. Operand 1308 states and 2129 transitions. [2025-03-03 14:22:37,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-03 14:22:37,328 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:37,329 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:37,337 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-03 14:22:37,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-03 14:22:37,529 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:37,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:37,530 INFO L85 PathProgramCache]: Analyzing trace with hash 713845829, now seen corresponding path program 1 times [2025-03-03 14:22:37,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:37,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082152837] [2025-03-03 14:22:37,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:37,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:37,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-03 14:22:37,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-03 14:22:37,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:37,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:37,630 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-03 14:22:37,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:37,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082152837] [2025-03-03 14:22:37,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082152837] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:37,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:37,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:22:37,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997993701] [2025-03-03 14:22:37,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:37,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:22:37,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:37,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:22:37,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:22:37,633 INFO L87 Difference]: Start difference. First operand 1308 states and 2129 transitions. Second operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 3 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-03 14:22:37,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:37,694 INFO L93 Difference]: Finished difference Result 2591 states and 4236 transitions. [2025-03-03 14:22:37,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:22:37,694 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 3 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 160 [2025-03-03 14:22:37,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:37,702 INFO L225 Difference]: With dead ends: 2591 [2025-03-03 14:22:37,702 INFO L226 Difference]: Without dead ends: 1314 [2025-03-03 14:22:37,706 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:22:37,706 INFO L435 NwaCegarLoop]: 471 mSDtfsCounter, 0 mSDsluCounter, 1396 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1867 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:37,707 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1867 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:37,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1314 states. [2025-03-03 14:22:37,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1314 to 1308. [2025-03-03 14:22:37,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1308 states, 1004 states have (on average 1.5766932270916334) internal successors, (1583), 1013 states have internal predecessors, (1583), 249 states have call successors, (249), 47 states have call predecessors, (249), 54 states have return successors, (297), 253 states have call predecessors, (297), 247 states have call successors, (297) [2025-03-03 14:22:37,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1308 states to 1308 states and 2129 transitions. [2025-03-03 14:22:37,756 INFO L78 Accepts]: Start accepts. Automaton has 1308 states and 2129 transitions. Word has length 160 [2025-03-03 14:22:37,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:37,757 INFO L471 AbstractCegarLoop]: Abstraction has 1308 states and 2129 transitions. [2025-03-03 14:22:37,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 3 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-03 14:22:37,757 INFO L276 IsEmpty]: Start isEmpty. Operand 1308 states and 2129 transitions. [2025-03-03 14:22:37,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-03 14:22:37,762 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:37,763 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:37,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 14:22:37,763 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:37,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:37,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1267316250, now seen corresponding path program 1 times [2025-03-03 14:22:37,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:37,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555394472] [2025-03-03 14:22:37,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:37,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:37,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-03 14:22:37,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-03 14:22:37,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:37,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:37,811 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-03-03 14:22:37,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:37,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555394472] [2025-03-03 14:22:37,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555394472] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:37,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:37,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:22:37,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008842499] [2025-03-03 14:22:37,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:37,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:22:37,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:37,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:22:37,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:37,814 INFO L87 Difference]: Start difference. First operand 1308 states and 2129 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, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-03 14:22:37,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:37,857 INFO L93 Difference]: Finished difference Result 3047 states and 5034 transitions. [2025-03-03 14:22:37,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:22:37,858 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, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 160 [2025-03-03 14:22:37,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:37,869 INFO L225 Difference]: With dead ends: 3047 [2025-03-03 14:22:37,869 INFO L226 Difference]: Without dead ends: 1809 [2025-03-03 14:22:37,874 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:22:37,875 INFO L435 NwaCegarLoop]: 492 mSDtfsCounter, 97 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 969 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:22:37,876 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 969 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:37,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1809 states. [2025-03-03 14:22:37,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1809 to 1793. [2025-03-03 14:22:37,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1793 states, 1386 states have (on average 1.5923520923520924) internal successors, (2207), 1389 states have internal predecessors, (2207), 352 states have call successors, (352), 47 states have call predecessors, (352), 54 states have return successors, (423), 362 states have call predecessors, (423), 350 states have call successors, (423) [2025-03-03 14:22:37,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1793 states to 1793 states and 2982 transitions. [2025-03-03 14:22:37,964 INFO L78 Accepts]: Start accepts. Automaton has 1793 states and 2982 transitions. Word has length 160 [2025-03-03 14:22:37,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:37,964 INFO L471 AbstractCegarLoop]: Abstraction has 1793 states and 2982 transitions. [2025-03-03 14:22:37,964 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, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-03 14:22:37,964 INFO L276 IsEmpty]: Start isEmpty. Operand 1793 states and 2982 transitions. [2025-03-03 14:22:37,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-03 14:22:37,974 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:37,974 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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, 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:22:37,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 14:22:37,975 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:37,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:37,975 INFO L85 PathProgramCache]: Analyzing trace with hash 664212092, now seen corresponding path program 1 times [2025-03-03 14:22:37,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:37,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299760096] [2025-03-03 14:22:37,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:37,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:37,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-03 14:22:37,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-03 14:22:37,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:37,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:38,029 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-03-03 14:22:38,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:38,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299760096] [2025-03-03 14:22:38,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299760096] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:38,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:38,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:22:38,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711629058] [2025-03-03 14:22:38,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:38,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:22:38,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:38,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:22:38,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:38,033 INFO L87 Difference]: Start difference. First operand 1793 states and 2982 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, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-03 14:22:38,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:38,090 INFO L93 Difference]: Finished difference Result 4397 states and 7395 transitions. [2025-03-03 14:22:38,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:22:38,091 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, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 161 [2025-03-03 14:22:38,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:38,104 INFO L225 Difference]: With dead ends: 4397 [2025-03-03 14:22:38,104 INFO L226 Difference]: Without dead ends: 2729 [2025-03-03 14:22:38,110 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:22:38,111 INFO L435 NwaCegarLoop]: 487 mSDtfsCounter, 95 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 962 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:22:38,111 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 962 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:38,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2729 states. [2025-03-03 14:22:38,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2729 to 2713. [2025-03-03 14:22:38,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2713 states, 2116 states have (on average 1.6110586011342154) internal successors, (3409), 2119 states have internal predecessors, (3409), 542 states have call successors, (542), 47 states have call predecessors, (542), 54 states have return successors, (629), 552 states have call predecessors, (629), 540 states have call successors, (629) [2025-03-03 14:22:38,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2713 states to 2713 states and 4580 transitions. [2025-03-03 14:22:38,218 INFO L78 Accepts]: Start accepts. Automaton has 2713 states and 4580 transitions. Word has length 161 [2025-03-03 14:22:38,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:38,219 INFO L471 AbstractCegarLoop]: Abstraction has 2713 states and 4580 transitions. [2025-03-03 14:22:38,219 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, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-03 14:22:38,219 INFO L276 IsEmpty]: Start isEmpty. Operand 2713 states and 4580 transitions. [2025-03-03 14:22:38,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-03 14:22:38,231 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:38,231 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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, 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:22:38,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 14:22:38,231 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:38,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:38,232 INFO L85 PathProgramCache]: Analyzing trace with hash -950636409, now seen corresponding path program 1 times [2025-03-03 14:22:38,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:38,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899715783] [2025-03-03 14:22:38,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:38,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:38,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-03 14:22:38,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-03 14:22:38,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:38,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:38,286 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-03-03 14:22:38,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:38,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899715783] [2025-03-03 14:22:38,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899715783] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:38,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:38,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:22:38,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215287795] [2025-03-03 14:22:38,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:38,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:22:38,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:38,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:22:38,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:38,287 INFO L87 Difference]: Start difference. First operand 2713 states and 4580 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, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-03 14:22:38,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:38,387 INFO L93 Difference]: Finished difference Result 6326 states and 10779 transitions. [2025-03-03 14:22:38,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:22:38,387 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, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 162 [2025-03-03 14:22:38,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:38,405 INFO L225 Difference]: With dead ends: 6326 [2025-03-03 14:22:38,406 INFO L226 Difference]: Without dead ends: 3954 [2025-03-03 14:22:38,414 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:22:38,415 INFO L435 NwaCegarLoop]: 480 mSDtfsCounter, 93 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 951 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:22:38,415 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 951 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:38,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3954 states. [2025-03-03 14:22:38,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3954 to 3938. [2025-03-03 14:22:38,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3938 states, 3125 states have (on average 1.62048) internal successors, (5064), 3119 states have internal predecessors, (5064), 758 states have call successors, (758), 47 states have call predecessors, (758), 54 states have return successors, (892), 777 states have call predecessors, (892), 756 states have call successors, (892) [2025-03-03 14:22:38,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3938 states to 3938 states and 6714 transitions. [2025-03-03 14:22:38,563 INFO L78 Accepts]: Start accepts. Automaton has 3938 states and 6714 transitions. Word has length 162 [2025-03-03 14:22:38,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:38,563 INFO L471 AbstractCegarLoop]: Abstraction has 3938 states and 6714 transitions. [2025-03-03 14:22:38,563 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, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-03 14:22:38,563 INFO L276 IsEmpty]: Start isEmpty. Operand 3938 states and 6714 transitions. [2025-03-03 14:22:38,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-03 14:22:38,581 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:38,581 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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, 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:22:38,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 14:22:38,581 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:38,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:38,582 INFO L85 PathProgramCache]: Analyzing trace with hash 525091387, now seen corresponding path program 1 times [2025-03-03 14:22:38,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:38,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909410867] [2025-03-03 14:22:38,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:38,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:38,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-03 14:22:38,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-03 14:22:38,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:38,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:38,631 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-03-03 14:22:38,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:38,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909410867] [2025-03-03 14:22:38,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909410867] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:38,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:38,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:22:38,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139638089] [2025-03-03 14:22:38,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:38,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:22:38,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:38,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:22:38,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:38,632 INFO L87 Difference]: Start difference. First operand 3938 states and 6714 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, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-03 14:22:38,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:38,804 INFO L93 Difference]: Finished difference Result 9260 states and 15933 transitions. [2025-03-03 14:22:38,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:22:38,805 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, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 163 [2025-03-03 14:22:38,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:38,844 INFO L225 Difference]: With dead ends: 9260 [2025-03-03 14:22:38,845 INFO L226 Difference]: Without dead ends: 5932 [2025-03-03 14:22:38,861 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:22:38,862 INFO L435 NwaCegarLoop]: 480 mSDtfsCounter, 91 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 951 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:22:38,862 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 951 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:38,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5932 states. [2025-03-03 14:22:39,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5932 to 5916. [2025-03-03 14:22:39,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5916 states, 4783 states have (on average 1.6284758519757474) internal successors, (7789), 4765 states have internal predecessors, (7789), 1078 states have call successors, (1078), 47 states have call predecessors, (1078), 54 states have return successors, (1291), 1109 states have call predecessors, (1291), 1076 states have call successors, (1291) [2025-03-03 14:22:39,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5916 states to 5916 states and 10158 transitions. [2025-03-03 14:22:39,134 INFO L78 Accepts]: Start accepts. Automaton has 5916 states and 10158 transitions. Word has length 163 [2025-03-03 14:22:39,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:39,134 INFO L471 AbstractCegarLoop]: Abstraction has 5916 states and 10158 transitions. [2025-03-03 14:22:39,135 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, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-03 14:22:39,135 INFO L276 IsEmpty]: Start isEmpty. Operand 5916 states and 10158 transitions. [2025-03-03 14:22:39,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-03 14:22:39,160 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:39,160 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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, 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:22:39,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 14:22:39,161 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:39,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:39,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1610186232, now seen corresponding path program 1 times [2025-03-03 14:22:39,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:39,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122062469] [2025-03-03 14:22:39,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:39,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:39,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-03 14:22:39,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-03 14:22:39,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:39,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:39,211 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-03-03 14:22:39,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:39,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122062469] [2025-03-03 14:22:39,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122062469] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:39,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:39,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:22:39,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217716891] [2025-03-03 14:22:39,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:39,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:22:39,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:39,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:22:39,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:39,214 INFO L87 Difference]: Start difference. First operand 5916 states and 10158 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, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-03 14:22:39,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:39,372 INFO L93 Difference]: Finished difference Result 14632 states and 25305 transitions. [2025-03-03 14:22:39,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:22:39,373 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, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 164 [2025-03-03 14:22:39,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:39,408 INFO L225 Difference]: With dead ends: 14632 [2025-03-03 14:22:39,408 INFO L226 Difference]: Without dead ends: 9614 [2025-03-03 14:22:39,426 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:22:39,427 INFO L435 NwaCegarLoop]: 495 mSDtfsCounter, 89 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 973 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:22:39,427 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 973 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:39,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9614 states. [2025-03-03 14:22:39,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9614 to 9598. [2025-03-03 14:22:39,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9598 states, 7774 states have (on average 1.6250321584769745) internal successors, (12633), 7741 states have internal predecessors, (12633), 1769 states have call successors, (1769), 47 states have call predecessors, (1769), 54 states have return successors, (2121), 1815 states have call predecessors, (2121), 1767 states have call successors, (2121) [2025-03-03 14:22:39,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9598 states to 9598 states and 16523 transitions. [2025-03-03 14:22:39,780 INFO L78 Accepts]: Start accepts. Automaton has 9598 states and 16523 transitions. Word has length 164 [2025-03-03 14:22:39,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:39,780 INFO L471 AbstractCegarLoop]: Abstraction has 9598 states and 16523 transitions. [2025-03-03 14:22:39,780 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, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-03 14:22:39,781 INFO L276 IsEmpty]: Start isEmpty. Operand 9598 states and 16523 transitions. [2025-03-03 14:22:39,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-03 14:22:39,814 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:39,814 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 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:22:39,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 14:22:39,814 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:39,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:39,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1733963078, now seen corresponding path program 1 times [2025-03-03 14:22:39,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:39,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870626058] [2025-03-03 14:22:39,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:39,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:39,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-03 14:22:39,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-03 14:22:39,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:39,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:39,885 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-03-03 14:22:39,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:39,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870626058] [2025-03-03 14:22:39,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870626058] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:39,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:39,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:22:39,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870698819] [2025-03-03 14:22:39,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:39,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:22:39,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:39,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:22:39,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:39,887 INFO L87 Difference]: Start difference. First operand 9598 states and 16523 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, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-03 14:22:40,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:40,211 INFO L93 Difference]: Finished difference Result 24674 states and 42720 transitions. [2025-03-03 14:22:40,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:22:40,211 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, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 165 [2025-03-03 14:22:40,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:40,269 INFO L225 Difference]: With dead ends: 24674 [2025-03-03 14:22:40,269 INFO L226 Difference]: Without dead ends: 16446 [2025-03-03 14:22:40,299 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:22:40,302 INFO L435 NwaCegarLoop]: 484 mSDtfsCounter, 87 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 958 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:22:40,302 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 958 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:40,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16446 states. [2025-03-03 14:22:40,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16446 to 16430. [2025-03-03 14:22:40,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16430 states, 13394 states have (on average 1.6255786172913245) internal successors, (21773), 13361 states have internal predecessors, (21773), 2981 states have call successors, (2981), 47 states have call predecessors, (2981), 54 states have return successors, (3522), 3027 states have call predecessors, (3522), 2979 states have call successors, (3522) [2025-03-03 14:22:41,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16430 states to 16430 states and 28276 transitions. [2025-03-03 14:22:41,086 INFO L78 Accepts]: Start accepts. Automaton has 16430 states and 28276 transitions. Word has length 165 [2025-03-03 14:22:41,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:41,086 INFO L471 AbstractCegarLoop]: Abstraction has 16430 states and 28276 transitions. [2025-03-03 14:22:41,086 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, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-03 14:22:41,086 INFO L276 IsEmpty]: Start isEmpty. Operand 16430 states and 28276 transitions. [2025-03-03 14:22:41,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-03 14:22:41,133 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:41,134 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1, 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:22:41,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 14:22:41,134 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:41,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:41,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1343242217, now seen corresponding path program 1 times [2025-03-03 14:22:41,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:41,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138020184] [2025-03-03 14:22:41,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:41,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:41,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-03 14:22:41,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-03 14:22:41,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:41,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:41,179 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-03-03 14:22:41,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:41,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138020184] [2025-03-03 14:22:41,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138020184] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:41,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:41,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:22:41,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346328767] [2025-03-03 14:22:41,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:41,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:22:41,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:41,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:22:41,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:41,180 INFO L87 Difference]: Start difference. First operand 16430 states and 28276 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, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-03 14:22:41,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:41,663 INFO L93 Difference]: Finished difference Result 43245 states and 74792 transitions. [2025-03-03 14:22:41,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:22:41,664 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, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 166 [2025-03-03 14:22:41,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:41,774 INFO L225 Difference]: With dead ends: 43245 [2025-03-03 14:22:41,774 INFO L226 Difference]: Without dead ends: 28983 [2025-03-03 14:22:41,807 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:22:41,809 INFO L435 NwaCegarLoop]: 487 mSDtfsCounter, 85 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 964 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:22:41,809 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 964 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:41,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28983 states. [2025-03-03 14:22:42,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28983 to 28967. [2025-03-03 14:22:42,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28967 states, 23600 states have (on average 1.6175) internal successors, (38173), 23549 states have internal predecessors, (38173), 5312 states have call successors, (5312), 47 states have call predecessors, (5312), 54 states have return successors, (6272), 5376 states have call predecessors, (6272), 5310 states have call successors, (6272) [2025-03-03 14:22:42,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28967 states to 28967 states and 49757 transitions. [2025-03-03 14:22:42,723 INFO L78 Accepts]: Start accepts. Automaton has 28967 states and 49757 transitions. Word has length 166 [2025-03-03 14:22:42,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:42,724 INFO L471 AbstractCegarLoop]: Abstraction has 28967 states and 49757 transitions. [2025-03-03 14:22:42,724 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, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-03 14:22:42,724 INFO L276 IsEmpty]: Start isEmpty. Operand 28967 states and 49757 transitions. [2025-03-03 14:22:42,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-03 14:22:42,913 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:42,913 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1, 1, 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:22:42,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 14:22:42,914 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:42,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:42,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1615489657, now seen corresponding path program 1 times [2025-03-03 14:22:42,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:42,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831898984] [2025-03-03 14:22:42,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:42,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:42,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-03 14:22:42,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-03 14:22:42,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:42,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:42,976 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-03-03 14:22:42,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:42,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831898984] [2025-03-03 14:22:42,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831898984] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:42,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:42,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:22:42,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376814510] [2025-03-03 14:22:42,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:42,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:22:42,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:42,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:22:42,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:42,979 INFO L87 Difference]: Start difference. First operand 28967 states and 49757 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, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-03 14:22:44,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:44,172 INFO L93 Difference]: Finished difference Result 77953 states and 134617 transitions. [2025-03-03 14:22:44,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:22:44,173 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, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 167 [2025-03-03 14:22:44,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:44,389 INFO L225 Difference]: With dead ends: 77953 [2025-03-03 14:22:44,389 INFO L226 Difference]: Without dead ends: 51955 [2025-03-03 14:22:44,458 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:22:44,460 INFO L435 NwaCegarLoop]: 480 mSDtfsCounter, 83 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 954 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:22:44,460 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 954 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:44,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51955 states. [2025-03-03 14:22:45,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51955 to 51939. [2025-03-03 14:22:45,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51939 states, 42576 states have (on average 1.614195791055994) internal successors, (68726), 42504 states have internal predecessors, (68726), 9308 states have call successors, (9308), 47 states have call predecessors, (9308), 54 states have return successors, (11075), 9393 states have call predecessors, (11075), 9306 states have call successors, (11075) [2025-03-03 14:22:46,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51939 states to 51939 states and 89109 transitions. [2025-03-03 14:22:46,329 INFO L78 Accepts]: Start accepts. Automaton has 51939 states and 89109 transitions. Word has length 167 [2025-03-03 14:22:46,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:46,330 INFO L471 AbstractCegarLoop]: Abstraction has 51939 states and 89109 transitions. [2025-03-03 14:22:46,330 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, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-03 14:22:46,330 INFO L276 IsEmpty]: Start isEmpty. Operand 51939 states and 89109 transitions. [2025-03-03 14:22:46,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-03 14:22:46,468 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:46,468 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1, 1, 1, 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:22:46,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 14:22:46,468 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:46,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:46,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1785558358, now seen corresponding path program 1 times [2025-03-03 14:22:46,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:46,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231108919] [2025-03-03 14:22:46,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:46,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:46,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-03 14:22:46,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-03 14:22:46,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:46,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:46,515 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-03-03 14:22:46,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:46,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231108919] [2025-03-03 14:22:46,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231108919] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:46,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:46,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:22:46,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202715472] [2025-03-03 14:22:46,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:46,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:22:46,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:46,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:22:46,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:46,517 INFO L87 Difference]: Start difference. First operand 51939 states and 89109 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, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-03 14:22:48,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:48,387 INFO L93 Difference]: Finished difference Result 143431 states and 246578 transitions. [2025-03-03 14:22:48,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:22:48,387 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, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 168 [2025-03-03 14:22:48,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:48,755 INFO L225 Difference]: With dead ends: 143431 [2025-03-03 14:22:48,755 INFO L226 Difference]: Without dead ends: 95934 [2025-03-03 14:22:48,885 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:22:48,886 INFO L435 NwaCegarLoop]: 481 mSDtfsCounter, 81 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 955 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:22:48,886 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 955 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:48,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95934 states. [2025-03-03 14:22:52,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95934 to 95918. [2025-03-03 14:22:52,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95918 states, 79131 states have (on average 1.6084973019423487) internal successors, (127282), 79059 states have internal predecessors, (127282), 16732 states have call successors, (16732), 47 states have call predecessors, (16732), 54 states have return successors, (19563), 16817 states have call predecessors, (19563), 16730 states have call successors, (19563) [2025-03-03 14:22:52,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95918 states to 95918 states and 163577 transitions. [2025-03-03 14:22:52,658 INFO L78 Accepts]: Start accepts. Automaton has 95918 states and 163577 transitions. Word has length 168 [2025-03-03 14:22:52,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:52,659 INFO L471 AbstractCegarLoop]: Abstraction has 95918 states and 163577 transitions. [2025-03-03 14:22:52,659 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, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-03 14:22:52,659 INFO L276 IsEmpty]: Start isEmpty. Operand 95918 states and 163577 transitions. [2025-03-03 14:22:52,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-03 14:22:52,907 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:52,907 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 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:22:52,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-03 14:22:52,908 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:52,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:52,908 INFO L85 PathProgramCache]: Analyzing trace with hash -2077341288, now seen corresponding path program 1 times [2025-03-03 14:22:52,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:52,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888266790] [2025-03-03 14:22:52,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:52,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:52,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-03 14:22:52,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-03 14:22:52,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:52,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:52,957 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-03-03 14:22:52,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:52,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888266790] [2025-03-03 14:22:52,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888266790] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:52,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:52,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:22:52,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061394257] [2025-03-03 14:22:52,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:52,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:22:52,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:52,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:22:52,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:52,959 INFO L87 Difference]: Start difference. First operand 95918 states and 163577 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-03 14:22:56,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:56,688 INFO L93 Difference]: Finished difference Result 179385 states and 306721 transitions. [2025-03-03 14:22:56,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:22:56,688 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 169 [2025-03-03 14:22:56,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:57,571 INFO L225 Difference]: With dead ends: 179385 [2025-03-03 14:22:57,571 INFO L226 Difference]: Without dead ends: 178943 [2025-03-03 14:22:57,643 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:22:57,644 INFO L435 NwaCegarLoop]: 489 mSDtfsCounter, 76 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 968 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:22:57,644 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 968 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:57,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178943 states. [2025-03-03 14:23:02,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178943 to 178927. [2025-03-03 14:23:03,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178927 states, 148645 states have (on average 1.6013051229439268) internal successors, (238026), 148549 states have internal predecessors, (238026), 30227 states have call successors, (30227), 47 states have call predecessors, (30227), 54 states have return successors, (35665), 30336 states have call predecessors, (35665), 30225 states have call successors, (35665) [2025-03-03 14:23:03,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178927 states to 178927 states and 303918 transitions. [2025-03-03 14:23:04,012 INFO L78 Accepts]: Start accepts. Automaton has 178927 states and 303918 transitions. Word has length 169 [2025-03-03 14:23:04,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:23:04,013 INFO L471 AbstractCegarLoop]: Abstraction has 178927 states and 303918 transitions. [2025-03-03 14:23:04,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-03 14:23:04,013 INFO L276 IsEmpty]: Start isEmpty. Operand 178927 states and 303918 transitions. [2025-03-03 14:23:04,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-03 14:23:04,378 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:23:04,378 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 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:23:04,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-03 14:23:04,379 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:23:04,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:23:04,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1736887723, now seen corresponding path program 1 times [2025-03-03 14:23:04,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:23:04,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291963320] [2025-03-03 14:23:04,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:04,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:23:04,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-03 14:23:04,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-03 14:23:04,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:04,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:04,985 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-03 14:23:04,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:23:04,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291963320] [2025-03-03 14:23:04,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291963320] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:23:04,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1584917494] [2025-03-03 14:23:04,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:04,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:23:04,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:23:04,989 INFO L229 MonitoredProcess]: Starting monitored process 10 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:23:04,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-03 14:23:05,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-03 14:23:05,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-03 14:23:05,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:05,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:05,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 1210 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-03 14:23:05,274 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:23:05,459 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-03 14:23:05,459 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:23:05,861 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-03 14:23:05,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1584917494] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:23:05,862 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:23:05,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 9] total 27 [2025-03-03 14:23:05,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553102897] [2025-03-03 14:23:05,862 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:23:05,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-03 14:23:05,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:23:05,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-03 14:23:05,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=636, Unknown=0, NotChecked=0, Total=702 [2025-03-03 14:23:05,864 INFO L87 Difference]: Start difference. First operand 178927 states and 303918 transitions. Second operand has 27 states, 26 states have (on average 10.26923076923077) internal successors, (267), 23 states have internal predecessors, (267), 9 states have call successors, (50), 8 states have call predecessors, (50), 11 states have return successors, (45), 11 states have call predecessors, (45), 9 states have call successors, (45) [2025-03-03 14:23:17,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:23:17,180 INFO L93 Difference]: Finished difference Result 357371 states and 626202 transitions. [2025-03-03 14:23:17,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2025-03-03 14:23:17,180 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 10.26923076923077) internal successors, (267), 23 states have internal predecessors, (267), 9 states have call successors, (50), 8 states have call predecessors, (50), 11 states have return successors, (45), 11 states have call predecessors, (45), 9 states have call successors, (45) Word has length 170 [2025-03-03 14:23:17,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:23:18,724 INFO L225 Difference]: With dead ends: 357371 [2025-03-03 14:23:18,724 INFO L226 Difference]: Without dead ends: 356943 [2025-03-03 14:23:18,898 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 445 GetRequests, 347 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2617 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1172, Invalid=8728, Unknown=0, NotChecked=0, Total=9900 [2025-03-03 14:23:18,899 INFO L435 NwaCegarLoop]: 225 mSDtfsCounter, 5917 mSDsluCounter, 4598 mSDsCounter, 0 mSdLazyCounter, 9622 mSolverCounterSat, 1714 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5964 SdHoareTripleChecker+Valid, 4823 SdHoareTripleChecker+Invalid, 11336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1714 IncrementalHoareTripleChecker+Valid, 9622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2025-03-03 14:23:18,899 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5964 Valid, 4823 Invalid, 11336 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1714 Valid, 9622 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2025-03-03 14:23:19,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356943 states.