./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec8_product30.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/email_spec8_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 15275a4436f6ed835fc824ec788a3589ee34ef53cd98082c25cb994e481acd9a --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 14:26:55,561 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 14:26:55,609 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 14:26:55,614 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 14:26:55,614 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 14:26:55,640 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 14:26:55,640 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 14:26:55,640 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 14:26:55,641 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 14:26:55,641 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 14:26:55,641 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 14:26:55,641 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 14:26:55,641 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 14:26:55,641 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 14:26:55,641 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 14:26:55,641 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 14:26:55,641 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 14:26:55,641 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 14:26:55,641 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 14:26:55,641 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 14:26:55,642 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 14:26:55,642 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 14:26:55,642 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 14:26:55,642 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 14:26:55,642 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 14:26:55,642 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 14:26:55,642 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 14:26:55,642 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 14:26:55,642 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 14:26:55,642 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 14:26:55,642 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 14:26:55,642 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 14:26:55,642 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:26:55,642 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 14:26:55,644 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 14:26:55,644 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 14:26:55,644 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 14:26:55,644 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 14:26:55,644 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 14:26:55,644 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 14:26:55,644 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 14:26:55,644 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 14:26:55,644 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 14:26:55,644 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 -> 15275a4436f6ed835fc824ec788a3589ee34ef53cd98082c25cb994e481acd9a [2025-03-03 14:26:55,876 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 14:26:55,881 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 14:26:55,883 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 14:26:55,884 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 14:26:55,884 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 14:26:55,885 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec8_product30.cil.c [2025-03-03 14:26:57,001 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee8e7656f/7466b5f743324153942d9fbc1d9f7340/FLAG16ff52ff1 [2025-03-03 14:26:57,319 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 14:26:57,322 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec8_product30.cil.c [2025-03-03 14:26:57,344 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee8e7656f/7466b5f743324153942d9fbc1d9f7340/FLAG16ff52ff1 [2025-03-03 14:26:57,559 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee8e7656f/7466b5f743324153942d9fbc1d9f7340 [2025-03-03 14:26:57,562 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 14:26:57,564 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 14:26:57,565 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 14:26:57,565 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 14:26:57,568 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 14:26:57,569 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:26:57" (1/1) ... [2025-03-03 14:26:57,570 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a845d20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:26:57, skipping insertion in model container [2025-03-03 14:26:57,570 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:26:57" (1/1) ... [2025-03-03 14:26:57,615 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 14:26:57,810 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_spec8_product30.cil.c[7858,7871] [2025-03-03 14:26:58,003 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:26:58,015 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 14:26:58,020 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [48] [2025-03-03 14:26:58,021 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EncryptAutoResponder_spec.i","") [363] [2025-03-03 14:26:58,021 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [407] [2025-03-03 14:26:58,021 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [416] [2025-03-03 14:26:58,021 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [563] [2025-03-03 14:26:58,021 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [598] [2025-03-03 14:26:58,021 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [964] [2025-03-03 14:26:58,021 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [1180] [2025-03-03 14:26:58,022 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [1545] [2025-03-03 14:26:58,022 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [1562] [2025-03-03 14:26:58,022 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [2629] [2025-03-03 14:26:58,031 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_spec8_product30.cil.c[7858,7871] [2025-03-03 14:26:58,102 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:26:58,131 INFO L204 MainTranslator]: Completed translation [2025-03-03 14:26:58,132 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:26:58 WrapperNode [2025-03-03 14:26:58,132 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 14:26:58,133 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 14:26:58,133 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 14:26:58,133 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 14:26:58,138 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:26:58" (1/1) ... [2025-03-03 14:26:58,154 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:26:58" (1/1) ... [2025-03-03 14:26:58,188 INFO L138 Inliner]: procedures = 132, calls = 207, calls flagged for inlining = 61, calls inlined = 51, statements flattened = 922 [2025-03-03 14:26:58,188 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 14:26:58,193 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 14:26:58,193 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 14:26:58,193 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 14:26:58,204 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:26:58" (1/1) ... [2025-03-03 14:26:58,204 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:26:58" (1/1) ... [2025-03-03 14:26:58,209 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:26:58" (1/1) ... [2025-03-03 14:26:58,235 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 4, 4, 4]. 29 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 4, 4, 4]. The 0 writes are split as follows [0, 0, 0, 0]. [2025-03-03 14:26:58,236 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:26:58" (1/1) ... [2025-03-03 14:26:58,236 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:26:58" (1/1) ... [2025-03-03 14:26:58,256 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:26:58" (1/1) ... [2025-03-03 14:26:58,262 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:26:58" (1/1) ... [2025-03-03 14:26:58,268 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:26:58" (1/1) ... [2025-03-03 14:26:58,271 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:26:58" (1/1) ... [2025-03-03 14:26:58,282 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 14:26:58,283 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 14:26:58,283 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 14:26:58,283 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 14:26:58,284 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:26:58" (1/1) ... [2025-03-03 14:26:58,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:26:58,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:26:58,309 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 14:26:58,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 14:26:58,329 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2025-03-03 14:26:58,329 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2025-03-03 14:26:58,329 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2025-03-03 14:26:58,329 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2025-03-03 14:26:58,329 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2025-03-03 14:26:58,329 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2025-03-03 14:26:58,329 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-03-03 14:26:58,330 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-03-03 14:26:58,330 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-03-03 14:26:58,330 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-03-03 14:26:58,330 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2025-03-03 14:26:58,330 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2025-03-03 14:26:58,331 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-03-03 14:26:58,331 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-03-03 14:26:58,331 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2025-03-03 14:26:58,331 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2025-03-03 14:26:58,331 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2025-03-03 14:26:58,332 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2025-03-03 14:26:58,332 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-03-03 14:26:58,332 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-03-03 14:26:58,332 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-03-03 14:26:58,332 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-03-03 14:26:58,332 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-03-03 14:26:58,334 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-03-03 14:26:58,334 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 14:26:58,334 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2025-03-03 14:26:58,334 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2025-03-03 14:26:58,334 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2025-03-03 14:26:58,334 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2025-03-03 14:26:58,334 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-03-03 14:26:58,334 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-03-03 14:26:58,334 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-03-03 14:26:58,334 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-03-03 14:26:58,335 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-03-03 14:26:58,335 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-03-03 14:26:58,335 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2025-03-03 14:26:58,335 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2025-03-03 14:26:58,335 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-03-03 14:26:58,335 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-03-03 14:26:58,335 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2025-03-03 14:26:58,335 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2025-03-03 14:26:58,335 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-03-03 14:26:58,335 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-03-03 14:26:58,335 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-03-03 14:26:58,335 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-03-03 14:26:58,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 14:26:58,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 14:26:58,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-03 14:26:58,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-03 14:26:58,335 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-03-03 14:26:58,335 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-03-03 14:26:58,335 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 14:26:58,335 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 14:26:58,505 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 14:26:58,507 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 14:26:58,758 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2606-1: getClientId_#res#1 := getClientId_~retValue_acc~32#1; [2025-03-03 14:26:58,758 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2124-1: getClientAutoResponse_#res#1 := getClientAutoResponse_~retValue_acc~24#1; [2025-03-03 14:26:58,770 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2933: #res := ~retValue_acc~41; [2025-03-03 14:26:58,784 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1448: #res := ~retValue_acc~14; [2025-03-03 14:26:58,815 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2263: #res#1 := ~retValue_acc~27#1; [2025-03-03 14:26:58,815 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2218-1: getClientKeyringSize_#res#1 := getClientKeyringSize_~retValue_acc~26#1; [2025-03-03 14:26:58,842 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2487: #res := ~retValue_acc~30; [2025-03-03 14:26:58,852 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2171: #res := ~retValue_acc~25; [2025-03-03 14:26:58,866 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L560-1: createEmail_#res#1 := createEmail_~retValue_acc~4#1; [2025-03-03 14:26:58,879 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2859: #res := ~retValue_acc~39; [2025-03-03 14:26:58,893 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2896: #res := ~retValue_acc~40; [2025-03-03 14:26:58,900 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2970: #res := ~retValue_acc~42; [2025-03-03 14:26:58,920 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2744: #res := ~retValue_acc~36; [2025-03-03 14:26:59,169 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1423-1: get_queued_email_#res#1 := get_queued_email_~retValue_acc~13#1; [2025-03-03 14:26:59,169 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2433-1: getClientKeyringPublicKey_#res#1 := getClientKeyringPublicKey_~retValue_acc~29#1; [2025-03-03 14:26:59,169 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2326-1: getClientKeyringUser_#res#1 := getClientKeyringUser_~retValue_acc~28#1; [2025-03-03 14:26:59,169 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L595-1: valid_product_#res#1 := valid_product_~retValue_acc~6#1; [2025-03-03 14:26:59,169 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1405-1: is_queue_empty_#res#1 := is_queue_empty_~retValue_acc~11#1; [2025-03-03 14:26:59,169 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1414-1: get_queued_client_#res#1 := get_queued_client_~retValue_acc~12#1; [2025-03-03 14:26:59,175 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2707: #res := ~retValue_acc~35; [2025-03-03 14:26:59,183 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L536: #res#1 := ~retValue_acc~2#1; [2025-03-03 14:26:59,183 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L516-1: isReadable__wrappee__Keys_#res#1 := isReadable__wrappee__Keys_~retValue_acc~1#1; [2025-03-03 14:26:59,315 INFO L? ?]: Removed 432 outVars from TransFormulas that were not future-live. [2025-03-03 14:26:59,315 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 14:26:59,329 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 14:26:59,329 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 14:26:59,329 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:26:59 BoogieIcfgContainer [2025-03-03 14:26:59,330 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 14:26:59,333 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 14:26:59,333 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 14:26:59,336 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 14:26:59,336 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 02:26:57" (1/3) ... [2025-03-03 14:26:59,337 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@485a2f13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:26:59, skipping insertion in model container [2025-03-03 14:26:59,337 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:26:58" (2/3) ... [2025-03-03 14:26:59,337 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@485a2f13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:26:59, skipping insertion in model container [2025-03-03 14:26:59,337 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:26:59" (3/3) ... [2025-03-03 14:26:59,338 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec8_product30.cil.c [2025-03-03 14:26:59,351 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 14:26:59,353 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec8_product30.cil.c that has 24 procedures, 347 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 14:26:59,405 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 14:26:59,412 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;@42d94d67, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 14:26:59,412 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 14:26:59,416 INFO L276 IsEmpty]: Start isEmpty. Operand has 347 states, 269 states have (on average 1.513011152416357) internal successors, (407), 273 states have internal predecessors, (407), 53 states have call successors, (53), 23 states have call predecessors, (53), 23 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2025-03-03 14:26:59,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-03 14:26:59,444 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:26:59,445 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:26:59,445 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:26:59,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:26:59,451 INFO L85 PathProgramCache]: Analyzing trace with hash 812960141, now seen corresponding path program 1 times [2025-03-03 14:26:59,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:26:59,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269485588] [2025-03-03 14:26:59,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:59,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:26:59,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-03 14:26:59,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-03 14:26:59,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:59,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:59,979 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-03 14:26:59,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:26:59,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269485588] [2025-03-03 14:26:59,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269485588] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:26:59,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1770152230] [2025-03-03 14:26:59,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:59,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:26:59,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:26:59,983 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:26:59,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 14:27:00,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-03 14:27:00,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-03 14:27:00,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:27:00,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:27:00,266 INFO L256 TraceCheckSpWp]: Trace formula consists of 1023 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 14:27:00,272 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:27:00,289 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-03 14:27:00,289 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:27:00,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1770152230] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:27:00,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:27:00,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 5 [2025-03-03 14:27:00,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371061624] [2025-03-03 14:27:00,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:27:00,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 14:27:00,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:27:00,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 14:27:00,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:27:00,310 INFO L87 Difference]: Start difference. First operand has 347 states, 269 states have (on average 1.513011152416357) internal successors, (407), 273 states have internal predecessors, (407), 53 states have call successors, (53), 23 states have call predecessors, (53), 23 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) Second operand has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:27:00,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:27:00,347 INFO L93 Difference]: Finished difference Result 541 states and 782 transitions. [2025-03-03 14:27:00,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 14:27:00,348 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 101 [2025-03-03 14:27:00,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:27:00,356 INFO L225 Difference]: With dead ends: 541 [2025-03-03 14:27:00,359 INFO L226 Difference]: Without dead ends: 340 [2025-03-03 14:27:00,363 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:27:00,365 INFO L435 NwaCegarLoop]: 510 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:27:00,366 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 510 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:27:00,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2025-03-03 14:27:00,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2025-03-03 14:27:00,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 263 states have (on average 1.5095057034220531) internal successors, (397), 266 states have internal predecessors, (397), 53 states have call successors, (53), 23 states have call predecessors, (53), 23 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-03 14:27:00,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 502 transitions. [2025-03-03 14:27:00,434 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 502 transitions. Word has length 101 [2025-03-03 14:27:00,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:27:00,436 INFO L471 AbstractCegarLoop]: Abstraction has 340 states and 502 transitions. [2025-03-03 14:27:00,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:27:00,436 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 502 transitions. [2025-03-03 14:27:00,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-03 14:27:00,444 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:27:00,445 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:27:00,453 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-03 14:27:00,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 14:27:00,646 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:27:00,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:27:00,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1250893959, now seen corresponding path program 1 times [2025-03-03 14:27:00,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:27:00,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942770082] [2025-03-03 14:27:00,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:27:00,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:27:00,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-03 14:27:00,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-03 14:27:00,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:27:00,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:27:00,861 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-03 14:27:00,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:27:00,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942770082] [2025-03-03 14:27:00,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942770082] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:27:00,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [207889726] [2025-03-03 14:27:00,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:27:00,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:27:00,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:27:00,865 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:27:00,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 14:27:00,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-03 14:27:01,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-03 14:27:01,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:27:01,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:27:01,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 1024 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 14:27:01,129 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:27:01,154 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-03 14:27:01,154 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:27:01,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [207889726] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:27:01,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:27:01,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 14:27:01,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909276451] [2025-03-03 14:27:01,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:27:01,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:27:01,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:27:01,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:27:01,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:27:01,155 INFO L87 Difference]: Start difference. First operand 340 states and 502 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:27:01,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:27:01,192 INFO L93 Difference]: Finished difference Result 530 states and 763 transitions. [2025-03-03 14:27:01,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:27:01,192 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 102 [2025-03-03 14:27:01,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:27:01,197 INFO L225 Difference]: With dead ends: 530 [2025-03-03 14:27:01,197 INFO L226 Difference]: Without dead ends: 342 [2025-03-03 14:27:01,198 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:27:01,199 INFO L435 NwaCegarLoop]: 501 mSDtfsCounter, 0 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1000 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:27:01,199 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1000 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:27:01,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2025-03-03 14:27:01,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 342. [2025-03-03 14:27:01,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 265 states have (on average 1.5056603773584907) internal successors, (399), 268 states have internal predecessors, (399), 53 states have call successors, (53), 23 states have call predecessors, (53), 23 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-03 14:27:01,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 504 transitions. [2025-03-03 14:27:01,221 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 504 transitions. Word has length 102 [2025-03-03 14:27:01,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:27:01,221 INFO L471 AbstractCegarLoop]: Abstraction has 342 states and 504 transitions. [2025-03-03 14:27:01,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:27:01,222 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 504 transitions. [2025-03-03 14:27:01,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-03 14:27:01,224 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:27:01,224 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:27:01,232 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 14:27:01,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-03 14:27:01,425 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:27:01,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:27:01,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1133712359, now seen corresponding path program 1 times [2025-03-03 14:27:01,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:27:01,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566963270] [2025-03-03 14:27:01,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:27:01,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:27:01,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-03 14:27:01,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-03 14:27:01,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:27:01,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:27:01,645 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-03 14:27:01,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:27:01,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566963270] [2025-03-03 14:27:01,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566963270] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:27:01,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1362476282] [2025-03-03 14:27:01,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:27:01,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:27:01,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:27:01,648 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:27:01,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 14:27:01,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-03 14:27:01,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-03 14:27:01,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:27:01,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:27:01,900 INFO L256 TraceCheckSpWp]: Trace formula consists of 1049 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:27:01,908 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:27:01,922 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-03 14:27:01,922 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:27:01,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1362476282] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:27:01,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:27:01,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 14:27:01,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238622890] [2025-03-03 14:27:01,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:27:01,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:27:01,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:27:01,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:27:01,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:27:01,924 INFO L87 Difference]: Start difference. First operand 342 states and 504 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:27:01,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:27:01,959 INFO L93 Difference]: Finished difference Result 713 states and 1066 transitions. [2025-03-03 14:27:01,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:27:01,959 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 110 [2025-03-03 14:27:01,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:27:01,963 INFO L225 Difference]: With dead ends: 713 [2025-03-03 14:27:01,963 INFO L226 Difference]: Without dead ends: 398 [2025-03-03 14:27:01,964 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:27:01,967 INFO L435 NwaCegarLoop]: 512 mSDtfsCounter, 107 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 966 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:27:01,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 966 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:27:01,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2025-03-03 14:27:01,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 390. [2025-03-03 14:27:01,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 302 states have (on average 1.5231788079470199) internal successors, (460), 305 states have internal predecessors, (460), 64 states have call successors, (64), 23 states have call predecessors, (64), 23 states have return successors, (63), 63 states have call predecessors, (63), 63 states have call successors, (63) [2025-03-03 14:27:01,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 587 transitions. [2025-03-03 14:27:01,990 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 587 transitions. Word has length 110 [2025-03-03 14:27:01,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:27:01,990 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 587 transitions. [2025-03-03 14:27:01,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:27:01,992 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 587 transitions. [2025-03-03 14:27:01,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-03 14:27:01,996 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:27:01,996 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:27:02,004 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 14:27:02,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:27:02,197 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:27:02,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:27:02,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1877514853, now seen corresponding path program 1 times [2025-03-03 14:27:02,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:27:02,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285040820] [2025-03-03 14:27:02,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:27:02,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:27:02,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-03 14:27:02,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-03 14:27:02,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:27:02,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:27:02,388 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-03 14:27:02,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:27:02,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285040820] [2025-03-03 14:27:02,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285040820] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:27:02,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [623704052] [2025-03-03 14:27:02,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:27:02,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:27:02,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:27:02,392 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:27:02,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 14:27:02,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-03 14:27:02,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-03 14:27:02,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:27:02,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:27:02,664 INFO L256 TraceCheckSpWp]: Trace formula consists of 1054 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 14:27:02,669 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:27:02,712 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-03 14:27:02,712 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:27:02,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [623704052] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:27:02,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:27:02,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-03-03 14:27:02,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445020266] [2025-03-03 14:27:02,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:27:02,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:27:02,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:27:02,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:27:02,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:27:02,714 INFO L87 Difference]: Start difference. First operand 390 states and 587 transitions. Second operand has 5 states, 4 states have (on average 19.0) internal successors, (76), 5 states have internal predecessors, (76), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 14:27:02,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:27:02,771 INFO L93 Difference]: Finished difference Result 771 states and 1164 transitions. [2025-03-03 14:27:02,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:27:02,775 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.0) internal successors, (76), 5 states have internal predecessors, (76), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 111 [2025-03-03 14:27:02,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:27:02,778 INFO L225 Difference]: With dead ends: 771 [2025-03-03 14:27:02,779 INFO L226 Difference]: Without dead ends: 392 [2025-03-03 14:27:02,780 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:27:02,780 INFO L435 NwaCegarLoop]: 494 mSDtfsCounter, 2 mSDsluCounter, 1471 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1965 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:27:02,781 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1965 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:27:02,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2025-03-03 14:27:02,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2025-03-03 14:27:02,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 303 states have (on average 1.5214521452145215) internal successors, (461), 307 states have internal predecessors, (461), 64 states have call successors, (64), 23 states have call predecessors, (64), 24 states have return successors, (65), 63 states have call predecessors, (65), 63 states have call successors, (65) [2025-03-03 14:27:02,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 590 transitions. [2025-03-03 14:27:02,802 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 590 transitions. Word has length 111 [2025-03-03 14:27:02,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:27:02,803 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 590 transitions. [2025-03-03 14:27:02,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.0) internal successors, (76), 5 states have internal predecessors, (76), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 14:27:02,803 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 590 transitions. [2025-03-03 14:27:02,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-03 14:27:02,805 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:27:02,805 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:27:02,813 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-03 14:27:03,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:27:03,005 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:27:03,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:27:03,006 INFO L85 PathProgramCache]: Analyzing trace with hash 486714039, now seen corresponding path program 1 times [2025-03-03 14:27:03,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:27:03,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807875646] [2025-03-03 14:27:03,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:27:03,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:27:03,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 14:27:03,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 14:27:03,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:27:03,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:27:03,151 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-03 14:27:03,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:27:03,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807875646] [2025-03-03 14:27:03,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807875646] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:27:03,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [257566372] [2025-03-03 14:27:03,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:27:03,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:27:03,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:27:03,154 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:27:03,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 14:27:03,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 14:27:03,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 14:27:03,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:27:03,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:27:03,378 INFO L256 TraceCheckSpWp]: Trace formula consists of 1055 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 14:27:03,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:27:03,424 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-03 14:27:03,424 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:27:03,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [257566372] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:27:03,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:27:03,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-03-03 14:27:03,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000556058] [2025-03-03 14:27:03,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:27:03,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:27:03,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:27:03,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:27:03,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:27:03,426 INFO L87 Difference]: Start difference. First operand 392 states and 590 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 14:27:03,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:27:03,491 INFO L93 Difference]: Finished difference Result 773 states and 1169 transitions. [2025-03-03 14:27:03,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:27:03,492 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 112 [2025-03-03 14:27:03,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:27:03,495 INFO L225 Difference]: With dead ends: 773 [2025-03-03 14:27:03,495 INFO L226 Difference]: Without dead ends: 394 [2025-03-03 14:27:03,498 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:27:03,499 INFO L435 NwaCegarLoop]: 492 mSDtfsCounter, 2 mSDsluCounter, 1459 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1951 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:27:03,499 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1951 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:27:03,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2025-03-03 14:27:03,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 394. [2025-03-03 14:27:03,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 304 states have (on average 1.519736842105263) internal successors, (462), 309 states have internal predecessors, (462), 64 states have call successors, (64), 23 states have call predecessors, (64), 25 states have return successors, (70), 63 states have call predecessors, (70), 63 states have call successors, (70) [2025-03-03 14:27:03,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 596 transitions. [2025-03-03 14:27:03,515 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 596 transitions. Word has length 112 [2025-03-03 14:27:03,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:27:03,515 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 596 transitions. [2025-03-03 14:27:03,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 14:27:03,515 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 596 transitions. [2025-03-03 14:27:03,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-03 14:27:03,517 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:27:03,517 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:27:03,524 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-03 14:27:03,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:27:03,717 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:27:03,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:27:03,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1805052131, now seen corresponding path program 1 times [2025-03-03 14:27:03,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:27:03,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237357802] [2025-03-03 14:27:03,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:27:03,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:27:03,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-03 14:27:03,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-03 14:27:03,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:27:03,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:27:03,857 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-03 14:27:03,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:27:03,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237357802] [2025-03-03 14:27:03,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237357802] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:27:03,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:27:03,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:27:03,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812563619] [2025-03-03 14:27:03,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:27:03,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:27:03,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:27:03,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:27:03,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:27:03,859 INFO L87 Difference]: Start difference. First operand 394 states and 596 transitions. Second operand has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 states have internal predecessors, (74), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 14:27:03,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:27:03,903 INFO L93 Difference]: Finished difference Result 765 states and 1160 transitions. [2025-03-03 14:27:03,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:27:03,903 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 states have internal predecessors, (74), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 113 [2025-03-03 14:27:03,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:27:03,906 INFO L225 Difference]: With dead ends: 765 [2025-03-03 14:27:03,906 INFO L226 Difference]: Without dead ends: 394 [2025-03-03 14:27:03,907 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:27:03,908 INFO L435 NwaCegarLoop]: 495 mSDtfsCounter, 2 mSDsluCounter, 1474 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1969 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:27:03,908 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1969 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:27:03,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2025-03-03 14:27:03,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 394. [2025-03-03 14:27:03,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 304 states have (on average 1.519736842105263) internal successors, (462), 309 states have internal predecessors, (462), 64 states have call successors, (64), 23 states have call predecessors, (64), 25 states have return successors, (69), 63 states have call predecessors, (69), 63 states have call successors, (69) [2025-03-03 14:27:03,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 595 transitions. [2025-03-03 14:27:03,929 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 595 transitions. Word has length 113 [2025-03-03 14:27:03,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:27:03,929 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 595 transitions. [2025-03-03 14:27:03,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 states have internal predecessors, (74), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 14:27:03,930 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 595 transitions. [2025-03-03 14:27:03,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-03 14:27:03,931 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:27:03,931 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:27:03,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 14:27:03,931 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:27:03,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:27:03,932 INFO L85 PathProgramCache]: Analyzing trace with hash 212847063, now seen corresponding path program 2 times [2025-03-03 14:27:03,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:27:03,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934442705] [2025-03-03 14:27:03,932 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 14:27:03,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:27:03,946 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 114 statements into 2 equivalence classes. [2025-03-03 14:27:03,955 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 114 of 114 statements. [2025-03-03 14:27:03,955 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 14:27:03,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:27:04,034 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-03 14:27:04,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:27:04,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934442705] [2025-03-03 14:27:04,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934442705] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:27:04,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:27:04,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:27:04,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109068486] [2025-03-03 14:27:04,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:27:04,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:27:04,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:27:04,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:27:04,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:27:04,035 INFO L87 Difference]: Start difference. First operand 394 states and 595 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 14:27:04,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:27:04,079 INFO L93 Difference]: Finished difference Result 763 states and 1155 transitions. [2025-03-03 14:27:04,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:27:04,080 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 114 [2025-03-03 14:27:04,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:27:04,082 INFO L225 Difference]: With dead ends: 763 [2025-03-03 14:27:04,083 INFO L226 Difference]: Without dead ends: 394 [2025-03-03 14:27:04,084 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:27:04,084 INFO L435 NwaCegarLoop]: 493 mSDtfsCounter, 2 mSDsluCounter, 1462 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1955 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:27:04,084 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1955 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:27:04,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2025-03-03 14:27:04,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 394. [2025-03-03 14:27:04,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 304 states have (on average 1.519736842105263) internal successors, (462), 309 states have internal predecessors, (462), 64 states have call successors, (64), 23 states have call predecessors, (64), 25 states have return successors, (68), 63 states have call predecessors, (68), 63 states have call successors, (68) [2025-03-03 14:27:04,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 594 transitions. [2025-03-03 14:27:04,098 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 594 transitions. Word has length 114 [2025-03-03 14:27:04,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:27:04,098 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 594 transitions. [2025-03-03 14:27:04,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 14:27:04,098 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 594 transitions. [2025-03-03 14:27:04,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-03 14:27:04,100 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:27:04,100 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:27:04,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 14:27:04,100 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:27:04,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:27:04,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1754662171, now seen corresponding path program 3 times [2025-03-03 14:27:04,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:27:04,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067997443] [2025-03-03 14:27:04,101 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 14:27:04,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:27:04,115 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 115 statements into 3 equivalence classes. [2025-03-03 14:27:04,123 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 103 of 115 statements. [2025-03-03 14:27:04,123 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-03 14:27:04,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:27:04,191 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-03 14:27:04,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:27:04,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067997443] [2025-03-03 14:27:04,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067997443] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:27:04,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:27:04,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:27:04,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578107949] [2025-03-03 14:27:04,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:27:04,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:27:04,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:27:04,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:27:04,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:27:04,193 INFO L87 Difference]: Start difference. First operand 394 states and 594 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 14:27:04,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:27:04,240 INFO L93 Difference]: Finished difference Result 765 states and 1161 transitions. [2025-03-03 14:27:04,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:27:04,240 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 115 [2025-03-03 14:27:04,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:27:04,242 INFO L225 Difference]: With dead ends: 765 [2025-03-03 14:27:04,243 INFO L226 Difference]: Without dead ends: 396 [2025-03-03 14:27:04,244 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:27:04,244 INFO L435 NwaCegarLoop]: 496 mSDtfsCounter, 1 mSDsluCounter, 1470 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1966 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:27:04,244 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1966 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:27:04,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2025-03-03 14:27:04,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 396. [2025-03-03 14:27:04,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 305 states have (on average 1.518032786885246) internal successors, (463), 311 states have internal predecessors, (463), 64 states have call successors, (64), 23 states have call predecessors, (64), 26 states have return successors, (73), 63 states have call predecessors, (73), 63 states have call successors, (73) [2025-03-03 14:27:04,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 600 transitions. [2025-03-03 14:27:04,257 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 600 transitions. Word has length 115 [2025-03-03 14:27:04,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:27:04,257 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 600 transitions. [2025-03-03 14:27:04,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 14:27:04,258 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 600 transitions. [2025-03-03 14:27:04,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-03 14:27:04,259 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:27:04,259 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:27:04,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 14:27:04,259 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:27:04,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:27:04,260 INFO L85 PathProgramCache]: Analyzing trace with hash -165683110, now seen corresponding path program 1 times [2025-03-03 14:27:04,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:27:04,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807878833] [2025-03-03 14:27:04,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:27:04,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:27:04,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-03 14:27:04,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-03 14:27:04,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:27:04,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:27:04,372 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-03 14:27:04,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:27:04,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807878833] [2025-03-03 14:27:04,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807878833] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:27:04,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:27:04,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:27:04,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545989806] [2025-03-03 14:27:04,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:27:04,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:27:04,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:27:04,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:27:04,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:27:04,374 INFO L87 Difference]: Start difference. First operand 396 states and 600 transitions. Second operand has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 14:27:04,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:27:04,411 INFO L93 Difference]: Finished difference Result 771 states and 1171 transitions. [2025-03-03 14:27:04,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:27:04,412 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 116 [2025-03-03 14:27:04,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:27:04,414 INFO L225 Difference]: With dead ends: 771 [2025-03-03 14:27:04,414 INFO L226 Difference]: Without dead ends: 398 [2025-03-03 14:27:04,415 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:27:04,416 INFO L435 NwaCegarLoop]: 496 mSDtfsCounter, 1 mSDsluCounter, 1476 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1972 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:27:04,416 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1972 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:27:04,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2025-03-03 14:27:04,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 398. [2025-03-03 14:27:04,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 306 states have (on average 1.5163398692810457) internal successors, (464), 313 states have internal predecessors, (464), 64 states have call successors, (64), 23 states have call predecessors, (64), 27 states have return successors, (75), 63 states have call predecessors, (75), 63 states have call successors, (75) [2025-03-03 14:27:04,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 603 transitions. [2025-03-03 14:27:04,429 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 603 transitions. Word has length 116 [2025-03-03 14:27:04,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:27:04,429 INFO L471 AbstractCegarLoop]: Abstraction has 398 states and 603 transitions. [2025-03-03 14:27:04,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 14:27:04,429 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 603 transitions. [2025-03-03 14:27:04,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-03 14:27:04,431 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:27:04,431 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:27:04,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 14:27:04,431 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:27:04,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:27:04,432 INFO L85 PathProgramCache]: Analyzing trace with hash -2023723863, now seen corresponding path program 1 times [2025-03-03 14:27:04,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:27:04,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195702947] [2025-03-03 14:27:04,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:27:04,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:27:04,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-03 14:27:04,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-03 14:27:04,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:27:04,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:27:04,548 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-03 14:27:04,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:27:04,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195702947] [2025-03-03 14:27:04,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195702947] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:27:04,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2133236469] [2025-03-03 14:27:04,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:27:04,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:27:04,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:27:04,550 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:27:04,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 14:27:04,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-03 14:27:04,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-03 14:27:04,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:27:04,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:27:04,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 1060 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:27:04,780 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:27:04,807 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:27:04,807 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:27:04,875 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:27:04,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2133236469] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:27:04,875 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:27:04,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 11 [2025-03-03 14:27:04,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619215179] [2025-03-03 14:27:04,876 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:27:04,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 14:27:04,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:27:04,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 14:27:04,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:27:04,880 INFO L87 Difference]: Start difference. First operand 398 states and 603 transitions. Second operand has 11 states, 10 states have (on average 12.8) internal successors, (128), 11 states have internal predecessors, (128), 4 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) [2025-03-03 14:27:05,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:27:05,406 INFO L93 Difference]: Finished difference Result 1116 states and 1771 transitions. [2025-03-03 14:27:05,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 14:27:05,407 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 12.8) internal successors, (128), 11 states have internal predecessors, (128), 4 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) Word has length 117 [2025-03-03 14:27:05,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:27:05,411 INFO L225 Difference]: With dead ends: 1116 [2025-03-03 14:27:05,411 INFO L226 Difference]: Without dead ends: 747 [2025-03-03 14:27:05,413 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 231 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-03 14:27:05,413 INFO L435 NwaCegarLoop]: 492 mSDtfsCounter, 1265 mSDsluCounter, 2989 mSDsCounter, 0 mSdLazyCounter, 498 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1265 SdHoareTripleChecker+Valid, 3481 SdHoareTripleChecker+Invalid, 602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 14:27:05,414 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1265 Valid, 3481 Invalid, 602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 498 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 14:27:05,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2025-03-03 14:27:05,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 723. [2025-03-03 14:27:05,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 723 states, 567 states have (on average 1.5731922398589064) internal successors, (892), 573 states have internal predecessors, (892), 128 states have call successors, (128), 24 states have call predecessors, (128), 27 states have return successors, (149), 127 states have call predecessors, (149), 127 states have call successors, (149) [2025-03-03 14:27:05,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 723 states and 1169 transitions. [2025-03-03 14:27:05,444 INFO L78 Accepts]: Start accepts. Automaton has 723 states and 1169 transitions. Word has length 117 [2025-03-03 14:27:05,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:27:05,444 INFO L471 AbstractCegarLoop]: Abstraction has 723 states and 1169 transitions. [2025-03-03 14:27:05,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 12.8) internal successors, (128), 11 states have internal predecessors, (128), 4 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) [2025-03-03 14:27:05,445 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 1169 transitions. [2025-03-03 14:27:05,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-03 14:27:05,447 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:27:05,447 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:27:05,455 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-03 14:27:05,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:27:05,648 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:27:05,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:27:05,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1983478744, now seen corresponding path program 1 times [2025-03-03 14:27:05,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:27:05,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930745761] [2025-03-03 14:27:05,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:27:05,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:27:05,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-03 14:27:05,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-03 14:27:05,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:27:05,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:27:05,702 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:27:05,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:27:05,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930745761] [2025-03-03 14:27:05,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930745761] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:27:05,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:27:05,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:27:05,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8298027] [2025-03-03 14:27:05,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:27:05,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:27:05,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:27:05,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:27:05,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:27:05,704 INFO L87 Difference]: Start difference. First operand 723 states and 1169 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:27:05,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:27:05,742 INFO L93 Difference]: Finished difference Result 1671 states and 2751 transitions. [2025-03-03 14:27:05,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:27:05,742 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 120 [2025-03-03 14:27:05,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:27:05,749 INFO L225 Difference]: With dead ends: 1671 [2025-03-03 14:27:05,750 INFO L226 Difference]: Without dead ends: 1026 [2025-03-03 14:27:05,752 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:27:05,752 INFO L435 NwaCegarLoop]: 528 mSDtfsCounter, 104 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 1021 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:27:05,753 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 1021 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:27:05,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1026 states. [2025-03-03 14:27:05,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1026 to 1018. [2025-03-03 14:27:05,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1018 states, 798 states have (on average 1.593984962406015) internal successors, (1272), 804 states have internal predecessors, (1272), 192 states have call successors, (192), 24 states have call predecessors, (192), 27 states have return successors, (223), 191 states have call predecessors, (223), 191 states have call successors, (223) [2025-03-03 14:27:05,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1018 states to 1018 states and 1687 transitions. [2025-03-03 14:27:05,802 INFO L78 Accepts]: Start accepts. Automaton has 1018 states and 1687 transitions. Word has length 120 [2025-03-03 14:27:05,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:27:05,802 INFO L471 AbstractCegarLoop]: Abstraction has 1018 states and 1687 transitions. [2025-03-03 14:27:05,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:27:05,802 INFO L276 IsEmpty]: Start isEmpty. Operand 1018 states and 1687 transitions. [2025-03-03 14:27:05,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-03 14:27:05,807 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:27:05,807 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:27:05,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 14:27:05,807 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:27:05,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:27:05,808 INFO L85 PathProgramCache]: Analyzing trace with hash 958835163, now seen corresponding path program 1 times [2025-03-03 14:27:05,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:27:05,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458656087] [2025-03-03 14:27:05,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:27:05,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:27:05,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-03 14:27:05,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-03 14:27:05,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:27:05,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:27:05,859 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:27:05,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:27:05,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458656087] [2025-03-03 14:27:05,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458656087] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:27:05,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:27:05,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:27:05,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530345404] [2025-03-03 14:27:05,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:27:05,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:27:05,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:27:05,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:27:05,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:27:05,860 INFO L87 Difference]: Start difference. First operand 1018 states and 1687 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:27:05,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:27:05,914 INFO L93 Difference]: Finished difference Result 2400 states and 4004 transitions. [2025-03-03 14:27:05,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:27:05,914 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 121 [2025-03-03 14:27:05,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:27:05,924 INFO L225 Difference]: With dead ends: 2400 [2025-03-03 14:27:05,924 INFO L226 Difference]: Without dead ends: 1511 [2025-03-03 14:27:05,928 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:27:05,929 INFO L435 NwaCegarLoop]: 507 mSDtfsCounter, 102 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 1002 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:27:05,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 1002 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:27:05,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1511 states. [2025-03-03 14:27:06,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1511 to 1503. [2025-03-03 14:27:06,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1503 states, 1188 states have (on average 1.6043771043771045) internal successors, (1906), 1194 states have internal predecessors, (1906), 287 states have call successors, (287), 24 states have call predecessors, (287), 27 states have return successors, (318), 286 states have call predecessors, (318), 286 states have call successors, (318) [2025-03-03 14:27:06,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1503 states and 2511 transitions. [2025-03-03 14:27:06,041 INFO L78 Accepts]: Start accepts. Automaton has 1503 states and 2511 transitions. Word has length 121 [2025-03-03 14:27:06,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:27:06,042 INFO L471 AbstractCegarLoop]: Abstraction has 1503 states and 2511 transitions. [2025-03-03 14:27:06,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:27:06,042 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 2511 transitions. [2025-03-03 14:27:06,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-03 14:27:06,050 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:27:06,050 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:27:06,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 14:27:06,050 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:27:06,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:27:06,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1555333993, now seen corresponding path program 1 times [2025-03-03 14:27:06,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:27:06,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495483399] [2025-03-03 14:27:06,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:27:06,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:27:06,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-03 14:27:06,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-03 14:27:06,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:27:06,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:27:06,125 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:27:06,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:27:06,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495483399] [2025-03-03 14:27:06,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495483399] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:27:06,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:27:06,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:27:06,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891470303] [2025-03-03 14:27:06,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:27:06,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:27:06,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:27:06,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:27:06,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:27:06,127 INFO L87 Difference]: Start difference. First operand 1503 states and 2511 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:27:06,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:27:06,213 INFO L93 Difference]: Finished difference Result 3484 states and 5870 transitions. [2025-03-03 14:27:06,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:27:06,214 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 122 [2025-03-03 14:27:06,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:27:06,227 INFO L225 Difference]: With dead ends: 3484 [2025-03-03 14:27:06,228 INFO L226 Difference]: Without dead ends: 2242 [2025-03-03 14:27:06,232 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:27:06,233 INFO L435 NwaCegarLoop]: 500 mSDtfsCounter, 100 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 991 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:27:06,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 991 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:27:06,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2242 states. [2025-03-03 14:27:06,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2242 to 2234. [2025-03-03 14:27:06,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2234 states, 1796 states have (on average 1.6124721603563474) internal successors, (2896), 1802 states have internal predecessors, (2896), 410 states have call successors, (410), 24 states have call predecessors, (410), 27 states have return successors, (457), 409 states have call predecessors, (457), 409 states have call successors, (457) [2025-03-03 14:27:06,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2234 states to 2234 states and 3763 transitions. [2025-03-03 14:27:06,326 INFO L78 Accepts]: Start accepts. Automaton has 2234 states and 3763 transitions. Word has length 122 [2025-03-03 14:27:06,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:27:06,327 INFO L471 AbstractCegarLoop]: Abstraction has 2234 states and 3763 transitions. [2025-03-03 14:27:06,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:27:06,327 INFO L276 IsEmpty]: Start isEmpty. Operand 2234 states and 3763 transitions. [2025-03-03 14:27:06,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-03 14:27:06,335 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:27:06,336 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:27:06,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 14:27:06,336 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:27:06,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:27:06,336 INFO L85 PathProgramCache]: Analyzing trace with hash -991406854, now seen corresponding path program 1 times [2025-03-03 14:27:06,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:27:06,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603382015] [2025-03-03 14:27:06,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:27:06,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:27:06,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-03 14:27:06,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-03 14:27:06,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:27:06,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:27:06,381 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:27:06,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:27:06,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603382015] [2025-03-03 14:27:06,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603382015] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:27:06,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:27:06,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:27:06,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169122927] [2025-03-03 14:27:06,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:27:06,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:27:06,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:27:06,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:27:06,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:27:06,383 INFO L87 Difference]: Start difference. First operand 2234 states and 3763 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:27:06,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:27:06,497 INFO L93 Difference]: Finished difference Result 5162 states and 8762 transitions. [2025-03-03 14:27:06,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:27:06,497 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 123 [2025-03-03 14:27:06,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:27:06,514 INFO L225 Difference]: With dead ends: 5162 [2025-03-03 14:27:06,514 INFO L226 Difference]: Without dead ends: 3404 [2025-03-03 14:27:06,520 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:27:06,520 INFO L435 NwaCegarLoop]: 500 mSDtfsCounter, 98 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 991 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:27:06,520 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 991 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:27:06,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3404 states. [2025-03-03 14:27:06,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3404 to 3396. [2025-03-03 14:27:06,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3396 states, 2779 states have (on average 1.6178481468154011) internal successors, (4496), 2785 states have internal predecessors, (4496), 589 states have call successors, (589), 24 states have call predecessors, (589), 27 states have return successors, (662), 588 states have call predecessors, (662), 588 states have call successors, (662) [2025-03-03 14:27:06,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3396 states to 3396 states and 5747 transitions. [2025-03-03 14:27:06,678 INFO L78 Accepts]: Start accepts. Automaton has 3396 states and 5747 transitions. Word has length 123 [2025-03-03 14:27:06,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:27:06,678 INFO L471 AbstractCegarLoop]: Abstraction has 3396 states and 5747 transitions. [2025-03-03 14:27:06,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:27:06,678 INFO L276 IsEmpty]: Start isEmpty. Operand 3396 states and 5747 transitions. [2025-03-03 14:27:06,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-03 14:27:06,688 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:27:06,688 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:27:06,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 14:27:06,689 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:27:06,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:27:06,689 INFO L85 PathProgramCache]: Analyzing trace with hash 2079614346, now seen corresponding path program 1 times [2025-03-03 14:27:06,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:27:06,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023257868] [2025-03-03 14:27:06,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:27:06,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:27:06,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-03 14:27:06,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-03 14:27:06,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:27:06,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:27:06,732 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:27:06,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:27:06,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023257868] [2025-03-03 14:27:06,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023257868] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:27:06,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:27:06,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:27:06,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815708392] [2025-03-03 14:27:06,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:27:06,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:27:06,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:27:06,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:27:06,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:27:06,733 INFO L87 Difference]: Start difference. First operand 3396 states and 5747 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:27:06,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:27:06,896 INFO L93 Difference]: Finished difference Result 8179 states and 13922 transitions. [2025-03-03 14:27:06,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:27:06,896 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 124 [2025-03-03 14:27:06,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:27:06,927 INFO L225 Difference]: With dead ends: 8179 [2025-03-03 14:27:06,927 INFO L226 Difference]: Without dead ends: 5506 [2025-03-03 14:27:06,938 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:27:06,939 INFO L435 NwaCegarLoop]: 518 mSDtfsCounter, 96 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 1015 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:27:06,939 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 1015 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:27:06,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5506 states. [2025-03-03 14:27:07,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5506 to 5498. [2025-03-03 14:27:07,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5498 states, 4505 states have (on average 1.6122086570477248) internal successors, (7263), 4511 states have internal predecessors, (7263), 965 states have call successors, (965), 24 states have call predecessors, (965), 27 states have return successors, (1082), 964 states have call predecessors, (1082), 964 states have call successors, (1082) [2025-03-03 14:27:07,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5498 states to 5498 states and 9310 transitions. [2025-03-03 14:27:07,211 INFO L78 Accepts]: Start accepts. Automaton has 5498 states and 9310 transitions. Word has length 124 [2025-03-03 14:27:07,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:27:07,211 INFO L471 AbstractCegarLoop]: Abstraction has 5498 states and 9310 transitions. [2025-03-03 14:27:07,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:27:07,211 INFO L276 IsEmpty]: Start isEmpty. Operand 5498 states and 9310 transitions. [2025-03-03 14:27:07,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-03 14:27:07,226 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:27:07,226 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:27:07,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 14:27:07,226 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:27:07,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:27:07,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1200912167, now seen corresponding path program 1 times [2025-03-03 14:27:07,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:27:07,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197906837] [2025-03-03 14:27:07,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:27:07,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:27:07,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-03 14:27:07,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-03 14:27:07,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:27:07,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:27:07,299 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:27:07,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:27:07,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197906837] [2025-03-03 14:27:07,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197906837] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:27:07,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:27:07,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:27:07,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99700862] [2025-03-03 14:27:07,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:27:07,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:27:07,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:27:07,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:27:07,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:27:07,302 INFO L87 Difference]: Start difference. First operand 5498 states and 9310 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:27:07,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:27:07,481 INFO L93 Difference]: Finished difference Result 13496 states and 23007 transitions. [2025-03-03 14:27:07,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:27:07,482 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 125 [2025-03-03 14:27:07,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:27:07,538 INFO L225 Difference]: With dead ends: 13496 [2025-03-03 14:27:07,538 INFO L226 Difference]: Without dead ends: 9117 [2025-03-03 14:27:07,560 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:27:07,561 INFO L435 NwaCegarLoop]: 502 mSDtfsCounter, 94 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 996 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:27:07,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 996 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:27:07,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9117 states. [2025-03-03 14:27:08,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9117 to 9109. [2025-03-03 14:27:08,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9109 states, 7510 states have (on average 1.610918774966711) internal successors, (12098), 7516 states have internal predecessors, (12098), 1571 states have call successors, (1571), 24 states have call predecessors, (1571), 27 states have return successors, (1766), 1570 states have call predecessors, (1766), 1570 states have call successors, (1766) [2025-03-03 14:27:08,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9109 states to 9109 states and 15435 transitions. [2025-03-03 14:27:08,106 INFO L78 Accepts]: Start accepts. Automaton has 9109 states and 15435 transitions. Word has length 125 [2025-03-03 14:27:08,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:27:08,107 INFO L471 AbstractCegarLoop]: Abstraction has 9109 states and 15435 transitions. [2025-03-03 14:27:08,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:27:08,107 INFO L276 IsEmpty]: Start isEmpty. Operand 9109 states and 15435 transitions. [2025-03-03 14:27:08,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-03 14:27:08,129 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:27:08,129 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:27:08,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 14:27:08,129 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:27:08,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:27:08,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1945539573, now seen corresponding path program 1 times [2025-03-03 14:27:08,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:27:08,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847410429] [2025-03-03 14:27:08,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:27:08,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:27:08,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-03 14:27:08,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-03 14:27:08,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:27:08,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:27:08,183 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:27:08,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:27:08,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847410429] [2025-03-03 14:27:08,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847410429] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:27:08,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:27:08,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:27:08,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008587840] [2025-03-03 14:27:08,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:27:08,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:27:08,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:27:08,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:27:08,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:27:08,186 INFO L87 Difference]: Start difference. First operand 9109 states and 15435 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:27:08,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:27:08,558 INFO L93 Difference]: Finished difference Result 23478 states and 39965 transitions. [2025-03-03 14:27:08,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:27:08,559 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 126 [2025-03-03 14:27:08,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:27:08,615 INFO L225 Difference]: With dead ends: 23478 [2025-03-03 14:27:08,616 INFO L226 Difference]: Without dead ends: 15933 [2025-03-03 14:27:08,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-03 14:27:08,637 INFO L435 NwaCegarLoop]: 520 mSDtfsCounter, 92 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 1020 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:27:08,638 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 1020 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:27:08,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15933 states. [2025-03-03 14:27:09,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15933 to 15925. [2025-03-03 14:27:09,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15925 states, 13123 states have (on average 1.6026061114074526) internal successors, (21031), 13129 states have internal predecessors, (21031), 2774 states have call successors, (2774), 24 states have call predecessors, (2774), 27 states have return successors, (3113), 2773 states have call predecessors, (3113), 2773 states have call successors, (3113) [2025-03-03 14:27:09,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15925 states to 15925 states and 26918 transitions. [2025-03-03 14:27:09,214 INFO L78 Accepts]: Start accepts. Automaton has 15925 states and 26918 transitions. Word has length 126 [2025-03-03 14:27:09,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:27:09,215 INFO L471 AbstractCegarLoop]: Abstraction has 15925 states and 26918 transitions. [2025-03-03 14:27:09,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:27:09,216 INFO L276 IsEmpty]: Start isEmpty. Operand 15925 states and 26918 transitions. [2025-03-03 14:27:09,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-03 14:27:09,244 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:27:09,245 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:27:09,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 14:27:09,245 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:27:09,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:27:09,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1931832312, now seen corresponding path program 1 times [2025-03-03 14:27:09,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:27:09,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302183052] [2025-03-03 14:27:09,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:27:09,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:27:09,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-03 14:27:09,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-03 14:27:09,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:27:09,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:27:09,300 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:27:09,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:27:09,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302183052] [2025-03-03 14:27:09,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302183052] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:27:09,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:27:09,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:27:09,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025641625] [2025-03-03 14:27:09,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:27:09,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:27:09,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:27:09,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:27:09,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:27:09,301 INFO L87 Difference]: Start difference. First operand 15925 states and 26918 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:27:10,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:27:10,062 INFO L93 Difference]: Finished difference Result 42049 states and 71427 transitions. [2025-03-03 14:27:10,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:27:10,063 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 127 [2025-03-03 14:27:10,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:27:10,182 INFO L225 Difference]: With dead ends: 42049 [2025-03-03 14:27:10,182 INFO L226 Difference]: Without dead ends: 28322 [2025-03-03 14:27:10,237 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:27:10,238 INFO L435 NwaCegarLoop]: 500 mSDtfsCounter, 90 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 994 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:27:10,238 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 994 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:27:10,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28322 states. [2025-03-03 14:27:11,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28322 to 28314. [2025-03-03 14:27:11,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28314 states, 23473 states have (on average 1.5989434669620415) internal successors, (37532), 23479 states have internal predecessors, (37532), 4813 states have call successors, (4813), 24 states have call predecessors, (4813), 27 states have return successors, (5426), 4812 states have call predecessors, (5426), 4812 states have call successors, (5426) [2025-03-03 14:27:11,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28314 states to 28314 states and 47771 transitions. [2025-03-03 14:27:11,420 INFO L78 Accepts]: Start accepts. Automaton has 28314 states and 47771 transitions. Word has length 127 [2025-03-03 14:27:11,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:27:11,421 INFO L471 AbstractCegarLoop]: Abstraction has 28314 states and 47771 transitions. [2025-03-03 14:27:11,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:27:11,421 INFO L276 IsEmpty]: Start isEmpty. Operand 28314 states and 47771 transitions. [2025-03-03 14:27:11,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-03 14:27:11,451 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:27:11,451 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:27:11,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 14:27:11,452 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:27:11,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:27:11,452 INFO L85 PathProgramCache]: Analyzing trace with hash 39253868, now seen corresponding path program 1 times [2025-03-03 14:27:11,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:27:11,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946500551] [2025-03-03 14:27:11,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:27:11,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:27:11,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-03 14:27:11,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-03 14:27:11,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:27:11,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:27:11,501 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:27:11,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:27:11,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946500551] [2025-03-03 14:27:11,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946500551] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:27:11,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:27:11,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:27:11,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812076469] [2025-03-03 14:27:11,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:27:11,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:27:11,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:27:11,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:27:11,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:27:11,503 INFO L87 Difference]: Start difference. First operand 28314 states and 47771 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:27:12,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:27:12,590 INFO L93 Difference]: Finished difference Result 77031 states and 130479 transitions. [2025-03-03 14:27:12,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:27:12,591 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 128 [2025-03-03 14:27:12,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:27:12,818 INFO L225 Difference]: With dead ends: 77031 [2025-03-03 14:27:12,818 INFO L226 Difference]: Without dead ends: 51678 [2025-03-03 14:27:12,891 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:27:12,891 INFO L435 NwaCegarLoop]: 500 mSDtfsCounter, 88 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 994 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:27:12,891 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 994 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:27:12,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51678 states. [2025-03-03 14:27:14,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51678 to 51670. [2025-03-03 14:27:14,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51670 states, 43114 states have (on average 1.593728255323097) internal successors, (68712), 43120 states have internal predecessors, (68712), 8528 states have call successors, (8528), 24 states have call predecessors, (8528), 27 states have return successors, (9673), 8527 states have call predecessors, (9673), 8527 states have call successors, (9673) [2025-03-03 14:27:14,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51670 states to 51670 states and 86913 transitions. [2025-03-03 14:27:14,977 INFO L78 Accepts]: Start accepts. Automaton has 51670 states and 86913 transitions. Word has length 128 [2025-03-03 14:27:14,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:27:14,978 INFO L471 AbstractCegarLoop]: Abstraction has 51670 states and 86913 transitions. [2025-03-03 14:27:14,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:27:14,978 INFO L276 IsEmpty]: Start isEmpty. Operand 51670 states and 86913 transitions. [2025-03-03 14:27:15,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-03 14:27:15,012 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:27:15,012 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:27:15,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 14:27:15,012 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:27:15,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:27:15,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1143660151, now seen corresponding path program 1 times [2025-03-03 14:27:15,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:27:15,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074878582] [2025-03-03 14:27:15,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:27:15,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:27:15,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-03 14:27:15,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-03 14:27:15,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:27:15,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:27:15,067 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:27:15,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:27:15,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074878582] [2025-03-03 14:27:15,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074878582] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:27:15,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:27:15,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:27:15,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716040530] [2025-03-03 14:27:15,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:27:15,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:27:15,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:27:15,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:27:15,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:27:15,070 INFO L87 Difference]: Start difference. First operand 51670 states and 86913 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:27:16,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:27:16,825 INFO L93 Difference]: Finished difference Result 96292 states and 162330 transitions. [2025-03-03 14:27:16,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:27:16,825 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 129 [2025-03-03 14:27:16,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:27:17,268 INFO L225 Difference]: With dead ends: 96292 [2025-03-03 14:27:17,269 INFO L226 Difference]: Without dead ends: 96104 [2025-03-03 14:27:17,316 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:27:17,319 INFO L435 NwaCegarLoop]: 502 mSDtfsCounter, 83 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 1000 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:27:17,319 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 1000 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:27:17,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96104 states. [2025-03-03 14:27:20,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96104 to 96096. [2025-03-03 14:27:20,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96096 states, 80741 states have (on average 1.5868765559009672) internal successors, (128126), 80747 states have internal predecessors, (128126), 15327 states have call successors, (15327), 24 states have call predecessors, (15327), 27 states have return successors, (17518), 15326 states have call predecessors, (17518), 15326 states have call successors, (17518) [2025-03-03 14:27:20,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96096 states to 96096 states and 160971 transitions. [2025-03-03 14:27:20,892 INFO L78 Accepts]: Start accepts. Automaton has 96096 states and 160971 transitions. Word has length 129 [2025-03-03 14:27:20,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:27:20,893 INFO L471 AbstractCegarLoop]: Abstraction has 96096 states and 160971 transitions. [2025-03-03 14:27:20,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:27:20,893 INFO L276 IsEmpty]: Start isEmpty. Operand 96096 states and 160971 transitions. [2025-03-03 14:27:20,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-03 14:27:20,936 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:27:20,937 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:27:20,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 14:27:20,937 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:27:20,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:27:20,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1093096205, now seen corresponding path program 1 times [2025-03-03 14:27:20,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:27:20,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179297785] [2025-03-03 14:27:20,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:27:20,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:27:20,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-03 14:27:20,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-03 14:27:20,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:27:20,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:27:21,270 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:27:21,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:27:21,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179297785] [2025-03-03 14:27:21,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179297785] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:27:21,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:27:21,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-03 14:27:21,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610365489] [2025-03-03 14:27:21,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:27:21,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 14:27:21,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:27:21,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 14:27:21,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2025-03-03 14:27:21,272 INFO L87 Difference]: Start difference. First operand 96096 states and 160971 transitions. Second operand has 14 states, 12 states have (on average 7.416666666666667) internal successors, (89), 12 states have internal predecessors, (89), 6 states have call successors, (15), 3 states have call predecessors, (15), 4 states have return successors, (13), 6 states have call predecessors, (13), 6 states have call successors, (13) [2025-03-03 14:27:27,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:27:27,439 INFO L93 Difference]: Finished difference Result 191709 states and 326575 transitions. [2025-03-03 14:27:27,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-03 14:27:27,440 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.416666666666667) internal successors, (89), 12 states have internal predecessors, (89), 6 states have call successors, (15), 3 states have call predecessors, (15), 4 states have return successors, (13), 6 states have call predecessors, (13), 6 states have call successors, (13) Word has length 130 [2025-03-03 14:27:27,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:27:28,192 INFO L225 Difference]: With dead ends: 191709 [2025-03-03 14:27:28,192 INFO L226 Difference]: Without dead ends: 191527 [2025-03-03 14:27:28,285 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=159, Invalid=833, Unknown=0, NotChecked=0, Total=992 [2025-03-03 14:27:28,286 INFO L435 NwaCegarLoop]: 688 mSDtfsCounter, 1448 mSDsluCounter, 6737 mSDsCounter, 0 mSdLazyCounter, 1551 mSolverCounterSat, 415 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1448 SdHoareTripleChecker+Valid, 7425 SdHoareTripleChecker+Invalid, 1966 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 415 IncrementalHoareTripleChecker+Valid, 1551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:27:28,286 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1448 Valid, 7425 Invalid, 1966 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [415 Valid, 1551 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 14:27:28,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191527 states.