./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec7_product30.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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_spec7_product30.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 f0b632d57a1aaab7587941b987ac776406d0d2705d0d18f7c4a153447ae1ce66 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 05:35:59,411 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 05:35:59,464 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 05:35:59,467 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 05:35:59,467 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 05:35:59,480 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 05:35:59,481 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 05:35:59,481 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 05:35:59,481 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 05:35:59,481 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 05:35:59,481 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 05:35:59,481 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 05:35:59,481 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 05:35:59,481 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 05:35:59,481 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 05:35:59,481 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 05:35:59,481 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 05:35:59,481 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 05:35:59,481 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 05:35:59,482 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 05:35:59,482 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 05:35:59,482 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 05:35:59,482 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 05:35:59,482 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 05:35:59,482 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 05:35:59,482 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 05:35:59,482 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 05:35:59,482 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 05:35:59,482 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 05:35:59,482 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 05:35:59,482 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 05:35:59,482 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 05:35:59,482 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:35:59,482 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 05:35:59,482 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 05:35:59,482 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 05:35:59,482 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 05:35:59,482 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 05:35:59,482 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 05:35:59,483 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 05:35:59,483 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 05:35:59,483 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 05:35:59,483 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 05:35:59,483 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 -> f0b632d57a1aaab7587941b987ac776406d0d2705d0d18f7c4a153447ae1ce66 [2025-03-08 05:35:59,726 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 05:35:59,731 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 05:35:59,735 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 05:35:59,736 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 05:35:59,736 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 05:35:59,738 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec7_product30.cil.c [2025-03-08 05:36:00,917 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd75749c8/a7943bbcde214c64a4df5b475c0869db/FLAGdcbb4da9b [2025-03-08 05:36:01,262 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 05:36:01,263 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec7_product30.cil.c [2025-03-08 05:36:01,289 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd75749c8/a7943bbcde214c64a4df5b475c0869db/FLAGdcbb4da9b [2025-03-08 05:36:01,479 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd75749c8/a7943bbcde214c64a4df5b475c0869db [2025-03-08 05:36:01,480 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 05:36:01,482 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 05:36:01,483 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 05:36:01,484 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 05:36:01,486 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 05:36:01,487 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:36:01" (1/1) ... [2025-03-08 05:36:01,487 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7eb786ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:36:01, skipping insertion in model container [2025-03-08 05:36:01,488 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:36:01" (1/1) ... [2025-03-08 05:36:01,526 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 05:36:01,842 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_spec7_product30.cil.c[50838,50851] [2025-03-08 05:36:01,902 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:36:01,916 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 05:36:01,922 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [48] [2025-03-08 05:36:01,923 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [414] [2025-03-08 05:36:01,923 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [639] [2025-03-08 05:36:01,923 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EncryptVerify_spec.i","") [1051] [2025-03-08 05:36:01,924 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [1082] [2025-03-08 05:36:01,924 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [1100] [2025-03-08 05:36:01,924 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [2180] [2025-03-08 05:36:01,924 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [2189] [2025-03-08 05:36:01,925 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [2227] [2025-03-08 05:36:01,925 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [2587] [2025-03-08 05:36:01,925 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [2723] [2025-03-08 05:36:01,987 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_spec7_product30.cil.c[50838,50851] [2025-03-08 05:36:02,004 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:36:02,025 INFO L204 MainTranslator]: Completed translation [2025-03-08 05:36:02,026 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:36:02 WrapperNode [2025-03-08 05:36:02,026 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 05:36:02,027 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 05:36:02,027 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 05:36:02,027 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 05:36:02,032 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:36:02" (1/1) ... [2025-03-08 05:36:02,047 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:36:02" (1/1) ... [2025-03-08 05:36:02,073 INFO L138 Inliner]: procedures = 131, calls = 203, calls flagged for inlining = 60, calls inlined = 50, statements flattened = 897 [2025-03-08 05:36:02,073 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 05:36:02,074 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 05:36:02,074 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 05:36:02,074 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 05:36:02,084 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:36:02" (1/1) ... [2025-03-08 05:36:02,084 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:36:02" (1/1) ... [2025-03-08 05:36:02,088 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:36:02" (1/1) ... [2025-03-08 05:36:02,104 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-08 05:36:02,104 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:36:02" (1/1) ... [2025-03-08 05:36:02,104 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:36:02" (1/1) ... [2025-03-08 05:36:02,115 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:36:02" (1/1) ... [2025-03-08 05:36:02,117 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:36:02" (1/1) ... [2025-03-08 05:36:02,119 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:36:02" (1/1) ... [2025-03-08 05:36:02,124 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:36:02" (1/1) ... [2025-03-08 05:36:02,128 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 05:36:02,129 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 05:36:02,129 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 05:36:02,129 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 05:36:02,130 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:36:02" (1/1) ... [2025-03-08 05:36:02,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:36:02,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:36:02,157 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-08 05:36:02,161 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-08 05:36:02,182 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2025-03-08 05:36:02,183 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2025-03-08 05:36:02,183 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2025-03-08 05:36:02,183 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2025-03-08 05:36:02,183 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2025-03-08 05:36:02,183 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2025-03-08 05:36:02,183 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-03-08 05:36:02,184 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-03-08 05:36:02,184 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-03-08 05:36:02,184 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-03-08 05:36:02,184 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2025-03-08 05:36:02,184 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2025-03-08 05:36:02,184 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-03-08 05:36:02,185 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-03-08 05:36:02,185 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2025-03-08 05:36:02,185 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2025-03-08 05:36:02,185 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2025-03-08 05:36:02,186 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2025-03-08 05:36:02,186 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-03-08 05:36:02,186 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-03-08 05:36:02,186 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-03-08 05:36:02,186 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-03-08 05:36:02,186 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-03-08 05:36:02,187 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-03-08 05:36:02,188 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 05:36:02,188 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2025-03-08 05:36:02,188 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2025-03-08 05:36:02,188 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2025-03-08 05:36:02,188 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2025-03-08 05:36:02,188 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-03-08 05:36:02,188 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-03-08 05:36:02,188 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-03-08 05:36:02,188 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-03-08 05:36:02,188 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-03-08 05:36:02,188 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-03-08 05:36:02,188 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2025-03-08 05:36:02,188 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2025-03-08 05:36:02,188 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-03-08 05:36:02,188 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-03-08 05:36:02,188 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2025-03-08 05:36:02,188 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2025-03-08 05:36:02,189 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-03-08 05:36:02,189 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-03-08 05:36:02,189 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-03-08 05:36:02,189 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-03-08 05:36:02,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 05:36:02,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 05:36:02,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 05:36:02,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 05:36:02,189 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-03-08 05:36:02,189 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-03-08 05:36:02,189 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 05:36:02,189 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 05:36:02,341 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 05:36:02,343 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 05:36:02,529 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1675-1: getClientAutoResponse_#res#1 := getClientAutoResponse_~retValue_acc~23#1; [2025-03-08 05:36:02,529 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2157-1: getClientId_#res#1 := getClientId_~retValue_acc~31#1; [2025-03-08 05:36:02,536 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L958: #res := ~retValue_acc~11; [2025-03-08 05:36:02,550 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2487: #res := ~retValue_acc~38; [2025-03-08 05:36:02,569 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1814: #res#1 := ~retValue_acc~26#1; [2025-03-08 05:36:02,570 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1769-1: getClientKeyringSize_#res#1 := getClientKeyringSize_~retValue_acc~25#1; [2025-03-08 05:36:02,585 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2038: #res := ~retValue_acc~29; [2025-03-08 05:36:02,592 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1722: #res := ~retValue_acc~24; [2025-03-08 05:36:02,602 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2720-1: createEmail_#res#1 := createEmail_~retValue_acc~42#1; [2025-03-08 05:36:02,614 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L884: #res := ~retValue_acc~9; [2025-03-08 05:36:02,625 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L921: #res := ~retValue_acc~10; [2025-03-08 05:36:02,630 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L995: #res := ~retValue_acc~12; [2025-03-08 05:36:02,649 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L769: #res := ~retValue_acc~6; [2025-03-08 05:36:02,845 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1984-1: getClientKeyringPublicKey_#res#1 := getClientKeyringPublicKey_~retValue_acc~28#1; [2025-03-08 05:36:02,845 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1877-1: getClientKeyringUser_#res#1 := getClientKeyringUser_~retValue_acc~27#1; [2025-03-08 05:36:02,845 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2224-1: valid_product_#res#1 := valid_product_~retValue_acc~33#1; [2025-03-08 05:36:02,846 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2444-1: is_queue_empty_#res#1 := is_queue_empty_~retValue_acc~35#1; [2025-03-08 05:36:02,846 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2453-1: get_queued_client_#res#1 := get_queued_client_~retValue_acc~36#1; [2025-03-08 05:36:02,846 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2462-1: get_queued_email_#res#1 := get_queued_email_~retValue_acc~37#1; [2025-03-08 05:36:02,850 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L732: #res := ~retValue_acc~5; [2025-03-08 05:36:02,857 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2696: #res#1 := ~retValue_acc~40#1; [2025-03-08 05:36:02,857 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2676-1: isReadable__wrappee__Keys_#res#1 := isReadable__wrappee__Keys_~retValue_acc~39#1; [2025-03-08 05:36:02,970 INFO L? ?]: Removed 426 outVars from TransFormulas that were not future-live. [2025-03-08 05:36:02,970 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 05:36:02,984 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 05:36:02,985 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 05:36:02,985 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:36:02 BoogieIcfgContainer [2025-03-08 05:36:02,985 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 05:36:02,987 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 05:36:02,987 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 05:36:02,990 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 05:36:02,991 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:36:01" (1/3) ... [2025-03-08 05:36:02,991 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@345be6ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:36:02, skipping insertion in model container [2025-03-08 05:36:02,991 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:36:02" (2/3) ... [2025-03-08 05:36:02,991 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@345be6ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:36:02, skipping insertion in model container [2025-03-08 05:36:02,992 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:36:02" (3/3) ... [2025-03-08 05:36:02,992 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec7_product30.cil.c [2025-03-08 05:36:03,003 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 05:36:03,007 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec7_product30.cil.c that has 24 procedures, 342 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 05:36:03,058 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 05:36:03,065 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;@732f2e1a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 05:36:03,065 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 05:36:03,069 INFO L276 IsEmpty]: Start isEmpty. Operand has 342 states, 265 states have (on average 1.5169811320754718) internal successors, (402), 269 states have internal predecessors, (402), 52 states have call successors, (52), 23 states have call predecessors, (52), 23 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-08 05:36:03,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-08 05:36:03,083 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:36:03,084 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2025-03-08 05:36:03,084 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:36:03,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:36:03,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1660378400, now seen corresponding path program 1 times [2025-03-08 05:36:03,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:36:03,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453544695] [2025-03-08 05:36:03,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:36:03,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:36:03,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-08 05:36:03,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-08 05:36:03,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:36:03,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:36:03,672 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:36:03,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:36:03,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453544695] [2025-03-08 05:36:03,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453544695] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:36:03,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [647671086] [2025-03-08 05:36:03,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:36:03,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:36:03,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:36:03,676 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-08 05:36:03,678 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-08 05:36:03,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-08 05:36:03,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-08 05:36:03,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:36:03,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:36:03,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 1084 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 05:36:03,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:36:03,981 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-08 05:36:03,981 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:36:03,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [647671086] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:36:03,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:36:03,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-08 05:36:03,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086945689] [2025-03-08 05:36:03,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:36:03,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:36:03,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:36:04,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:36:04,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:36:04,011 INFO L87 Difference]: Start difference. First operand has 342 states, 265 states have (on average 1.5169811320754718) internal successors, (402), 269 states have internal predecessors, (402), 52 states have call successors, (52), 23 states have call predecessors, (52), 23 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 05:36:04,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:36:04,064 INFO L93 Difference]: Finished difference Result 533 states and 772 transitions. [2025-03-08 05:36:04,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:36:04,065 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 120 [2025-03-08 05:36:04,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:36:04,074 INFO L225 Difference]: With dead ends: 533 [2025-03-08 05:36:04,074 INFO L226 Difference]: Without dead ends: 336 [2025-03-08 05:36:04,078 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 120 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-08 05:36:04,082 INFO L435 NwaCegarLoop]: 502 mSDtfsCounter, 0 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1001 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-08 05:36:04,082 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1001 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:36:04,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2025-03-08 05:36:04,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 336. [2025-03-08 05:36:04,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 260 states have (on average 1.5115384615384615) internal successors, (393), 263 states have internal predecessors, (393), 52 states have call successors, (52), 23 states have call predecessors, (52), 23 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2025-03-08 05:36:04,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 496 transitions. [2025-03-08 05:36:04,131 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 496 transitions. Word has length 120 [2025-03-08 05:36:04,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:36:04,132 INFO L471 AbstractCegarLoop]: Abstraction has 336 states and 496 transitions. [2025-03-08 05:36:04,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 05:36:04,132 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 496 transitions. [2025-03-08 05:36:04,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-08 05:36:04,135 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:36:04,135 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:36:04,144 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 05:36:04,336 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-08 05:36:04,336 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:36:04,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:36:04,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1140113059, now seen corresponding path program 1 times [2025-03-08 05:36:04,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:36:04,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304819644] [2025-03-08 05:36:04,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:36:04,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:36:04,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-08 05:36:04,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-08 05:36:04,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:36:04,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:36:04,586 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-08 05:36:04,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:36:04,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304819644] [2025-03-08 05:36:04,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304819644] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:36:04,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [857085236] [2025-03-08 05:36:04,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:36:04,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:36:04,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:36:04,590 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-08 05:36:04,592 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-08 05:36:04,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-08 05:36:04,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-08 05:36:04,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:36:04,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:36:04,849 INFO L256 TraceCheckSpWp]: Trace formula consists of 1108 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 05:36:04,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:36:04,870 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-08 05:36:04,871 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:36:04,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [857085236] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:36:04,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:36:04,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-08 05:36:04,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541078640] [2025-03-08 05:36:04,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:36:04,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:36:04,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:36:04,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:36:04,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:36:04,873 INFO L87 Difference]: Start difference. First operand 336 states and 496 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 05:36:04,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:36:04,903 INFO L93 Difference]: Finished difference Result 701 states and 1050 transitions. [2025-03-08 05:36:04,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:36:04,903 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 127 [2025-03-08 05:36:04,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:36:04,908 INFO L225 Difference]: With dead ends: 701 [2025-03-08 05:36:04,908 INFO L226 Difference]: Without dead ends: 391 [2025-03-08 05:36:04,911 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 127 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-08 05:36:04,913 INFO L435 NwaCegarLoop]: 498 mSDtfsCounter, 107 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 945 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-08 05:36:04,913 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 945 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:36:04,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2025-03-08 05:36:04,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 383. [2025-03-08 05:36:04,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 296 states have (on average 1.5304054054054055) internal successors, (453), 299 states have internal predecessors, (453), 63 states have call successors, (63), 23 states have call predecessors, (63), 23 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2025-03-08 05:36:04,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 578 transitions. [2025-03-08 05:36:04,945 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 578 transitions. Word has length 127 [2025-03-08 05:36:04,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:36:04,946 INFO L471 AbstractCegarLoop]: Abstraction has 383 states and 578 transitions. [2025-03-08 05:36:04,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 05:36:04,946 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 578 transitions. [2025-03-08 05:36:04,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-08 05:36:04,949 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:36:04,949 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:36:04,957 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 05:36:05,149 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-08 05:36:05,150 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:36:05,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:36:05,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1881429813, now seen corresponding path program 1 times [2025-03-08 05:36:05,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:36:05,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691617088] [2025-03-08 05:36:05,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:36:05,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:36:05,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-08 05:36:05,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-08 05:36:05,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:36:05,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:36:05,334 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-08 05:36:05,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:36:05,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691617088] [2025-03-08 05:36:05,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691617088] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:36:05,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [413157033] [2025-03-08 05:36:05,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:36:05,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:36:05,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:36:05,336 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-08 05:36:05,339 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-08 05:36:05,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-08 05:36:05,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-08 05:36:05,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:36:05,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:36:05,589 INFO L256 TraceCheckSpWp]: Trace formula consists of 1113 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 05:36:05,593 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:36:05,644 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 05:36:05,645 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:36:05,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [413157033] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:36:05,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:36:05,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-03-08 05:36:05,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966829840] [2025-03-08 05:36:05,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:36:05,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:36:05,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:36:05,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:36:05,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:36:05,647 INFO L87 Difference]: Start difference. First operand 383 states and 578 transitions. Second operand has 5 states, 4 states have (on average 20.5) internal successors, (82), 5 states have internal predecessors, (82), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-08 05:36:05,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:36:05,712 INFO L93 Difference]: Finished difference Result 757 states and 1146 transitions. [2025-03-08 05:36:05,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:36:05,713 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.5) internal successors, (82), 5 states have internal predecessors, (82), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) Word has length 128 [2025-03-08 05:36:05,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:36:05,715 INFO L225 Difference]: With dead ends: 757 [2025-03-08 05:36:05,715 INFO L226 Difference]: Without dead ends: 385 [2025-03-08 05:36:05,716 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 126 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-08 05:36:05,717 INFO L435 NwaCegarLoop]: 487 mSDtfsCounter, 2 mSDsluCounter, 1450 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1937 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-08 05:36:05,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1937 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:36:05,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2025-03-08 05:36:05,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 385. [2025-03-08 05:36:05,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 297 states have (on average 1.5286195286195285) internal successors, (454), 301 states have internal predecessors, (454), 63 states have call successors, (63), 23 states have call predecessors, (63), 24 states have return successors, (64), 62 states have call predecessors, (64), 62 states have call successors, (64) [2025-03-08 05:36:05,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 581 transitions. [2025-03-08 05:36:05,734 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 581 transitions. Word has length 128 [2025-03-08 05:36:05,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:36:05,734 INFO L471 AbstractCegarLoop]: Abstraction has 385 states and 581 transitions. [2025-03-08 05:36:05,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.5) internal successors, (82), 5 states have internal predecessors, (82), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-08 05:36:05,734 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 581 transitions. [2025-03-08 05:36:05,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-08 05:36:05,737 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:36:05,737 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:36:05,746 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-08 05:36:05,938 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-08 05:36:05,938 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:36:05,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:36:05,939 INFO L85 PathProgramCache]: Analyzing trace with hash 330132774, now seen corresponding path program 1 times [2025-03-08 05:36:05,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:36:05,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034101712] [2025-03-08 05:36:05,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:36:05,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:36:05,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-08 05:36:05,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-08 05:36:05,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:36:05,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:36:06,096 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-08 05:36:06,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:36:06,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034101712] [2025-03-08 05:36:06,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034101712] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:36:06,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [982092385] [2025-03-08 05:36:06,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:36:06,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:36:06,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:36:06,099 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-08 05:36:06,101 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-08 05:36:06,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-08 05:36:06,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-08 05:36:06,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:36:06,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:36:06,321 INFO L256 TraceCheckSpWp]: Trace formula consists of 1114 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 05:36:06,327 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:36:06,367 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 05:36:06,367 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:36:06,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [982092385] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:36:06,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:36:06,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-03-08 05:36:06,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541949630] [2025-03-08 05:36:06,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:36:06,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:36:06,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:36:06,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:36:06,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-08 05:36:06,369 INFO L87 Difference]: Start difference. First operand 385 states and 581 transitions. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-08 05:36:06,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:36:06,415 INFO L93 Difference]: Finished difference Result 759 states and 1151 transitions. [2025-03-08 05:36:06,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:36:06,416 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 129 [2025-03-08 05:36:06,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:36:06,418 INFO L225 Difference]: With dead ends: 759 [2025-03-08 05:36:06,418 INFO L226 Difference]: Without dead ends: 387 [2025-03-08 05:36:06,419 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 127 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-08 05:36:06,420 INFO L435 NwaCegarLoop]: 485 mSDtfsCounter, 2 mSDsluCounter, 1438 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1923 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-08 05:36:06,420 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1923 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:36:06,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2025-03-08 05:36:06,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 387. [2025-03-08 05:36:06,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 298 states have (on average 1.5268456375838926) internal successors, (455), 303 states have internal predecessors, (455), 63 states have call successors, (63), 23 states have call predecessors, (63), 25 states have return successors, (69), 62 states have call predecessors, (69), 62 states have call successors, (69) [2025-03-08 05:36:06,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 587 transitions. [2025-03-08 05:36:06,432 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 587 transitions. Word has length 129 [2025-03-08 05:36:06,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:36:06,432 INFO L471 AbstractCegarLoop]: Abstraction has 387 states and 587 transitions. [2025-03-08 05:36:06,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-08 05:36:06,432 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 587 transitions. [2025-03-08 05:36:06,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-08 05:36:06,434 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:36:06,434 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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-08 05:36:06,441 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 05:36:06,638 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-08 05:36:06,638 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:36:06,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:36:06,640 INFO L85 PathProgramCache]: Analyzing trace with hash 426436142, now seen corresponding path program 1 times [2025-03-08 05:36:06,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:36:06,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247803837] [2025-03-08 05:36:06,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:36:06,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:36:06,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-08 05:36:06,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-08 05:36:06,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:36:06,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:36:06,771 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-08 05:36:06,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:36:06,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247803837] [2025-03-08 05:36:06,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247803837] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:36:06,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:36:06,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:36:06,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706997999] [2025-03-08 05:36:06,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:36:06,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:36:06,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:36:06,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:36:06,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:36:06,773 INFO L87 Difference]: Start difference. First operand 387 states and 587 transitions. Second operand has 5 states, 4 states have (on average 20.0) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-08 05:36:06,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:36:06,811 INFO L93 Difference]: Finished difference Result 751 states and 1142 transitions. [2025-03-08 05:36:06,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:36:06,811 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.0) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) Word has length 130 [2025-03-08 05:36:06,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:36:06,813 INFO L225 Difference]: With dead ends: 751 [2025-03-08 05:36:06,813 INFO L226 Difference]: Without dead ends: 387 [2025-03-08 05:36:06,815 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-08 05:36:06,815 INFO L435 NwaCegarLoop]: 488 mSDtfsCounter, 2 mSDsluCounter, 1453 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1941 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-08 05:36:06,815 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1941 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:36:06,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2025-03-08 05:36:06,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 387. [2025-03-08 05:36:06,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 298 states have (on average 1.5268456375838926) internal successors, (455), 303 states have internal predecessors, (455), 63 states have call successors, (63), 23 states have call predecessors, (63), 25 states have return successors, (68), 62 states have call predecessors, (68), 62 states have call successors, (68) [2025-03-08 05:36:06,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 586 transitions. [2025-03-08 05:36:06,832 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 586 transitions. Word has length 130 [2025-03-08 05:36:06,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:36:06,834 INFO L471 AbstractCegarLoop]: Abstraction has 387 states and 586 transitions. [2025-03-08 05:36:06,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.0) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-08 05:36:06,834 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 586 transitions. [2025-03-08 05:36:06,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-08 05:36:06,836 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:36:06,836 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] [2025-03-08 05:36:06,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 05:36:06,837 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:36:06,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:36:06,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1183018877, now seen corresponding path program 2 times [2025-03-08 05:36:06,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:36:06,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129225562] [2025-03-08 05:36:06,842 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:36:06,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:36:06,857 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 131 statements into 2 equivalence classes. [2025-03-08 05:36:06,862 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 58 of 131 statements. [2025-03-08 05:36:06,862 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 05:36:06,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:36:06,969 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:36:06,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:36:06,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129225562] [2025-03-08 05:36:06,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129225562] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:36:06,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:36:06,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 05:36:06,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719958492] [2025-03-08 05:36:06,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:36:06,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 05:36:06,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:36:06,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 05:36:06,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:36:06,971 INFO L87 Difference]: Start difference. First operand 387 states and 586 transitions. Second operand has 8 states, 8 states have (on average 10.25) internal successors, (82), 7 states have internal predecessors, (82), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (16), 4 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-08 05:36:07,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:36:07,345 INFO L93 Difference]: Finished difference Result 1027 states and 1535 transitions. [2025-03-08 05:36:07,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 05:36:07,346 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 7 states have internal predecessors, (82), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (16), 4 states have call predecessors, (16), 3 states have call successors, (16) Word has length 131 [2025-03-08 05:36:07,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:36:07,351 INFO L225 Difference]: With dead ends: 1027 [2025-03-08 05:36:07,351 INFO L226 Difference]: Without dead ends: 851 [2025-03-08 05:36:07,352 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-03-08 05:36:07,353 INFO L435 NwaCegarLoop]: 525 mSDtfsCounter, 555 mSDsluCounter, 2911 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 570 SdHoareTripleChecker+Valid, 3436 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 05:36:07,353 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [570 Valid, 3436 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 05:36:07,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2025-03-08 05:36:07,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 755. [2025-03-08 05:36:07,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 755 states, 585 states have (on average 1.5367521367521368) internal successors, (899), 592 states have internal predecessors, (899), 120 states have call successors, (120), 46 states have call predecessors, (120), 49 states have return successors, (133), 120 states have call predecessors, (133), 118 states have call successors, (133) [2025-03-08 05:36:07,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 755 states to 755 states and 1152 transitions. [2025-03-08 05:36:07,390 INFO L78 Accepts]: Start accepts. Automaton has 755 states and 1152 transitions. Word has length 131 [2025-03-08 05:36:07,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:36:07,390 INFO L471 AbstractCegarLoop]: Abstraction has 755 states and 1152 transitions. [2025-03-08 05:36:07,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 7 states have internal predecessors, (82), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (16), 4 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-08 05:36:07,391 INFO L276 IsEmpty]: Start isEmpty. Operand 755 states and 1152 transitions. [2025-03-08 05:36:07,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-08 05:36:07,394 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:36:07,394 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:36:07,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 05:36:07,394 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:36:07,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:36:07,394 INFO L85 PathProgramCache]: Analyzing trace with hash -520968338, now seen corresponding path program 1 times [2025-03-08 05:36:07,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:36:07,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967813985] [2025-03-08 05:36:07,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:36:07,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:36:07,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 05:36:07,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 05:36:07,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:36:07,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:36:07,508 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-08 05:36:07,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:36:07,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967813985] [2025-03-08 05:36:07,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967813985] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:36:07,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:36:07,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:36:07,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258667211] [2025-03-08 05:36:07,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:36:07,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:36:07,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:36:07,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:36:07,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:36:07,510 INFO L87 Difference]: Start difference. First operand 755 states and 1152 transitions. Second operand has 5 states, 4 states have (on average 20.75) internal successors, (83), 5 states have internal predecessors, (83), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-08 05:36:07,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:36:07,563 INFO L93 Difference]: Finished difference Result 1489 states and 2277 transitions. [2025-03-08 05:36:07,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:36:07,564 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.75) internal successors, (83), 5 states have internal predecessors, (83), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) Word has length 132 [2025-03-08 05:36:07,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:36:07,568 INFO L225 Difference]: With dead ends: 1489 [2025-03-08 05:36:07,571 INFO L226 Difference]: Without dead ends: 757 [2025-03-08 05:36:07,574 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-08 05:36:07,575 INFO L435 NwaCegarLoop]: 489 mSDtfsCounter, 1 mSDsluCounter, 1455 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1944 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-08 05:36:07,575 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1944 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:36:07,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 757 states. [2025-03-08 05:36:07,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 757 to 757. [2025-03-08 05:36:07,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 757 states, 586 states have (on average 1.5358361774744027) internal successors, (900), 594 states have internal predecessors, (900), 120 states have call successors, (120), 46 states have call predecessors, (120), 50 states have return successors, (135), 120 states have call predecessors, (135), 118 states have call successors, (135) [2025-03-08 05:36:07,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 757 states to 757 states and 1155 transitions. [2025-03-08 05:36:07,614 INFO L78 Accepts]: Start accepts. Automaton has 757 states and 1155 transitions. Word has length 132 [2025-03-08 05:36:07,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:36:07,615 INFO L471 AbstractCegarLoop]: Abstraction has 757 states and 1155 transitions. [2025-03-08 05:36:07,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.75) internal successors, (83), 5 states have internal predecessors, (83), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-08 05:36:07,615 INFO L276 IsEmpty]: Start isEmpty. Operand 757 states and 1155 transitions. [2025-03-08 05:36:07,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-08 05:36:07,618 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:36:07,618 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:36:07,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 05:36:07,619 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:36:07,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:36:07,619 INFO L85 PathProgramCache]: Analyzing trace with hash -882461504, now seen corresponding path program 1 times [2025-03-08 05:36:07,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:36:07,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581914619] [2025-03-08 05:36:07,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:36:07,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:36:07,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 05:36:07,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 05:36:07,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:36:07,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:36:07,768 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-08 05:36:07,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:36:07,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581914619] [2025-03-08 05:36:07,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581914619] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:36:07,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:36:07,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 05:36:07,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368735482] [2025-03-08 05:36:07,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:36:07,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 05:36:07,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:36:07,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 05:36:07,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:36:07,770 INFO L87 Difference]: Start difference. First operand 757 states and 1155 transitions. Second operand has 8 states, 7 states have (on average 12.428571428571429) internal successors, (87), 8 states have internal predecessors, (87), 4 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) [2025-03-08 05:36:07,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:36:07,885 INFO L93 Difference]: Finished difference Result 1120 states and 1707 transitions. [2025-03-08 05:36:07,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 05:36:07,886 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 12.428571428571429) internal successors, (87), 8 states have internal predecessors, (87), 4 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) Word has length 133 [2025-03-08 05:36:07,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:36:07,889 INFO L225 Difference]: With dead ends: 1120 [2025-03-08 05:36:07,889 INFO L226 Difference]: Without dead ends: 391 [2025-03-08 05:36:07,890 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-08 05:36:07,891 INFO L435 NwaCegarLoop]: 479 mSDtfsCounter, 7 mSDsluCounter, 2845 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 3324 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-08 05:36:07,892 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 3324 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:36:07,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2025-03-08 05:36:07,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 391. [2025-03-08 05:36:07,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 301 states have (on average 1.521594684385382) internal successors, (458), 306 states have internal predecessors, (458), 63 states have call successors, (63), 24 states have call predecessors, (63), 26 states have return successors, (69), 62 states have call predecessors, (69), 62 states have call successors, (69) [2025-03-08 05:36:07,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 590 transitions. [2025-03-08 05:36:07,907 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 590 transitions. Word has length 133 [2025-03-08 05:36:07,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:36:07,908 INFO L471 AbstractCegarLoop]: Abstraction has 391 states and 590 transitions. [2025-03-08 05:36:07,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 12.428571428571429) internal successors, (87), 8 states have internal predecessors, (87), 4 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) [2025-03-08 05:36:07,908 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 590 transitions. [2025-03-08 05:36:07,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-08 05:36:07,909 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:36:07,910 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] [2025-03-08 05:36:07,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 05:36:07,910 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:36:07,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:36:07,911 INFO L85 PathProgramCache]: Analyzing trace with hash 767769077, now seen corresponding path program 1 times [2025-03-08 05:36:07,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:36:07,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474553704] [2025-03-08 05:36:07,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:36:07,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:36:07,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 05:36:07,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 05:36:07,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:36:07,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:36:08,055 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-08 05:36:08,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:36:08,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474553704] [2025-03-08 05:36:08,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474553704] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:36:08,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:36:08,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 05:36:08,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441842522] [2025-03-08 05:36:08,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:36:08,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 05:36:08,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:36:08,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 05:36:08,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:36:08,057 INFO L87 Difference]: Start difference. First operand 391 states and 590 transitions. Second operand has 8 states, 7 states have (on average 12.285714285714286) internal successors, (86), 8 states have internal predecessors, (86), 4 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) [2025-03-08 05:36:08,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:36:08,165 INFO L93 Difference]: Finished difference Result 758 states and 1151 transitions. [2025-03-08 05:36:08,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 05:36:08,165 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 12.285714285714286) internal successors, (86), 8 states have internal predecessors, (86), 4 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) Word has length 133 [2025-03-08 05:36:08,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:36:08,168 INFO L225 Difference]: With dead ends: 758 [2025-03-08 05:36:08,168 INFO L226 Difference]: Without dead ends: 394 [2025-03-08 05:36:08,169 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-08 05:36:08,169 INFO L435 NwaCegarLoop]: 481 mSDtfsCounter, 5 mSDsluCounter, 2857 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 3338 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:36:08,171 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 3338 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:36:08,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2025-03-08 05:36:08,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 394. [2025-03-08 05:36:08,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 303 states have (on average 1.518151815181518) internal successors, (460), 309 states have internal predecessors, (460), 63 states have call successors, (63), 24 states have call predecessors, (63), 27 states have return successors, (74), 62 states have call predecessors, (74), 62 states have call successors, (74) [2025-03-08 05:36:08,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 597 transitions. [2025-03-08 05:36:08,185 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 597 transitions. Word has length 133 [2025-03-08 05:36:08,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:36:08,185 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 597 transitions. [2025-03-08 05:36:08,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 12.285714285714286) internal successors, (86), 8 states have internal predecessors, (86), 4 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) [2025-03-08 05:36:08,185 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 597 transitions. [2025-03-08 05:36:08,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-08 05:36:08,187 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:36:08,187 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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-08 05:36:08,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 05:36:08,187 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:36:08,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:36:08,187 INFO L85 PathProgramCache]: Analyzing trace with hash -274433336, now seen corresponding path program 1 times [2025-03-08 05:36:08,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:36:08,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572260195] [2025-03-08 05:36:08,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:36:08,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:36:08,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-08 05:36:08,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-08 05:36:08,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:36:08,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:36:08,317 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-08 05:36:08,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:36:08,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572260195] [2025-03-08 05:36:08,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572260195] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:36:08,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1732679341] [2025-03-08 05:36:08,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:36:08,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:36:08,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:36:08,320 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-08 05:36:08,322 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-08 05:36:08,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-08 05:36:08,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-08 05:36:08,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:36:08,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:36:08,546 INFO L256 TraceCheckSpWp]: Trace formula consists of 1119 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 05:36:08,549 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:36:08,584 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-03-08 05:36:08,588 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:36:08,706 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-03-08 05:36:08,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1732679341] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:36:08,708 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:36:08,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 11 [2025-03-08 05:36:08,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027465235] [2025-03-08 05:36:08,709 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:36:08,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 05:36:08,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:36:08,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 05:36:08,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-08 05:36:08,710 INFO L87 Difference]: Start difference. First operand 394 states and 597 transitions. Second operand has 11 states, 10 states have (on average 13.3) internal successors, (133), 11 states have internal predecessors, (133), 4 states have call successors, (32), 2 states have call predecessors, (32), 3 states have return successors, (30), 3 states have call predecessors, (30), 4 states have call successors, (30) [2025-03-08 05:36:09,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:36:09,167 INFO L93 Difference]: Finished difference Result 1100 states and 1751 transitions. [2025-03-08 05:36:09,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 05:36:09,168 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 13.3) internal successors, (133), 11 states have internal predecessors, (133), 4 states have call successors, (32), 2 states have call predecessors, (32), 3 states have return successors, (30), 3 states have call predecessors, (30), 4 states have call successors, (30) Word has length 134 [2025-03-08 05:36:09,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:36:09,172 INFO L225 Difference]: With dead ends: 1100 [2025-03-08 05:36:09,172 INFO L226 Difference]: Without dead ends: 737 [2025-03-08 05:36:09,174 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 265 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=400, Unknown=0, NotChecked=0, Total=506 [2025-03-08 05:36:09,174 INFO L435 NwaCegarLoop]: 489 mSDtfsCounter, 1165 mSDsluCounter, 2650 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1165 SdHoareTripleChecker+Valid, 3139 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 05:36:09,174 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1165 Valid, 3139 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 461 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 05:36:09,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2025-03-08 05:36:09,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 713. [2025-03-08 05:36:09,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 713 states, 558 states have (on average 1.5806451612903225) internal successors, (882), 563 states have internal predecessors, (882), 127 states have call successors, (127), 25 states have call predecessors, (127), 27 states have return successors, (148), 126 states have call predecessors, (148), 126 states have call successors, (148) [2025-03-08 05:36:09,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 1157 transitions. [2025-03-08 05:36:09,203 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 1157 transitions. Word has length 134 [2025-03-08 05:36:09,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:36:09,204 INFO L471 AbstractCegarLoop]: Abstraction has 713 states and 1157 transitions. [2025-03-08 05:36:09,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 13.3) internal successors, (133), 11 states have internal predecessors, (133), 4 states have call successors, (32), 2 states have call predecessors, (32), 3 states have return successors, (30), 3 states have call predecessors, (30), 4 states have call successors, (30) [2025-03-08 05:36:09,204 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 1157 transitions. [2025-03-08 05:36:09,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-08 05:36:09,208 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:36:09,208 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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-08 05:36:09,215 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-08 05:36:09,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-08 05:36:09,409 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:36:09,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:36:09,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1478483374, now seen corresponding path program 1 times [2025-03-08 05:36:09,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:36:09,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855481711] [2025-03-08 05:36:09,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:36:09,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:36:09,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-08 05:36:09,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-08 05:36:09,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:36:09,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:36:09,477 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-03-08 05:36:09,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:36:09,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855481711] [2025-03-08 05:36:09,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855481711] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:36:09,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:36:09,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:36:09,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776674214] [2025-03-08 05:36:09,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:36:09,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:36:09,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:36:09,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:36:09,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:36:09,481 INFO L87 Difference]: Start difference. First operand 713 states and 1157 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 05:36:09,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:36:09,517 INFO L93 Difference]: Finished difference Result 1643 states and 2719 transitions. [2025-03-08 05:36:09,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:36:09,517 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 138 [2025-03-08 05:36:09,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:36:09,524 INFO L225 Difference]: With dead ends: 1643 [2025-03-08 05:36:09,524 INFO L226 Difference]: Without dead ends: 1009 [2025-03-08 05:36:09,526 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-08 05:36:09,527 INFO L435 NwaCegarLoop]: 510 mSDtfsCounter, 104 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 995 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-08 05:36:09,527 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 995 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:36:09,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1009 states. [2025-03-08 05:36:09,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1009 to 1001. [2025-03-08 05:36:09,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1001 states, 782 states have (on average 1.604859335038363) internal successors, (1255), 787 states have internal predecessors, (1255), 191 states have call successors, (191), 25 states have call predecessors, (191), 27 states have return successors, (222), 190 states have call predecessors, (222), 190 states have call successors, (222) [2025-03-08 05:36:09,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1001 states to 1001 states and 1668 transitions. [2025-03-08 05:36:09,582 INFO L78 Accepts]: Start accepts. Automaton has 1001 states and 1668 transitions. Word has length 138 [2025-03-08 05:36:09,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:36:09,583 INFO L471 AbstractCegarLoop]: Abstraction has 1001 states and 1668 transitions. [2025-03-08 05:36:09,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 05:36:09,583 INFO L276 IsEmpty]: Start isEmpty. Operand 1001 states and 1668 transitions. [2025-03-08 05:36:09,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-08 05:36:09,587 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:36:09,588 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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-08 05:36:09,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 05:36:09,588 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:36:09,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:36:09,588 INFO L85 PathProgramCache]: Analyzing trace with hash -837978543, now seen corresponding path program 1 times [2025-03-08 05:36:09,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:36:09,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853824516] [2025-03-08 05:36:09,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:36:09,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:36:09,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-08 05:36:09,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-08 05:36:09,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:36:09,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:36:09,639 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-03-08 05:36:09,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:36:09,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853824516] [2025-03-08 05:36:09,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853824516] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:36:09,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:36:09,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:36:09,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006773377] [2025-03-08 05:36:09,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:36:09,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:36:09,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:36:09,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:36:09,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:36:09,642 INFO L87 Difference]: Start difference. First operand 1001 states and 1668 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 05:36:09,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:36:09,687 INFO L93 Difference]: Finished difference Result 2355 states and 3955 transitions. [2025-03-08 05:36:09,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:36:09,687 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 139 [2025-03-08 05:36:09,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:36:09,694 INFO L225 Difference]: With dead ends: 2355 [2025-03-08 05:36:09,694 INFO L226 Difference]: Without dead ends: 1482 [2025-03-08 05:36:09,697 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-08 05:36:09,698 INFO L435 NwaCegarLoop]: 502 mSDtfsCounter, 102 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 990 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-08 05:36:09,698 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 990 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:36:09,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1482 states. [2025-03-08 05:36:09,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1482 to 1474. [2025-03-08 05:36:09,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1474 states, 1160 states have (on average 1.618103448275862) internal successors, (1877), 1165 states have internal predecessors, (1877), 286 states have call successors, (286), 25 states have call predecessors, (286), 27 states have return successors, (317), 285 states have call predecessors, (317), 285 states have call successors, (317) [2025-03-08 05:36:09,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1474 states to 1474 states and 2480 transitions. [2025-03-08 05:36:09,753 INFO L78 Accepts]: Start accepts. Automaton has 1474 states and 2480 transitions. Word has length 139 [2025-03-08 05:36:09,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:36:09,755 INFO L471 AbstractCegarLoop]: Abstraction has 1474 states and 2480 transitions. [2025-03-08 05:36:09,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 05:36:09,755 INFO L276 IsEmpty]: Start isEmpty. Operand 1474 states and 2480 transitions. [2025-03-08 05:36:09,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-08 05:36:09,762 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:36:09,763 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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-08 05:36:09,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 05:36:09,763 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:36:09,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:36:09,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1512959091, now seen corresponding path program 1 times [2025-03-08 05:36:09,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:36:09,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098138534] [2025-03-08 05:36:09,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:36:09,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:36:09,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-08 05:36:09,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-08 05:36:09,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:36:09,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:36:09,812 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-03-08 05:36:09,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:36:09,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098138534] [2025-03-08 05:36:09,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098138534] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:36:09,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:36:09,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:36:09,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583762361] [2025-03-08 05:36:09,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:36:09,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:36:09,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:36:09,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:36:09,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:36:09,815 INFO L87 Difference]: Start difference. First operand 1474 states and 2480 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 05:36:09,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:36:09,915 INFO L93 Difference]: Finished difference Result 3411 states and 5793 transitions. [2025-03-08 05:36:09,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:36:09,915 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 140 [2025-03-08 05:36:09,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:36:09,925 INFO L225 Difference]: With dead ends: 3411 [2025-03-08 05:36:09,926 INFO L226 Difference]: Without dead ends: 2193 [2025-03-08 05:36:09,930 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-08 05:36:09,931 INFO L435 NwaCegarLoop]: 493 mSDtfsCounter, 100 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 977 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-08 05:36:09,931 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 977 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:36:09,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2193 states. [2025-03-08 05:36:10,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2193 to 2185. [2025-03-08 05:36:10,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2185 states, 1748 states have (on average 1.6287185354691076) internal successors, (2847), 1753 states have internal predecessors, (2847), 409 states have call successors, (409), 25 states have call predecessors, (409), 27 states have return successors, (456), 408 states have call predecessors, (456), 408 states have call successors, (456) [2025-03-08 05:36:10,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2185 states to 2185 states and 3712 transitions. [2025-03-08 05:36:10,045 INFO L78 Accepts]: Start accepts. Automaton has 2185 states and 3712 transitions. Word has length 140 [2025-03-08 05:36:10,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:36:10,045 INFO L471 AbstractCegarLoop]: Abstraction has 2185 states and 3712 transitions. [2025-03-08 05:36:10,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 05:36:10,045 INFO L276 IsEmpty]: Start isEmpty. Operand 2185 states and 3712 transitions. [2025-03-08 05:36:10,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-08 05:36:10,055 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:36:10,055 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2025-03-08 05:36:10,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 05:36:10,056 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:36:10,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:36:10,056 INFO L85 PathProgramCache]: Analyzing trace with hash -432238062, now seen corresponding path program 1 times [2025-03-08 05:36:10,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:36:10,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718527895] [2025-03-08 05:36:10,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:36:10,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:36:10,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-08 05:36:10,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-08 05:36:10,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:36:10,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:36:10,111 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-03-08 05:36:10,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:36:10,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718527895] [2025-03-08 05:36:10,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718527895] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:36:10,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:36:10,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:36:10,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693227122] [2025-03-08 05:36:10,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:36:10,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:36:10,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:36:10,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:36:10,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:36:10,114 INFO L87 Difference]: Start difference. First operand 2185 states and 3712 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 05:36:10,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:36:10,208 INFO L93 Difference]: Finished difference Result 5043 states and 8639 transitions. [2025-03-08 05:36:10,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:36:10,209 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 141 [2025-03-08 05:36:10,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:36:10,226 INFO L225 Difference]: With dead ends: 5043 [2025-03-08 05:36:10,226 INFO L226 Difference]: Without dead ends: 3322 [2025-03-08 05:36:10,231 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-08 05:36:10,231 INFO L435 NwaCegarLoop]: 493 mSDtfsCounter, 98 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 977 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-08 05:36:10,232 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 977 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:36:10,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3322 states. [2025-03-08 05:36:10,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3322 to 3314. [2025-03-08 05:36:10,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3314 states, 2698 states have (on average 1.6360266864343957) internal successors, (4414), 2703 states have internal predecessors, (4414), 588 states have call successors, (588), 25 states have call predecessors, (588), 27 states have return successors, (661), 587 states have call predecessors, (661), 587 states have call successors, (661) [2025-03-08 05:36:10,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3314 states to 3314 states and 5663 transitions. [2025-03-08 05:36:10,372 INFO L78 Accepts]: Start accepts. Automaton has 3314 states and 5663 transitions. Word has length 141 [2025-03-08 05:36:10,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:36:10,372 INFO L471 AbstractCegarLoop]: Abstraction has 3314 states and 5663 transitions. [2025-03-08 05:36:10,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 05:36:10,372 INFO L276 IsEmpty]: Start isEmpty. Operand 3314 states and 5663 transitions. [2025-03-08 05:36:10,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-08 05:36:10,388 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:36:10,388 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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-08 05:36:10,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 05:36:10,388 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:36:10,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:36:10,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1119876468, now seen corresponding path program 1 times [2025-03-08 05:36:10,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:36:10,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44289518] [2025-03-08 05:36:10,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:36:10,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:36:10,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-08 05:36:10,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-08 05:36:10,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:36:10,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:36:10,445 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-03-08 05:36:10,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:36:10,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44289518] [2025-03-08 05:36:10,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44289518] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:36:10,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:36:10,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:36:10,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074347154] [2025-03-08 05:36:10,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:36:10,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:36:10,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:36:10,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:36:10,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:36:10,447 INFO L87 Difference]: Start difference. First operand 3314 states and 5663 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 05:36:10,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:36:10,601 INFO L93 Difference]: Finished difference Result 7983 states and 13722 transitions. [2025-03-08 05:36:10,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:36:10,602 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 142 [2025-03-08 05:36:10,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:36:10,627 INFO L225 Difference]: With dead ends: 7983 [2025-03-08 05:36:10,627 INFO L226 Difference]: Without dead ends: 5369 [2025-03-08 05:36:10,636 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-08 05:36:10,637 INFO L435 NwaCegarLoop]: 493 mSDtfsCounter, 96 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 982 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-08 05:36:10,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 982 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:36:10,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5369 states. [2025-03-08 05:36:10,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5369 to 5361. [2025-03-08 05:36:10,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5361 states, 4369 states have (on average 1.6310368505378805) internal successors, (7126), 4374 states have internal predecessors, (7126), 964 states have call successors, (964), 25 states have call predecessors, (964), 27 states have return successors, (1081), 963 states have call predecessors, (1081), 963 states have call successors, (1081) [2025-03-08 05:36:10,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5361 states to 5361 states and 9171 transitions. [2025-03-08 05:36:10,896 INFO L78 Accepts]: Start accepts. Automaton has 5361 states and 9171 transitions. Word has length 142 [2025-03-08 05:36:10,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:36:10,896 INFO L471 AbstractCegarLoop]: Abstraction has 5361 states and 9171 transitions. [2025-03-08 05:36:10,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 05:36:10,897 INFO L276 IsEmpty]: Start isEmpty. Operand 5361 states and 9171 transitions. [2025-03-08 05:36:10,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-08 05:36:10,918 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:36:10,918 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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-08 05:36:10,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 05:36:10,918 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:36:10,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:36:10,919 INFO L85 PathProgramCache]: Analyzing trace with hash -307847917, now seen corresponding path program 1 times [2025-03-08 05:36:10,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:36:10,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102282015] [2025-03-08 05:36:10,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:36:10,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:36:10,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 05:36:10,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 05:36:10,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:36:10,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:36:10,967 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-03-08 05:36:10,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:36:10,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102282015] [2025-03-08 05:36:10,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102282015] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:36:10,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:36:10,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:36:10,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652492581] [2025-03-08 05:36:10,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:36:10,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:36:10,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:36:10,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:36:10,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:36:10,969 INFO L87 Difference]: Start difference. First operand 5361 states and 9171 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 05:36:11,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:36:11,208 INFO L93 Difference]: Finished difference Result 13167 states and 22674 transitions. [2025-03-08 05:36:11,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:36:11,209 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 143 [2025-03-08 05:36:11,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:36:11,256 INFO L225 Difference]: With dead ends: 13167 [2025-03-08 05:36:11,256 INFO L226 Difference]: Without dead ends: 8886 [2025-03-08 05:36:11,272 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-08 05:36:11,273 INFO L435 NwaCegarLoop]: 497 mSDtfsCounter, 94 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 984 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-08 05:36:11,273 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 984 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:36:11,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8886 states. [2025-03-08 05:36:11,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8886 to 8878. [2025-03-08 05:36:11,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8878 states, 7280 states have (on average 1.6300824175824176) internal successors, (11867), 7285 states have internal predecessors, (11867), 1570 states have call successors, (1570), 25 states have call predecessors, (1570), 27 states have return successors, (1765), 1569 states have call predecessors, (1765), 1569 states have call successors, (1765) [2025-03-08 05:36:11,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8878 states to 8878 states and 15202 transitions. [2025-03-08 05:36:11,750 INFO L78 Accepts]: Start accepts. Automaton has 8878 states and 15202 transitions. Word has length 143 [2025-03-08 05:36:11,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:36:11,752 INFO L471 AbstractCegarLoop]: Abstraction has 8878 states and 15202 transitions. [2025-03-08 05:36:11,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 05:36:11,753 INFO L276 IsEmpty]: Start isEmpty. Operand 8878 states and 15202 transitions. [2025-03-08 05:36:11,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-08 05:36:11,829 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:36:11,829 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2025-03-08 05:36:11,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 05:36:11,830 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:36:11,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:36:11,830 INFO L85 PathProgramCache]: Analyzing trace with hash 642519339, now seen corresponding path program 1 times [2025-03-08 05:36:11,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:36:11,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661773778] [2025-03-08 05:36:11,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:36:11,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:36:11,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-08 05:36:11,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-08 05:36:11,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:36:11,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:36:11,879 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-03-08 05:36:11,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:36:11,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661773778] [2025-03-08 05:36:11,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661773778] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:36:11,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:36:11,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:36:11,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433533815] [2025-03-08 05:36:11,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:36:11,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:36:11,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:36:11,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:36:11,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:36:11,881 INFO L87 Difference]: Start difference. First operand 8878 states and 15202 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 05:36:12,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:36:12,208 INFO L93 Difference]: Finished difference Result 22911 states and 39394 transitions. [2025-03-08 05:36:12,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:36:12,209 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 144 [2025-03-08 05:36:12,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:36:12,264 INFO L225 Difference]: With dead ends: 22911 [2025-03-08 05:36:12,265 INFO L226 Difference]: Without dead ends: 15536 [2025-03-08 05:36:12,284 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-08 05:36:12,284 INFO L435 NwaCegarLoop]: 507 mSDtfsCounter, 92 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 999 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-08 05:36:12,284 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 999 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:36:12,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15536 states. [2025-03-08 05:36:12,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15536 to 15528. [2025-03-08 05:36:12,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15528 states, 12727 states have (on average 1.6212775988056887) internal successors, (20634), 12732 states have internal predecessors, (20634), 2773 states have call successors, (2773), 25 states have call predecessors, (2773), 27 states have return successors, (3112), 2772 states have call predecessors, (3112), 2772 states have call successors, (3112) [2025-03-08 05:36:12,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15528 states to 15528 states and 26519 transitions. [2025-03-08 05:36:12,918 INFO L78 Accepts]: Start accepts. Automaton has 15528 states and 26519 transitions. Word has length 144 [2025-03-08 05:36:12,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:36:12,919 INFO L471 AbstractCegarLoop]: Abstraction has 15528 states and 26519 transitions. [2025-03-08 05:36:12,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 05:36:12,920 INFO L276 IsEmpty]: Start isEmpty. Operand 15528 states and 26519 transitions. [2025-03-08 05:36:12,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-08 05:36:12,966 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:36:12,966 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2025-03-08 05:36:12,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 05:36:12,967 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:36:12,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:36:12,967 INFO L85 PathProgramCache]: Analyzing trace with hash 34070740, now seen corresponding path program 1 times [2025-03-08 05:36:12,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:36:12,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73663744] [2025-03-08 05:36:12,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:36:12,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:36:12,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-08 05:36:12,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-08 05:36:12,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:36:12,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:36:13,016 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-03-08 05:36:13,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:36:13,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73663744] [2025-03-08 05:36:13,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73663744] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:36:13,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:36:13,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:36:13,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666986391] [2025-03-08 05:36:13,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:36:13,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:36:13,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:36:13,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:36:13,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:36:13,018 INFO L87 Difference]: Start difference. First operand 15528 states and 26519 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 05:36:13,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:36:13,835 INFO L93 Difference]: Finished difference Result 41042 states and 70416 transitions. [2025-03-08 05:36:13,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:36:13,836 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 145 [2025-03-08 05:36:13,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:36:13,959 INFO L225 Difference]: With dead ends: 41042 [2025-03-08 05:36:13,959 INFO L226 Difference]: Without dead ends: 27622 [2025-03-08 05:36:14,018 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-08 05:36:14,019 INFO L435 NwaCegarLoop]: 500 mSDtfsCounter, 90 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 988 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-08 05:36:14,019 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 988 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:36:14,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27622 states. [2025-03-08 05:36:14,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27622 to 27614. [2025-03-08 05:36:14,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27614 states, 22774 states have (on average 1.6172828664266268) internal successors, (36832), 22779 states have internal predecessors, (36832), 4812 states have call successors, (4812), 25 states have call predecessors, (4812), 27 states have return successors, (5425), 4811 states have call predecessors, (5425), 4811 states have call successors, (5425) [2025-03-08 05:36:15,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27614 states to 27614 states and 47069 transitions. [2025-03-08 05:36:15,062 INFO L78 Accepts]: Start accepts. Automaton has 27614 states and 47069 transitions. Word has length 145 [2025-03-08 05:36:15,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:36:15,062 INFO L471 AbstractCegarLoop]: Abstraction has 27614 states and 47069 transitions. [2025-03-08 05:36:15,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 05:36:15,063 INFO L276 IsEmpty]: Start isEmpty. Operand 27614 states and 47069 transitions. [2025-03-08 05:36:15,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-08 05:36:15,104 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:36:15,104 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2025-03-08 05:36:15,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 05:36:15,104 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:36:15,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:36:15,105 INFO L85 PathProgramCache]: Analyzing trace with hash 971896554, now seen corresponding path program 1 times [2025-03-08 05:36:15,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:36:15,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98917869] [2025-03-08 05:36:15,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:36:15,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:36:15,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-08 05:36:15,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-08 05:36:15,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:36:15,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:36:15,150 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-03-08 05:36:15,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:36:15,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98917869] [2025-03-08 05:36:15,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98917869] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:36:15,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:36:15,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:36:15,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847635061] [2025-03-08 05:36:15,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:36:15,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:36:15,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:36:15,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:36:15,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:36:15,153 INFO L87 Difference]: Start difference. First operand 27614 states and 47069 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 05:36:16,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:36:16,062 INFO L93 Difference]: Finished difference Result 75189 states and 128633 transitions. [2025-03-08 05:36:16,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:36:16,062 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 146 [2025-03-08 05:36:16,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:36:16,257 INFO L225 Difference]: With dead ends: 75189 [2025-03-08 05:36:16,258 INFO L226 Difference]: Without dead ends: 50409 [2025-03-08 05:36:16,327 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-08 05:36:16,327 INFO L435 NwaCegarLoop]: 495 mSDtfsCounter, 88 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 982 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-08 05:36:16,327 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 982 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:36:16,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50409 states. [2025-03-08 05:36:18,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50409 to 50401. [2025-03-08 05:36:18,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50401 states, 41846 states have (on average 1.611695263585528) internal successors, (67443), 41851 states have internal predecessors, (67443), 8527 states have call successors, (8527), 25 states have call predecessors, (8527), 27 states have return successors, (9672), 8526 states have call predecessors, (9672), 8526 states have call successors, (9672) [2025-03-08 05:36:18,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50401 states to 50401 states and 85642 transitions. [2025-03-08 05:36:18,554 INFO L78 Accepts]: Start accepts. Automaton has 50401 states and 85642 transitions. Word has length 146 [2025-03-08 05:36:18,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:36:18,555 INFO L471 AbstractCegarLoop]: Abstraction has 50401 states and 85642 transitions. [2025-03-08 05:36:18,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 05:36:18,555 INFO L276 IsEmpty]: Start isEmpty. Operand 50401 states and 85642 transitions. [2025-03-08 05:36:18,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-08 05:36:18,623 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:36:18,623 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2025-03-08 05:36:18,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 05:36:18,623 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:36:18,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:36:18,624 INFO L85 PathProgramCache]: Analyzing trace with hash -80852683, now seen corresponding path program 1 times [2025-03-08 05:36:18,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:36:18,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514848912] [2025-03-08 05:36:18,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:36:18,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:36:18,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-08 05:36:18,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-08 05:36:18,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:36:18,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:36:18,681 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-03-08 05:36:18,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:36:18,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514848912] [2025-03-08 05:36:18,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514848912] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:36:18,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:36:18,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:36:18,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544573811] [2025-03-08 05:36:18,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:36:18,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:36:18,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:36:18,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:36:18,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:36:18,684 INFO L87 Difference]: Start difference. First operand 50401 states and 85642 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 05:36:20,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:36:20,132 INFO L93 Difference]: Finished difference Result 93931 states and 159965 transitions. [2025-03-08 05:36:20,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:36:20,132 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 147 [2025-03-08 05:36:20,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:36:20,530 INFO L225 Difference]: With dead ends: 93931 [2025-03-08 05:36:20,530 INFO L226 Difference]: Without dead ends: 93747 [2025-03-08 05:36:20,589 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-08 05:36:20,592 INFO L435 NwaCegarLoop]: 495 mSDtfsCounter, 83 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 986 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-08 05:36:20,592 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 986 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:36:20,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93747 states. [2025-03-08 05:36:23,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93747 to 93739. [2025-03-08 05:36:23,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93739 states, 78385 states have (on average 1.6045034126427251) internal successors, (125769), 78390 states have internal predecessors, (125769), 15326 states have call successors, (15326), 25 states have call predecessors, (15326), 27 states have return successors, (17517), 15325 states have call predecessors, (17517), 15325 states have call successors, (17517) [2025-03-08 05:36:24,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93739 states to 93739 states and 158612 transitions. [2025-03-08 05:36:24,349 INFO L78 Accepts]: Start accepts. Automaton has 93739 states and 158612 transitions. Word has length 147 [2025-03-08 05:36:24,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:36:24,350 INFO L471 AbstractCegarLoop]: Abstraction has 93739 states and 158612 transitions. [2025-03-08 05:36:24,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 05:36:24,350 INFO L276 IsEmpty]: Start isEmpty. Operand 93739 states and 158612 transitions. [2025-03-08 05:36:24,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-08 05:36:24,441 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:36:24,441 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2025-03-08 05:36:24,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 05:36:24,441 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:36:24,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:36:24,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1325790313, now seen corresponding path program 1 times [2025-03-08 05:36:24,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:36:24,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612812922] [2025-03-08 05:36:24,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:36:24,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:36:24,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-08 05:36:24,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-08 05:36:24,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:36:24,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:36:24,773 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-08 05:36:24,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:36:24,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612812922] [2025-03-08 05:36:24,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612812922] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:36:24,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1626767548] [2025-03-08 05:36:24,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:36:24,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:36:24,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:36:24,776 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-08 05:36:24,778 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-08 05:36:24,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-08 05:36:25,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-08 05:36:25,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:36:25,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:36:25,079 INFO L256 TraceCheckSpWp]: Trace formula consists of 1158 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-08 05:36:25,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:36:25,613 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-08 05:36:25,613 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:36:25,905 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-08 05:36:25,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1626767548] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:36:25,905 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:36:25,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9, 9] total 28 [2025-03-08 05:36:25,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457139476] [2025-03-08 05:36:25,905 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:36:25,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-08 05:36:25,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:36:25,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-08 05:36:25,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=688, Unknown=0, NotChecked=0, Total=756 [2025-03-08 05:36:25,907 INFO L87 Difference]: Start difference. First operand 93739 states and 158612 transitions. Second operand has 28 states, 26 states have (on average 9.23076923076923) internal successors, (240), 24 states have internal predecessors, (240), 9 states have call successors, (47), 8 states have call predecessors, (47), 12 states have return successors, (42), 11 states have call predecessors, (42), 9 states have call successors, (42)