./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec27_product24.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/email_spec27_product24.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 f1a760a25f6e6d96f820367881f3fbbc32febc8ce03434205938078db6a21524 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 14:22:15,473 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 14:22:15,537 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 14:22:15,542 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 14:22:15,542 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 14:22:15,563 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 14:22:15,563 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 14:22:15,564 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 14:22:15,564 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 14:22:15,564 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 14:22:15,565 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 14:22:15,565 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 14:22:15,565 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 14:22:15,565 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 14:22:15,566 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 14:22:15,566 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 14:22:15,566 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 14:22:15,566 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 14:22:15,566 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 14:22:15,566 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 14:22:15,566 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 14:22:15,566 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 14:22:15,566 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 14:22:15,566 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 14:22:15,566 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 14:22:15,566 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 14:22:15,566 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 14:22:15,566 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 14:22:15,567 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 14:22:15,567 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 14:22:15,567 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 14:22:15,567 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 14:22:15,567 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:22:15,567 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 14:22:15,567 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 14:22:15,567 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 14:22:15,567 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 14:22:15,567 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 14:22:15,567 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 14:22:15,567 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 14:22:15,567 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 14:22:15,567 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 14:22:15,567 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 14:22:15,567 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 -> f1a760a25f6e6d96f820367881f3fbbc32febc8ce03434205938078db6a21524 [2025-03-03 14:22:15,769 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 14:22:15,776 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 14:22:15,777 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 14:22:15,778 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 14:22:15,778 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 14:22:15,779 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec27_product24.cil.c [2025-03-03 14:22:16,939 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92376c749/a4cb565130d546d6a307af1b64576812/FLAGce811448a [2025-03-03 14:22:17,259 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 14:22:17,259 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec27_product24.cil.c [2025-03-03 14:22:17,281 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92376c749/a4cb565130d546d6a307af1b64576812/FLAGce811448a [2025-03-03 14:22:17,485 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92376c749/a4cb565130d546d6a307af1b64576812 [2025-03-03 14:22:17,486 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 14:22:17,487 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 14:22:17,488 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 14:22:17,488 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 14:22:17,491 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 14:22:17,491 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:22:17" (1/1) ... [2025-03-03 14:22:17,492 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35b15a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:17, skipping insertion in model container [2025-03-03 14:22:17,492 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:22:17" (1/1) ... [2025-03-03 14:22:17,534 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 14:22:17,935 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec27_product24.cil.c[62587,62600] [2025-03-03 14:22:17,941 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:22:17,955 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 14:22:17,961 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [48] [2025-03-03 14:22:17,962 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [167] [2025-03-03 14:22:17,962 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"VerifyForward_spec.i","") [571] [2025-03-03 14:22:17,962 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [605] [2025-03-03 14:22:17,962 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [622] [2025-03-03 14:22:17,963 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [1701] [2025-03-03 14:22:17,963 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [2026] [2025-03-03 14:22:17,963 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [2255] [2025-03-03 14:22:17,963 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [2543] [2025-03-03 14:22:17,963 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [2909] [2025-03-03 14:22:17,963 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [2918] [2025-03-03 14:22:18,038 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec27_product24.cil.c[62587,62600] [2025-03-03 14:22:18,039 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:22:18,069 INFO L204 MainTranslator]: Completed translation [2025-03-03 14:22:18,070 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:18 WrapperNode [2025-03-03 14:22:18,071 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 14:22:18,072 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 14:22:18,072 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 14:22:18,072 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 14:22:18,077 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:18" (1/1) ... [2025-03-03 14:22:18,099 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:18" (1/1) ... [2025-03-03 14:22:18,144 INFO L138 Inliner]: procedures = 130, calls = 194, calls flagged for inlining = 62, calls inlined = 57, statements flattened = 1006 [2025-03-03 14:22:18,145 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 14:22:18,145 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 14:22:18,145 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 14:22:18,145 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 14:22:18,151 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:18" (1/1) ... [2025-03-03 14:22:18,152 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:18" (1/1) ... [2025-03-03 14:22:18,155 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:18" (1/1) ... [2025-03-03 14:22:18,179 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 4, 4, 4]. 29 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 4, 4, 4]. The 0 writes are split as follows [0, 0, 0, 0]. [2025-03-03 14:22:18,179 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:18" (1/1) ... [2025-03-03 14:22:18,179 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:18" (1/1) ... [2025-03-03 14:22:18,192 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:18" (1/1) ... [2025-03-03 14:22:18,198 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:18" (1/1) ... [2025-03-03 14:22:18,201 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:18" (1/1) ... [2025-03-03 14:22:18,206 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:18" (1/1) ... [2025-03-03 14:22:18,212 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 14:22:18,215 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 14:22:18,215 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 14:22:18,216 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 14:22:18,216 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:18" (1/1) ... [2025-03-03 14:22:18,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:22:18,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:22:18,241 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 14:22:18,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 14:22:18,262 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-03-03 14:22:18,263 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-03-03 14:22:18,263 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-03-03 14:22:18,263 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-03-03 14:22:18,263 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2025-03-03 14:22:18,263 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2025-03-03 14:22:18,263 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-03-03 14:22:18,264 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-03-03 14:22:18,264 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2025-03-03 14:22:18,264 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2025-03-03 14:22:18,264 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-03-03 14:22:18,264 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-03-03 14:22:18,265 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-03-03 14:22:18,265 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-03-03 14:22:18,265 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2025-03-03 14:22:18,265 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2025-03-03 14:22:18,265 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-03-03 14:22:18,265 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-03-03 14:22:18,265 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 14:22:18,265 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2025-03-03 14:22:18,265 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2025-03-03 14:22:18,265 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-03-03 14:22:18,265 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-03-03 14:22:18,265 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-03-03 14:22:18,265 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-03-03 14:22:18,265 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-03-03 14:22:18,265 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-03-03 14:22:18,265 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2025-03-03 14:22:18,265 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2025-03-03 14:22:18,265 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2025-03-03 14:22:18,265 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2025-03-03 14:22:18,265 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-03-03 14:22:18,265 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-03-03 14:22:18,265 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-03-03 14:22:18,265 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-03-03 14:22:18,265 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-03-03 14:22:18,265 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-03-03 14:22:18,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 14:22:18,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 14:22:18,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-03 14:22:18,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-03 14:22:18,265 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-03-03 14:22:18,265 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-03-03 14:22:18,266 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 14:22:18,266 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 14:22:18,445 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 14:22:18,447 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 14:22:18,739 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1631-1: getClientForwardReceiver_#res#1 := getClientForwardReceiver_~retValue_acc~30#1; [2025-03-03 14:22:18,739 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1243-1: getClientPrivateKey_#res#1 := getClientPrivateKey_~retValue_acc~24#1; [2025-03-03 14:22:18,739 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1196-1: getClientAutoResponse_#res#1 := getClientAutoResponse_~retValue_acc~23#1; [2025-03-03 14:22:18,739 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L215-1: getEmailId_#res#1 := getEmailId_~retValue_acc~4#1; [2025-03-03 14:22:18,739 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1917-1: isKeyPairValid_#res#1 := isKeyPairValid_~retValue_acc~36#1; [2025-03-03 14:22:18,739 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1678-1: getClientId_#res#1 := getClientId_~retValue_acc~31#1; [2025-03-03 14:22:18,751 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L478: #res := ~retValue_acc~11; [2025-03-03 14:22:18,757 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L552: #res := ~retValue_acc~13; [2025-03-03 14:22:18,783 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1335: #res#1 := ~retValue_acc~26#1; [2025-03-03 14:22:18,783 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1290-1: getClientKeyringSize_#res#1 := getClientKeyringSize_~retValue_acc~25#1; [2025-03-03 14:22:18,806 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1559: #res := ~retValue_acc~29; [2025-03-03 14:22:18,816 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L164-1: createEmail_#res#1 := createEmail_~retValue_acc~2#1; [2025-03-03 14:22:18,823 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L515: #res := ~retValue_acc~12; [2025-03-03 14:22:18,845 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L289: #res := ~retValue_acc~6; [2025-03-03 14:22:19,087 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1505-1: getClientKeyringPublicKey_#res#1 := getClientKeyringPublicKey_~retValue_acc~28#1; [2025-03-03 14:22:19,087 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1398-1: getClientKeyringUser_#res#1 := getClientKeyringUser_~retValue_acc~27#1; [2025-03-03 14:22:19,087 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1874-1: is_queue_empty_#res#1 := is_queue_empty_~retValue_acc~33#1; [2025-03-03 14:22:19,087 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1883-1: get_queued_client_#res#1 := get_queued_client_~retValue_acc~34#1; [2025-03-03 14:22:19,087 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1892-1: get_queued_email_#res#1 := get_queued_email_~retValue_acc~35#1; [2025-03-03 14:22:19,087 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2950-1: valid_product_#res#1 := valid_product_~retValue_acc~42#1; [2025-03-03 14:22:19,092 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L252: #res := ~retValue_acc~5; [2025-03-03 14:22:19,094 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L140: #res := ~retValue_acc~0; [2025-03-03 14:22:19,209 INFO L? ?]: Removed 454 outVars from TransFormulas that were not future-live. [2025-03-03 14:22:19,209 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 14:22:19,226 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 14:22:19,227 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 14:22:19,227 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:22:19 BoogieIcfgContainer [2025-03-03 14:22:19,227 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 14:22:19,231 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 14:22:19,231 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 14:22:19,235 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 14:22:19,235 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 02:22:17" (1/3) ... [2025-03-03 14:22:19,235 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ef1042 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:22:19, skipping insertion in model container [2025-03-03 14:22:19,236 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:18" (2/3) ... [2025-03-03 14:22:19,236 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ef1042 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:22:19, skipping insertion in model container [2025-03-03 14:22:19,236 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:22:19" (3/3) ... [2025-03-03 14:22:19,237 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec27_product24.cil.c [2025-03-03 14:22:19,249 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 14:22:19,252 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec27_product24.cil.c that has 20 procedures, 332 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 14:22:19,326 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 14:22:19,341 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;@4da20f4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 14:22:19,341 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 14:22:19,344 INFO L276 IsEmpty]: Start isEmpty. Operand has 332 states, 261 states have (on average 1.5210727969348659) internal successors, (397), 263 states have internal predecessors, (397), 50 states have call successors, (50), 19 states have call predecessors, (50), 19 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-03 14:22:19,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-03 14:22:19,358 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:19,358 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:19,359 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:19,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:19,364 INFO L85 PathProgramCache]: Analyzing trace with hash -444329989, now seen corresponding path program 1 times [2025-03-03 14:22:19,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:19,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929894849] [2025-03-03 14:22:19,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:19,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:19,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-03 14:22:19,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-03 14:22:19,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:19,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:19,888 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:22:19,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:19,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929894849] [2025-03-03 14:22:19,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929894849] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:22:19,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1255822813] [2025-03-03 14:22:19,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:19,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:22:19,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:22:19,895 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:22:19,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 14:22:20,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-03 14:22:20,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-03 14:22:20,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:20,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:20,186 INFO L256 TraceCheckSpWp]: Trace formula consists of 1036 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 14:22:20,192 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:22:20,208 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:22:20,210 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:22:20,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1255822813] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:20,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:22:20,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 5 [2025-03-03 14:22:20,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877328955] [2025-03-03 14:22:20,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:20,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 14:22:20,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:20,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 14:22:20,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:22:20,232 INFO L87 Difference]: Start difference. First operand has 332 states, 261 states have (on average 1.5210727969348659) internal successors, (397), 263 states have internal predecessors, (397), 50 states have call successors, (50), 19 states have call predecessors, (50), 19 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) Second operand has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-03 14:22:20,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:20,280 INFO L93 Difference]: Finished difference Result 506 states and 742 transitions. [2025-03-03 14:22:20,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 14:22:20,281 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 108 [2025-03-03 14:22:20,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:20,289 INFO L225 Difference]: With dead ends: 506 [2025-03-03 14:22:20,289 INFO L226 Difference]: Without dead ends: 325 [2025-03-03 14:22:20,292 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:22:20,293 INFO L435 NwaCegarLoop]: 494 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, 494 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:20,294 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:20,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2025-03-03 14:22:20,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 325. [2025-03-03 14:22:20,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 255 states have (on average 1.5176470588235293) internal successors, (387), 256 states have internal predecessors, (387), 50 states have call successors, (50), 19 states have call predecessors, (50), 19 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2025-03-03 14:22:20,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 486 transitions. [2025-03-03 14:22:20,336 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 486 transitions. Word has length 108 [2025-03-03 14:22:20,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:20,337 INFO L471 AbstractCegarLoop]: Abstraction has 325 states and 486 transitions. [2025-03-03 14:22:20,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-03 14:22:20,337 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 486 transitions. [2025-03-03 14:22:20,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-03 14:22:20,341 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:20,341 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:20,350 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 14:22:20,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 14:22:20,545 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:20,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:20,546 INFO L85 PathProgramCache]: Analyzing trace with hash -319167683, now seen corresponding path program 1 times [2025-03-03 14:22:20,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:20,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895896279] [2025-03-03 14:22:20,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:20,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:20,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-03 14:22:20,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-03 14:22:20,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:20,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:20,792 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:22:20,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:20,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895896279] [2025-03-03 14:22:20,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895896279] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:22:20,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [302011585] [2025-03-03 14:22:20,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:20,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:22:20,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:22:20,799 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:22:20,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 14:22:20,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-03 14:22:21,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-03 14:22:21,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:21,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:21,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 1037 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 14:22:21,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:22:21,110 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:22:21,110 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:22:21,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [302011585] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:21,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:22:21,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 14:22:21,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773061801] [2025-03-03 14:22:21,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:21,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:22:21,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:21,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:22:21,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:22:21,112 INFO L87 Difference]: Start difference. First operand 325 states and 486 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-03 14:22:21,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:21,160 INFO L93 Difference]: Finished difference Result 495 states and 723 transitions. [2025-03-03 14:22:21,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:22:21,161 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 109 [2025-03-03 14:22:21,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:21,167 INFO L225 Difference]: With dead ends: 495 [2025-03-03 14:22:21,167 INFO L226 Difference]: Without dead ends: 327 [2025-03-03 14:22:21,168 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:22:21,168 INFO L435 NwaCegarLoop]: 485 mSDtfsCounter, 0 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 968 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:21,169 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 968 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:21,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2025-03-03 14:22:21,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 327. [2025-03-03 14:22:21,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 257 states have (on average 1.5136186770428015) internal successors, (389), 258 states have internal predecessors, (389), 50 states have call successors, (50), 19 states have call predecessors, (50), 19 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2025-03-03 14:22:21,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 488 transitions. [2025-03-03 14:22:21,196 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 488 transitions. Word has length 109 [2025-03-03 14:22:21,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:21,196 INFO L471 AbstractCegarLoop]: Abstraction has 327 states and 488 transitions. [2025-03-03 14:22:21,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-03 14:22:21,196 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 488 transitions. [2025-03-03 14:22:21,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-03 14:22:21,198 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:21,198 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, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:21,206 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 14:22:21,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-03 14:22:21,399 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:21,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:21,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1114538399, now seen corresponding path program 1 times [2025-03-03 14:22:21,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:21,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928695096] [2025-03-03 14:22:21,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:21,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:21,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-03 14:22:21,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-03 14:22:21,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:21,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:21,604 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:22:21,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:21,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928695096] [2025-03-03 14:22:21,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928695096] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:22:21,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1301476326] [2025-03-03 14:22:21,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:21,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:22:21,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:22:21,608 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:22:21,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 14:22:21,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-03 14:22:21,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-03 14:22:21,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:21,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:21,867 INFO L256 TraceCheckSpWp]: Trace formula consists of 1062 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:22:21,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:22:21,889 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:22:21,889 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:22:21,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1301476326] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:21,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:22:21,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 14:22:21,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470598645] [2025-03-03 14:22:21,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:21,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:22:21,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:21,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:22:21,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:22:21,891 INFO L87 Difference]: Start difference. First operand 327 states and 488 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-03 14:22:21,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:21,915 INFO L93 Difference]: Finished difference Result 688 states and 1042 transitions. [2025-03-03 14:22:21,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:22:21,917 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 117 [2025-03-03 14:22:21,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:21,921 INFO L225 Difference]: With dead ends: 688 [2025-03-03 14:22:21,922 INFO L226 Difference]: Without dead ends: 388 [2025-03-03 14:22:21,925 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:22:21,925 INFO L435 NwaCegarLoop]: 497 mSDtfsCounter, 115 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 937 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:21,926 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 937 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:21,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2025-03-03 14:22:21,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 380. [2025-03-03 14:22:21,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 299 states have (on average 1.5317725752508362) internal successors, (458), 300 states have internal predecessors, (458), 61 states have call successors, (61), 19 states have call predecessors, (61), 19 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-03 14:22:21,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 579 transitions. [2025-03-03 14:22:21,963 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 579 transitions. Word has length 117 [2025-03-03 14:22:21,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:21,963 INFO L471 AbstractCegarLoop]: Abstraction has 380 states and 579 transitions. [2025-03-03 14:22:21,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-03 14:22:21,963 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 579 transitions. [2025-03-03 14:22:21,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-03 14:22:21,966 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:21,966 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, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:21,974 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 14:22:22,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:22:22,167 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:22,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:22,168 INFO L85 PathProgramCache]: Analyzing trace with hash -764223527, now seen corresponding path program 1 times [2025-03-03 14:22:22,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:22,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953348159] [2025-03-03 14:22:22,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:22,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:22,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-03 14:22:22,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-03 14:22:22,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:22,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:22,337 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:22:22,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:22,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953348159] [2025-03-03 14:22:22,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953348159] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:22:22,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1848264352] [2025-03-03 14:22:22,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:22,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:22:22,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:22:22,340 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:22:22,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 14:22:22,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-03 14:22:22,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-03 14:22:22,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:22,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:22,597 INFO L256 TraceCheckSpWp]: Trace formula consists of 1067 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 14:22:22,604 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:22:22,653 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:22:22,653 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:22:22,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1848264352] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:22,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:22:22,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-03-03 14:22:22,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503718872] [2025-03-03 14:22:22,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:22,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:22:22,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:22,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:22:22,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:22:22,655 INFO L87 Difference]: Start difference. First operand 380 states and 579 transitions. Second operand has 5 states, 4 states have (on average 20.25) internal successors, (81), 5 states have internal predecessors, (81), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-03 14:22:22,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:22,722 INFO L93 Difference]: Finished difference Result 751 states and 1148 transitions. [2025-03-03 14:22:22,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:22:22,724 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.25) internal successors, (81), 5 states have internal predecessors, (81), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) Word has length 118 [2025-03-03 14:22:22,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:22,727 INFO L225 Difference]: With dead ends: 751 [2025-03-03 14:22:22,727 INFO L226 Difference]: Without dead ends: 382 [2025-03-03 14:22:22,729 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:22:22,730 INFO L435 NwaCegarLoop]: 478 mSDtfsCounter, 2 mSDsluCounter, 1423 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1901 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:22,731 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1901 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:22,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2025-03-03 14:22:22,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2025-03-03 14:22:22,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 300 states have (on average 1.53) internal successors, (459), 302 states have internal predecessors, (459), 61 states have call successors, (61), 19 states have call predecessors, (61), 20 states have return successors, (62), 60 states have call predecessors, (62), 60 states have call successors, (62) [2025-03-03 14:22:22,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 582 transitions. [2025-03-03 14:22:22,751 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 582 transitions. Word has length 118 [2025-03-03 14:22:22,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:22,751 INFO L471 AbstractCegarLoop]: Abstraction has 382 states and 582 transitions. [2025-03-03 14:22:22,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.25) internal successors, (81), 5 states have internal predecessors, (81), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-03 14:22:22,753 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 582 transitions. [2025-03-03 14:22:22,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-03 14:22:22,754 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:22,754 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, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:22,763 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 14:22:22,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:22:22,959 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:22,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:22,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1049117035, now seen corresponding path program 1 times [2025-03-03 14:22:22,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:22,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370974963] [2025-03-03 14:22:22,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:22,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:22,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-03 14:22:22,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-03 14:22:22,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:22,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:23,101 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:22:23,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:23,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370974963] [2025-03-03 14:22:23,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370974963] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:22:23,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1433980033] [2025-03-03 14:22:23,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:23,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:22:23,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:22:23,104 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:22:23,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 14:22:23,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-03 14:22:23,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-03 14:22:23,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:23,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:23,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 1068 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 14:22:23,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:22:23,410 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:22:23,410 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:22:23,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1433980033] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:23,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:22:23,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-03-03 14:22:23,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778121227] [2025-03-03 14:22:23,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:23,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:22:23,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:23,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:22:23,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:22:23,412 INFO L87 Difference]: Start difference. First operand 382 states and 582 transitions. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-03 14:22:23,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:23,479 INFO L93 Difference]: Finished difference Result 753 states and 1153 transitions. [2025-03-03 14:22:23,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:22:23,480 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 119 [2025-03-03 14:22:23,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:23,482 INFO L225 Difference]: With dead ends: 753 [2025-03-03 14:22:23,482 INFO L226 Difference]: Without dead ends: 384 [2025-03-03 14:22:23,484 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:22:23,485 INFO L435 NwaCegarLoop]: 476 mSDtfsCounter, 2 mSDsluCounter, 1411 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1887 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:23,485 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1887 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:23,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2025-03-03 14:22:23,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 384. [2025-03-03 14:22:23,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 301 states have (on average 1.5282392026578073) internal successors, (460), 304 states have internal predecessors, (460), 61 states have call successors, (61), 19 states have call predecessors, (61), 21 states have return successors, (67), 60 states have call predecessors, (67), 60 states have call successors, (67) [2025-03-03 14:22:23,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 588 transitions. [2025-03-03 14:22:23,501 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 588 transitions. Word has length 119 [2025-03-03 14:22:23,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:23,501 INFO L471 AbstractCegarLoop]: Abstraction has 384 states and 588 transitions. [2025-03-03 14:22:23,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-03 14:22:23,501 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 588 transitions. [2025-03-03 14:22:23,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-03 14:22:23,503 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:23,503 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, 1, 1, 1] [2025-03-03 14:22:23,512 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-03 14:22:23,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:22:23,704 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:23,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:23,705 INFO L85 PathProgramCache]: Analyzing trace with hash -1257419389, now seen corresponding path program 1 times [2025-03-03 14:22:23,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:23,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347871525] [2025-03-03 14:22:23,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:23,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:23,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-03 14:22:23,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-03 14:22:23,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:23,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:23,818 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:22:23,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:23,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347871525] [2025-03-03 14:22:23,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347871525] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:23,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:23,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:22:23,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651475316] [2025-03-03 14:22:23,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:23,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:22:23,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:23,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:22:23,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:22:23,819 INFO L87 Difference]: Start difference. First operand 384 states and 588 transitions. Second operand has 5 states, 4 states have (on average 19.75) internal successors, (79), 5 states have internal predecessors, (79), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-03 14:22:23,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:23,865 INFO L93 Difference]: Finished difference Result 745 states and 1144 transitions. [2025-03-03 14:22:23,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:22:23,865 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.75) internal successors, (79), 5 states have internal predecessors, (79), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) Word has length 120 [2025-03-03 14:22:23,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:23,869 INFO L225 Difference]: With dead ends: 745 [2025-03-03 14:22:23,869 INFO L226 Difference]: Without dead ends: 384 [2025-03-03 14:22:23,870 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:22:23,871 INFO L435 NwaCegarLoop]: 479 mSDtfsCounter, 2 mSDsluCounter, 1426 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1905 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:23,871 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1905 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:23,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2025-03-03 14:22:23,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 384. [2025-03-03 14:22:23,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 301 states have (on average 1.5282392026578073) internal successors, (460), 304 states have internal predecessors, (460), 61 states have call successors, (61), 19 states have call predecessors, (61), 21 states have return successors, (66), 60 states have call predecessors, (66), 60 states have call successors, (66) [2025-03-03 14:22:23,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 587 transitions. [2025-03-03 14:22:23,887 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 587 transitions. Word has length 120 [2025-03-03 14:22:23,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:23,888 INFO L471 AbstractCegarLoop]: Abstraction has 384 states and 587 transitions. [2025-03-03 14:22:23,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.75) internal successors, (79), 5 states have internal predecessors, (79), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-03 14:22:23,888 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 587 transitions. [2025-03-03 14:22:23,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-03 14:22:23,890 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:23,890 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, 1, 1, 1, 1, 1] [2025-03-03 14:22:23,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 14:22:23,890 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:23,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:23,890 INFO L85 PathProgramCache]: Analyzing trace with hash -952015011, now seen corresponding path program 2 times [2025-03-03 14:22:23,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:23,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083165050] [2025-03-03 14:22:23,891 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 14:22:23,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:23,909 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 121 statements into 2 equivalence classes. [2025-03-03 14:22:23,915 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 66 of 121 statements. [2025-03-03 14:22:23,915 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-03 14:22:23,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:23,989 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-03 14:22:23,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:23,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083165050] [2025-03-03 14:22:23,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083165050] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:23,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:23,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 14:22:23,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589805064] [2025-03-03 14:22:23,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:23,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:22:23,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:23,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:22:23,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:22:23,991 INFO L87 Difference]: Start difference. First operand 384 states and 587 transitions. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 6 states have internal predecessors, (76), 2 states have call successors, (16), 1 states have call predecessors, (16), 2 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-03 14:22:24,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:24,026 INFO L93 Difference]: Finished difference Result 544 states and 811 transitions. [2025-03-03 14:22:24,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 14:22:24,027 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 6 states have internal predecessors, (76), 2 states have call successors, (16), 1 states have call predecessors, (16), 2 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) Word has length 121 [2025-03-03 14:22:24,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:24,029 INFO L225 Difference]: With dead ends: 544 [2025-03-03 14:22:24,030 INFO L226 Difference]: Without dead ends: 384 [2025-03-03 14:22:24,030 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:22:24,031 INFO L435 NwaCegarLoop]: 481 mSDtfsCounter, 0 mSDsluCounter, 2396 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2877 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:24,031 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2877 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:24,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2025-03-03 14:22:24,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 384. [2025-03-03 14:22:24,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 301 states have (on average 1.5249169435215948) internal successors, (459), 304 states have internal predecessors, (459), 61 states have call successors, (61), 19 states have call predecessors, (61), 21 states have return successors, (66), 60 states have call predecessors, (66), 60 states have call successors, (66) [2025-03-03 14:22:24,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 586 transitions. [2025-03-03 14:22:24,045 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 586 transitions. Word has length 121 [2025-03-03 14:22:24,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:24,046 INFO L471 AbstractCegarLoop]: Abstraction has 384 states and 586 transitions. [2025-03-03 14:22:24,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 6 states have internal predecessors, (76), 2 states have call successors, (16), 1 states have call predecessors, (16), 2 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-03 14:22:24,046 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 586 transitions. [2025-03-03 14:22:24,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-03 14:22:24,048 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:24,048 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:24,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 14:22:24,048 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:24,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:24,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1250813916, now seen corresponding path program 1 times [2025-03-03 14:22:24,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:24,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052213228] [2025-03-03 14:22:24,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:24,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:24,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-03 14:22:24,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-03 14:22:24,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:24,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:24,172 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-03 14:22:24,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:24,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052213228] [2025-03-03 14:22:24,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052213228] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:24,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:24,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:22:24,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998285847] [2025-03-03 14:22:24,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:24,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:22:24,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:24,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:22:24,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:22:24,174 INFO L87 Difference]: Start difference. First operand 384 states and 586 transitions. Second operand has 5 states, 4 states have (on average 21.25) internal successors, (85), 5 states have internal predecessors, (85), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-03 14:22:24,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:24,210 INFO L93 Difference]: Finished difference Result 747 states and 1145 transitions. [2025-03-03 14:22:24,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:22:24,210 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.25) internal successors, (85), 5 states have internal predecessors, (85), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 128 [2025-03-03 14:22:24,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:24,212 INFO L225 Difference]: With dead ends: 747 [2025-03-03 14:22:24,212 INFO L226 Difference]: Without dead ends: 386 [2025-03-03 14:22:24,214 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:22:24,214 INFO L435 NwaCegarLoop]: 479 mSDtfsCounter, 1 mSDsluCounter, 1425 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1904 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:24,214 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1904 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:24,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2025-03-03 14:22:24,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 386. [2025-03-03 14:22:24,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 302 states have (on average 1.5231788079470199) internal successors, (460), 306 states have internal predecessors, (460), 61 states have call successors, (61), 19 states have call predecessors, (61), 22 states have return successors, (68), 60 states have call predecessors, (68), 60 states have call successors, (68) [2025-03-03 14:22:24,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 589 transitions. [2025-03-03 14:22:24,225 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 589 transitions. Word has length 128 [2025-03-03 14:22:24,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:24,226 INFO L471 AbstractCegarLoop]: Abstraction has 386 states and 589 transitions. [2025-03-03 14:22:24,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.25) internal successors, (85), 5 states have internal predecessors, (85), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-03 14:22:24,226 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 589 transitions. [2025-03-03 14:22:24,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-03 14:22:24,227 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:24,227 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:24,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 14:22:24,228 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:24,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:24,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1964069567, now seen corresponding path program 1 times [2025-03-03 14:22:24,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:24,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482757526] [2025-03-03 14:22:24,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:24,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:24,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-03 14:22:24,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-03 14:22:24,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:24,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:24,347 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-03 14:22:24,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:24,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482757526] [2025-03-03 14:22:24,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482757526] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:24,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:24,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 14:22:24,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404004425] [2025-03-03 14:22:24,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:24,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 14:22:24,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:24,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 14:22:24,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:22:24,349 INFO L87 Difference]: Start difference. First operand 386 states and 589 transitions. Second operand has 8 states, 7 states have (on average 12.714285714285714) internal successors, (89), 8 states have internal predecessors, (89), 4 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2025-03-03 14:22:24,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:24,452 INFO L93 Difference]: Finished difference Result 749 states and 1144 transitions. [2025-03-03 14:22:24,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 14:22:24,453 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 12.714285714285714) internal successors, (89), 8 states have internal predecessors, (89), 4 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 129 [2025-03-03 14:22:24,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:24,455 INFO L225 Difference]: With dead ends: 749 [2025-03-03 14:22:24,455 INFO L226 Difference]: Without dead ends: 388 [2025-03-03 14:22:24,456 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:22:24,457 INFO L435 NwaCegarLoop]: 469 mSDtfsCounter, 7 mSDsluCounter, 2785 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 3254 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:24,457 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 3254 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:22:24,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2025-03-03 14:22:24,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 388. [2025-03-03 14:22:24,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 304 states have (on average 1.519736842105263) internal successors, (462), 307 states have internal predecessors, (462), 61 states have call successors, (61), 20 states have call predecessors, (61), 22 states have return successors, (67), 60 states have call predecessors, (67), 60 states have call successors, (67) [2025-03-03 14:22:24,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 590 transitions. [2025-03-03 14:22:24,470 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 590 transitions. Word has length 129 [2025-03-03 14:22:24,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:24,470 INFO L471 AbstractCegarLoop]: Abstraction has 388 states and 590 transitions. [2025-03-03 14:22:24,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 12.714285714285714) internal successors, (89), 8 states have internal predecessors, (89), 4 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2025-03-03 14:22:24,470 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 590 transitions. [2025-03-03 14:22:24,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-03 14:22:24,472 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:24,472 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:24,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 14:22:24,472 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:24,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:24,473 INFO L85 PathProgramCache]: Analyzing trace with hash 704510299, now seen corresponding path program 2 times [2025-03-03 14:22:24,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:24,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271964833] [2025-03-03 14:22:24,473 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 14:22:24,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:24,488 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 130 statements into 2 equivalence classes. [2025-03-03 14:22:24,500 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 130 of 130 statements. [2025-03-03 14:22:24,500 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 14:22:24,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:24,617 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:22:24,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:24,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271964833] [2025-03-03 14:22:24,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271964833] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:24,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:24,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 14:22:24,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582590082] [2025-03-03 14:22:24,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:24,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:22:24,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:24,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:22:24,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:22:24,619 INFO L87 Difference]: Start difference. First operand 388 states and 590 transitions. Second operand has 7 states, 6 states have (on average 14.5) internal successors, (87), 7 states have internal predecessors, (87), 4 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2025-03-03 14:22:24,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:24,686 INFO L93 Difference]: Finished difference Result 749 states and 1148 transitions. [2025-03-03 14:22:24,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:22:24,687 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 14.5) internal successors, (87), 7 states have internal predecessors, (87), 4 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 130 [2025-03-03 14:22:24,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:24,689 INFO L225 Difference]: With dead ends: 749 [2025-03-03 14:22:24,689 INFO L226 Difference]: Without dead ends: 390 [2025-03-03 14:22:24,690 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:22:24,690 INFO L435 NwaCegarLoop]: 477 mSDtfsCounter, 2 mSDsluCounter, 2357 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2834 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:24,690 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2834 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:24,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2025-03-03 14:22:24,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 390. [2025-03-03 14:22:24,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 305 states have (on average 1.518032786885246) internal successors, (463), 309 states have internal predecessors, (463), 61 states have call successors, (61), 20 states have call predecessors, (61), 23 states have return successors, (72), 60 states have call predecessors, (72), 60 states have call successors, (72) [2025-03-03 14:22:24,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 596 transitions. [2025-03-03 14:22:24,704 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 596 transitions. Word has length 130 [2025-03-03 14:22:24,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:24,704 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 596 transitions. [2025-03-03 14:22:24,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 14.5) internal successors, (87), 7 states have internal predecessors, (87), 4 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2025-03-03 14:22:24,704 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 596 transitions. [2025-03-03 14:22:24,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-03 14:22:24,706 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:24,706 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:24,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 14:22:24,706 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:24,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:24,707 INFO L85 PathProgramCache]: Analyzing trace with hash 380179460, now seen corresponding path program 1 times [2025-03-03 14:22:24,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:24,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585012270] [2025-03-03 14:22:24,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:24,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:24,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-03 14:22:24,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-03 14:22:24,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:24,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:24,843 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:22:24,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:24,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585012270] [2025-03-03 14:22:24,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585012270] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:22:24,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [816708253] [2025-03-03 14:22:24,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:24,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:22:24,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:22:24,847 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:22:24,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 14:22:24,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-03 14:22:25,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-03 14:22:25,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:25,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:25,093 INFO L256 TraceCheckSpWp]: Trace formula consists of 1093 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:22:25,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:22:25,131 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:22:25,132 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:22:25,209 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:22:25,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [816708253] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:22:25,210 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:22:25,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 11 [2025-03-03 14:22:25,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549780677] [2025-03-03 14:22:25,210 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:22:25,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 14:22:25,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:25,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 14:22:25,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:22:25,211 INFO L87 Difference]: Start difference. First operand 390 states and 596 transitions. Second operand has 11 states, 10 states have (on average 14.3) internal successors, (143), 11 states have internal predecessors, (143), 4 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (28), 3 states have call predecessors, (28), 4 states have call successors, (28) [2025-03-03 14:22:25,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:25,703 INFO L93 Difference]: Finished difference Result 1123 states and 1795 transitions. [2025-03-03 14:22:25,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 14:22:25,704 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 14.3) internal successors, (143), 11 states have internal predecessors, (143), 4 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (28), 3 states have call predecessors, (28), 4 states have call successors, (28) Word has length 131 [2025-03-03 14:22:25,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:25,708 INFO L225 Difference]: With dead ends: 1123 [2025-03-03 14:22:25,708 INFO L226 Difference]: Without dead ends: 764 [2025-03-03 14:22:25,710 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 259 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:22:25,711 INFO L435 NwaCegarLoop]: 474 mSDtfsCounter, 1396 mSDsluCounter, 2552 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1396 SdHoareTripleChecker+Valid, 3026 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:25,711 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1396 Valid, 3026 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 14:22:25,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2025-03-03 14:22:25,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 738. [2025-03-03 14:22:25,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 738 states, 589 states have (on average 1.5772495755517826) internal successors, (929), 593 states have internal predecessors, (929), 125 states have call successors, (125), 20 states have call predecessors, (125), 23 states have return successors, (146), 124 states have call predecessors, (146), 124 states have call successors, (146) [2025-03-03 14:22:25,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 1200 transitions. [2025-03-03 14:22:25,750 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 1200 transitions. Word has length 131 [2025-03-03 14:22:25,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:25,750 INFO L471 AbstractCegarLoop]: Abstraction has 738 states and 1200 transitions. [2025-03-03 14:22:25,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 14.3) internal successors, (143), 11 states have internal predecessors, (143), 4 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (28), 3 states have call predecessors, (28), 4 states have call successors, (28) [2025-03-03 14:22:25,751 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 1200 transitions. [2025-03-03 14:22:25,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-03 14:22:25,754 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:25,755 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:25,763 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:22:25,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:22:25,955 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:25,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:25,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1627604787, now seen corresponding path program 1 times [2025-03-03 14:22:25,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:25,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803210676] [2025-03-03 14:22:25,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:25,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:25,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-03 14:22:25,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-03 14:22:25,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:25,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:26,029 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:22:26,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:26,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803210676] [2025-03-03 14:22:26,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803210676] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:26,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:26,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:22:26,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829306064] [2025-03-03 14:22:26,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:26,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:22:26,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:26,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:22:26,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:26,031 INFO L87 Difference]: Start difference. First operand 738 states and 1200 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 14:22:26,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:26,078 INFO L93 Difference]: Finished difference Result 1726 states and 2853 transitions. [2025-03-03 14:22:26,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:22:26,079 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 134 [2025-03-03 14:22:26,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:26,087 INFO L225 Difference]: With dead ends: 1726 [2025-03-03 14:22:26,087 INFO L226 Difference]: Without dead ends: 1066 [2025-03-03 14:22:26,090 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:26,091 INFO L435 NwaCegarLoop]: 499 mSDtfsCounter, 112 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 974 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:26,091 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 974 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:26,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1066 states. [2025-03-03 14:22:26,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1066 to 1058. [2025-03-03 14:22:26,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1058 states, 845 states have (on average 1.5964497041420118) internal successors, (1349), 849 states have internal predecessors, (1349), 189 states have call successors, (189), 20 states have call predecessors, (189), 23 states have return successors, (220), 188 states have call predecessors, (220), 188 states have call successors, (220) [2025-03-03 14:22:26,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1058 states to 1058 states and 1758 transitions. [2025-03-03 14:22:26,143 INFO L78 Accepts]: Start accepts. Automaton has 1058 states and 1758 transitions. Word has length 134 [2025-03-03 14:22:26,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:26,143 INFO L471 AbstractCegarLoop]: Abstraction has 1058 states and 1758 transitions. [2025-03-03 14:22:26,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 14:22:26,143 INFO L276 IsEmpty]: Start isEmpty. Operand 1058 states and 1758 transitions. [2025-03-03 14:22:26,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-03 14:22:26,150 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:26,150 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:26,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 14:22:26,150 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:26,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:26,152 INFO L85 PathProgramCache]: Analyzing trace with hash -2009754836, now seen corresponding path program 1 times [2025-03-03 14:22:26,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:26,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111683290] [2025-03-03 14:22:26,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:26,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:26,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-03 14:22:26,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-03 14:22:26,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:26,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:26,215 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:22:26,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:26,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111683290] [2025-03-03 14:22:26,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111683290] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:26,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:26,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:22:26,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369292452] [2025-03-03 14:22:26,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:26,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:22:26,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:26,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:22:26,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:26,216 INFO L87 Difference]: Start difference. First operand 1058 states and 1758 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 14:22:26,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:26,260 INFO L93 Difference]: Finished difference Result 2520 states and 4210 transitions. [2025-03-03 14:22:26,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:22:26,261 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 135 [2025-03-03 14:22:26,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:26,269 INFO L225 Difference]: With dead ends: 2520 [2025-03-03 14:22:26,269 INFO L226 Difference]: Without dead ends: 1591 [2025-03-03 14:22:26,272 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:26,272 INFO L435 NwaCegarLoop]: 485 mSDtfsCounter, 110 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 962 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:26,273 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 962 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:26,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1591 states. [2025-03-03 14:22:26,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1591 to 1583. [2025-03-03 14:22:26,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1583 states, 1275 states have (on average 1.6054901960784314) internal successors, (2047), 1279 states have internal predecessors, (2047), 284 states have call successors, (284), 20 states have call predecessors, (284), 23 states have return successors, (315), 283 states have call predecessors, (315), 283 states have call successors, (315) [2025-03-03 14:22:26,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 2646 transitions. [2025-03-03 14:22:26,340 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 2646 transitions. Word has length 135 [2025-03-03 14:22:26,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:26,341 INFO L471 AbstractCegarLoop]: Abstraction has 1583 states and 2646 transitions. [2025-03-03 14:22:26,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 14:22:26,341 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 2646 transitions. [2025-03-03 14:22:26,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-03 14:22:26,348 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:26,348 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:26,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 14:22:26,349 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:26,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:26,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1201153458, now seen corresponding path program 1 times [2025-03-03 14:22:26,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:26,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046022488] [2025-03-03 14:22:26,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:26,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:26,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-03 14:22:26,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-03 14:22:26,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:26,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:26,418 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:22:26,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:26,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046022488] [2025-03-03 14:22:26,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046022488] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:26,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:26,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:22:26,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109551134] [2025-03-03 14:22:26,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:26,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:22:26,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:26,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:22:26,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:26,420 INFO L87 Difference]: Start difference. First operand 1583 states and 2646 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 14:22:26,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:26,492 INFO L93 Difference]: Finished difference Result 3709 states and 6244 transitions. [2025-03-03 14:22:26,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:22:26,492 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 136 [2025-03-03 14:22:26,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:26,505 INFO L225 Difference]: With dead ends: 3709 [2025-03-03 14:22:26,505 INFO L226 Difference]: Without dead ends: 2387 [2025-03-03 14:22:26,512 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:26,513 INFO L435 NwaCegarLoop]: 483 mSDtfsCounter, 108 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 957 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:26,513 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 957 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:26,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2387 states. [2025-03-03 14:22:26,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2387 to 2379. [2025-03-03 14:22:26,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2379 states, 1948 states have (on average 1.6124229979466118) internal successors, (3141), 1952 states have internal predecessors, (3141), 407 states have call successors, (407), 20 states have call predecessors, (407), 23 states have return successors, (454), 406 states have call predecessors, (454), 406 states have call successors, (454) [2025-03-03 14:22:26,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2379 states to 2379 states and 4002 transitions. [2025-03-03 14:22:26,618 INFO L78 Accepts]: Start accepts. Automaton has 2379 states and 4002 transitions. Word has length 136 [2025-03-03 14:22:26,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:26,619 INFO L471 AbstractCegarLoop]: Abstraction has 2379 states and 4002 transitions. [2025-03-03 14:22:26,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 14:22:26,619 INFO L276 IsEmpty]: Start isEmpty. Operand 2379 states and 4002 transitions. [2025-03-03 14:22:26,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-03 14:22:26,631 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:26,631 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:26,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 14:22:26,631 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:26,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:26,632 INFO L85 PathProgramCache]: Analyzing trace with hash 818816011, now seen corresponding path program 1 times [2025-03-03 14:22:26,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:26,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284971285] [2025-03-03 14:22:26,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:26,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:26,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-03 14:22:26,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-03 14:22:26,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:26,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:26,689 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:22:26,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:26,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284971285] [2025-03-03 14:22:26,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284971285] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:26,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:26,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:22:26,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936135984] [2025-03-03 14:22:26,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:26,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:22:26,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:26,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:22:26,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:26,691 INFO L87 Difference]: Start difference. First operand 2379 states and 4002 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 14:22:26,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:26,775 INFO L93 Difference]: Finished difference Result 5562 states and 9416 transitions. [2025-03-03 14:22:26,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:22:26,776 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 137 [2025-03-03 14:22:26,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:26,795 INFO L225 Difference]: With dead ends: 5562 [2025-03-03 14:22:26,796 INFO L226 Difference]: Without dead ends: 3659 [2025-03-03 14:22:26,804 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:26,804 INFO L435 NwaCegarLoop]: 483 mSDtfsCounter, 106 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 957 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:26,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 957 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:26,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3659 states. [2025-03-03 14:22:26,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3659 to 3651. [2025-03-03 14:22:26,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3651 states, 3041 states have (on average 1.6169023347583031) internal successors, (4917), 3045 states have internal predecessors, (4917), 586 states have call successors, (586), 20 states have call predecessors, (586), 23 states have return successors, (659), 585 states have call predecessors, (659), 585 states have call successors, (659) [2025-03-03 14:22:26,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3651 states to 3651 states and 6162 transitions. [2025-03-03 14:22:26,992 INFO L78 Accepts]: Start accepts. Automaton has 3651 states and 6162 transitions. Word has length 137 [2025-03-03 14:22:26,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:26,992 INFO L471 AbstractCegarLoop]: Abstraction has 3651 states and 6162 transitions. [2025-03-03 14:22:26,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 14:22:26,993 INFO L276 IsEmpty]: Start isEmpty. Operand 3651 states and 6162 transitions. [2025-03-03 14:22:27,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-03 14:22:27,007 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:27,007 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:27,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 14:22:27,007 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:27,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:27,008 INFO L85 PathProgramCache]: Analyzing trace with hash -2053966161, now seen corresponding path program 1 times [2025-03-03 14:22:27,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:27,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802824894] [2025-03-03 14:22:27,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:27,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:27,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-03 14:22:27,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-03 14:22:27,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:27,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:27,055 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:22:27,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:27,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802824894] [2025-03-03 14:22:27,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802824894] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:27,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:27,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:22:27,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625047017] [2025-03-03 14:22:27,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:27,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:22:27,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:27,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:22:27,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:27,057 INFO L87 Difference]: Start difference. First operand 3651 states and 6162 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 14:22:27,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:27,219 INFO L93 Difference]: Finished difference Result 8609 states and 14624 transitions. [2025-03-03 14:22:27,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:22:27,220 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 138 [2025-03-03 14:22:27,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:27,246 INFO L225 Difference]: With dead ends: 8609 [2025-03-03 14:22:27,246 INFO L226 Difference]: Without dead ends: 5761 [2025-03-03 14:22:27,254 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:27,255 INFO L435 NwaCegarLoop]: 491 mSDtfsCounter, 104 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 963 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:27,255 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 963 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:27,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5761 states. [2025-03-03 14:22:27,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5761 to 5753. [2025-03-03 14:22:27,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5753 states, 4767 states have (on average 1.6119152506817704) internal successors, (7684), 4771 states have internal predecessors, (7684), 962 states have call successors, (962), 20 states have call predecessors, (962), 23 states have return successors, (1079), 961 states have call predecessors, (1079), 961 states have call successors, (1079) [2025-03-03 14:22:27,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5753 states to 5753 states and 9725 transitions. [2025-03-03 14:22:27,517 INFO L78 Accepts]: Start accepts. Automaton has 5753 states and 9725 transitions. Word has length 138 [2025-03-03 14:22:27,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:27,518 INFO L471 AbstractCegarLoop]: Abstraction has 5753 states and 9725 transitions. [2025-03-03 14:22:27,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 14:22:27,518 INFO L276 IsEmpty]: Start isEmpty. Operand 5753 states and 9725 transitions. [2025-03-03 14:22:27,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-03 14:22:27,539 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:27,539 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:27,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 14:22:27,539 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:27,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:27,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1776062742, now seen corresponding path program 1 times [2025-03-03 14:22:27,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:27,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554920038] [2025-03-03 14:22:27,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:27,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:27,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-03 14:22:27,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-03 14:22:27,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:27,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:27,590 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:22:27,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:27,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554920038] [2025-03-03 14:22:27,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554920038] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:27,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:27,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:22:27,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599577362] [2025-03-03 14:22:27,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:27,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:22:27,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:27,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:22:27,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:27,592 INFO L87 Difference]: Start difference. First operand 5753 states and 9725 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 14:22:27,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:27,883 INFO L93 Difference]: Finished difference Result 14121 states and 24021 transitions. [2025-03-03 14:22:27,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:22:27,884 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 139 [2025-03-03 14:22:27,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:27,937 INFO L225 Difference]: With dead ends: 14121 [2025-03-03 14:22:27,938 INFO L226 Difference]: Without dead ends: 9567 [2025-03-03 14:22:27,962 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:27,963 INFO L435 NwaCegarLoop]: 485 mSDtfsCounter, 102 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 962 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:27,963 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 962 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:27,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9567 states. [2025-03-03 14:22:28,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9567 to 9559. [2025-03-03 14:22:28,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9559 states, 7967 states have (on average 1.6105183883519518) internal successors, (12831), 7971 states have internal predecessors, (12831), 1568 states have call successors, (1568), 20 states have call predecessors, (1568), 23 states have return successors, (1763), 1567 states have call predecessors, (1763), 1567 states have call successors, (1763) [2025-03-03 14:22:28,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9559 states to 9559 states and 16162 transitions. [2025-03-03 14:22:28,382 INFO L78 Accepts]: Start accepts. Automaton has 9559 states and 16162 transitions. Word has length 139 [2025-03-03 14:22:28,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:28,382 INFO L471 AbstractCegarLoop]: Abstraction has 9559 states and 16162 transitions. [2025-03-03 14:22:28,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 14:22:28,383 INFO L276 IsEmpty]: Start isEmpty. Operand 9559 states and 16162 transitions. [2025-03-03 14:22:28,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-03 14:22:28,411 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:28,411 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:28,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 14:22:28,412 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:28,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:28,412 INFO L85 PathProgramCache]: Analyzing trace with hash 2089774320, now seen corresponding path program 1 times [2025-03-03 14:22:28,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:28,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392913934] [2025-03-03 14:22:28,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:28,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:28,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-03 14:22:28,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-03 14:22:28,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:28,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:28,463 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:22:28,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:28,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392913934] [2025-03-03 14:22:28,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392913934] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:28,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:28,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:22:28,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80585295] [2025-03-03 14:22:28,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:28,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:22:28,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:28,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:22:28,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:28,466 INFO L87 Difference]: Start difference. First operand 9559 states and 16162 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 14:22:28,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:28,784 INFO L93 Difference]: Finished difference Result 24628 states and 41819 transitions. [2025-03-03 14:22:28,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:22:28,785 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 140 [2025-03-03 14:22:28,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:28,853 INFO L225 Difference]: With dead ends: 24628 [2025-03-03 14:22:28,854 INFO L226 Difference]: Without dead ends: 16743 [2025-03-03 14:22:28,886 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:28,887 INFO L435 NwaCegarLoop]: 500 mSDtfsCounter, 100 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 982 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:28,887 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 982 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:28,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16743 states. [2025-03-03 14:22:29,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16743 to 16735. [2025-03-03 14:22:29,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16735 states, 13940 states have (on average 1.6025824964131994) internal successors, (22340), 13944 states have internal predecessors, (22340), 2771 states have call successors, (2771), 20 states have call predecessors, (2771), 23 states have return successors, (3110), 2770 states have call predecessors, (3110), 2770 states have call successors, (3110) [2025-03-03 14:22:29,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16735 states to 16735 states and 28221 transitions. [2025-03-03 14:22:29,536 INFO L78 Accepts]: Start accepts. Automaton has 16735 states and 28221 transitions. Word has length 140 [2025-03-03 14:22:29,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:29,537 INFO L471 AbstractCegarLoop]: Abstraction has 16735 states and 28221 transitions. [2025-03-03 14:22:29,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 14:22:29,537 INFO L276 IsEmpty]: Start isEmpty. Operand 16735 states and 28221 transitions. [2025-03-03 14:22:29,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-03 14:22:29,642 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:29,643 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:29,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 14:22:29,643 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:29,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:29,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1183237559, now seen corresponding path program 1 times [2025-03-03 14:22:29,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:29,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598735168] [2025-03-03 14:22:29,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:29,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:29,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-03 14:22:29,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-03 14:22:29,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:29,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:29,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:22:29,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:29,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598735168] [2025-03-03 14:22:29,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598735168] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:29,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:29,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:22:29,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484818784] [2025-03-03 14:22:29,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:29,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:22:29,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:29,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:22:29,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:29,704 INFO L87 Difference]: Start difference. First operand 16735 states and 28221 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 14:22:30,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:30,462 INFO L93 Difference]: Finished difference Result 44209 states and 74897 transitions. [2025-03-03 14:22:30,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:22:30,462 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 141 [2025-03-03 14:22:30,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:30,670 INFO L225 Difference]: With dead ends: 44209 [2025-03-03 14:22:30,670 INFO L226 Difference]: Without dead ends: 29817 [2025-03-03 14:22:30,702 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:30,703 INFO L435 NwaCegarLoop]: 483 mSDtfsCounter, 98 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 960 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:30,703 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 960 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:30,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29817 states. [2025-03-03 14:22:31,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29817 to 29809. [2025-03-03 14:22:31,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29809 states, 24975 states have (on average 1.599079079079079) internal successors, (39937), 24979 states have internal predecessors, (39937), 4810 states have call successors, (4810), 20 states have call predecessors, (4810), 23 states have return successors, (5423), 4809 states have call predecessors, (5423), 4809 states have call successors, (5423) [2025-03-03 14:22:31,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29809 states to 29809 states and 50170 transitions. [2025-03-03 14:22:31,651 INFO L78 Accepts]: Start accepts. Automaton has 29809 states and 50170 transitions. Word has length 141 [2025-03-03 14:22:31,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:31,651 INFO L471 AbstractCegarLoop]: Abstraction has 29809 states and 50170 transitions. [2025-03-03 14:22:31,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 14:22:31,652 INFO L276 IsEmpty]: Start isEmpty. Operand 29809 states and 50170 transitions. [2025-03-03 14:22:31,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-03 14:22:31,700 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:31,700 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:31,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 14:22:31,701 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:31,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:31,701 INFO L85 PathProgramCache]: Analyzing trace with hash -641269743, now seen corresponding path program 1 times [2025-03-03 14:22:31,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:31,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291564432] [2025-03-03 14:22:31,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:31,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:31,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-03 14:22:31,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-03 14:22:31,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:31,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:31,755 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:22:31,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:31,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291564432] [2025-03-03 14:22:31,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291564432] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:31,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:31,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:22:31,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790976545] [2025-03-03 14:22:31,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:31,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:22:31,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:31,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:22:31,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:31,757 INFO L87 Difference]: Start difference. First operand 29809 states and 50170 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 14:22:32,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:32,873 INFO L93 Difference]: Finished difference Result 81166 states and 137109 transitions. [2025-03-03 14:22:32,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:22:32,873 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 142 [2025-03-03 14:22:32,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:33,109 INFO L225 Difference]: With dead ends: 81166 [2025-03-03 14:22:33,110 INFO L226 Difference]: Without dead ends: 54503 [2025-03-03 14:22:33,185 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:33,187 INFO L435 NwaCegarLoop]: 487 mSDtfsCounter, 96 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 964 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:33,187 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 964 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:33,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54503 states. [2025-03-03 14:22:34,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54503 to 54495. [2025-03-03 14:22:35,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54495 states, 45946 states have (on average 1.594154006877639) internal successors, (73245), 45950 states have internal predecessors, (73245), 8525 states have call successors, (8525), 20 states have call predecessors, (8525), 23 states have return successors, (9670), 8524 states have call predecessors, (9670), 8524 states have call successors, (9670) [2025-03-03 14:22:35,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54495 states to 54495 states and 91440 transitions. [2025-03-03 14:22:35,205 INFO L78 Accepts]: Start accepts. Automaton has 54495 states and 91440 transitions. Word has length 142 [2025-03-03 14:22:35,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:35,206 INFO L471 AbstractCegarLoop]: Abstraction has 54495 states and 91440 transitions. [2025-03-03 14:22:35,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 14:22:35,206 INFO L276 IsEmpty]: Start isEmpty. Operand 54495 states and 91440 transitions. [2025-03-03 14:22:35,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-03 14:22:35,258 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:35,258 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:35,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 14:22:35,258 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:35,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:35,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1054051592, now seen corresponding path program 1 times [2025-03-03 14:22:35,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:35,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495780317] [2025-03-03 14:22:35,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:35,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:35,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-03 14:22:35,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-03 14:22:35,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:35,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:35,312 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:22:35,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:35,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495780317] [2025-03-03 14:22:35,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495780317] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:35,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:35,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:22:35,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243605752] [2025-03-03 14:22:35,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:35,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:22:35,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:35,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:22:35,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:35,313 INFO L87 Difference]: Start difference. First operand 54495 states and 91440 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 14:22:36,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:36,918 INFO L93 Difference]: Finished difference Result 101712 states and 171016 transitions. [2025-03-03 14:22:36,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:22:36,919 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 143 [2025-03-03 14:22:36,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:37,593 INFO L225 Difference]: With dead ends: 101712 [2025-03-03 14:22:37,594 INFO L226 Difference]: Without dead ends: 101544 [2025-03-03 14:22:37,637 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:37,638 INFO L435 NwaCegarLoop]: 492 mSDtfsCounter, 91 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 974 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:37,639 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 974 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:37,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101544 states. [2025-03-03 14:22:40,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101544 to 101536. [2025-03-03 14:22:40,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101536 states, 86188 states have (on average 1.587726829721075) internal successors, (136843), 86192 states have internal predecessors, (136843), 15324 states have call successors, (15324), 20 states have call predecessors, (15324), 23 states have return successors, (17515), 15323 states have call predecessors, (17515), 15323 states have call successors, (17515) [2025-03-03 14:22:40,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101536 states to 101536 states and 169682 transitions. [2025-03-03 14:22:40,953 INFO L78 Accepts]: Start accepts. Automaton has 101536 states and 169682 transitions. Word has length 143 [2025-03-03 14:22:40,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:40,953 INFO L471 AbstractCegarLoop]: Abstraction has 101536 states and 169682 transitions. [2025-03-03 14:22:40,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 14:22:40,953 INFO L276 IsEmpty]: Start isEmpty. Operand 101536 states and 169682 transitions. [2025-03-03 14:22:41,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-03 14:22:41,022 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:41,022 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:41,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 14:22:41,023 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:41,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:41,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1405391730, now seen corresponding path program 1 times [2025-03-03 14:22:41,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:41,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21198701] [2025-03-03 14:22:41,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:41,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:41,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-03 14:22:41,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-03 14:22:41,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:41,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:41,148 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:22:41,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:41,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21198701] [2025-03-03 14:22:41,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21198701] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:41,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:41,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:22:41,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450284438] [2025-03-03 14:22:41,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:41,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:22:41,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:41,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:22:41,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:22:41,150 INFO L87 Difference]: Start difference. First operand 101536 states and 169682 transitions. Second operand has 6 states, 6 states have (on average 16.5) internal successors, (99), 5 states have internal predecessors, (99), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 14:22:43,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:43,514 INFO L93 Difference]: Finished difference Result 101862 states and 170137 transitions. [2025-03-03 14:22:43,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 14:22:43,515 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 5 states have internal predecessors, (99), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) Word has length 144 [2025-03-03 14:22:43,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:43,915 INFO L225 Difference]: With dead ends: 101862 [2025-03-03 14:22:43,915 INFO L226 Difference]: Without dead ends: 101702 [2025-03-03 14:22:43,963 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:22:43,967 INFO L435 NwaCegarLoop]: 521 mSDtfsCounter, 417 mSDsluCounter, 1673 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 2194 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:43,967 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [419 Valid, 2194 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:22:44,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101702 states. [2025-03-03 14:22:47,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101702 to 101698. [2025-03-03 14:22:47,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101698 states, 86315 states have (on average 1.5874761049643746) internal successors, (137023), 86319 states have internal predecessors, (137023), 15346 states have call successors, (15346), 31 states have call predecessors, (15346), 36 states have return successors, (17540), 15347 states have call predecessors, (17540), 15344 states have call successors, (17540) [2025-03-03 14:22:47,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101698 states to 101698 states and 169909 transitions. [2025-03-03 14:22:47,530 INFO L78 Accepts]: Start accepts. Automaton has 101698 states and 169909 transitions. Word has length 144 [2025-03-03 14:22:47,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:47,531 INFO L471 AbstractCegarLoop]: Abstraction has 101698 states and 169909 transitions. [2025-03-03 14:22:47,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 5 states have internal predecessors, (99), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 14:22:47,531 INFO L276 IsEmpty]: Start isEmpty. Operand 101698 states and 169909 transitions. [2025-03-03 14:22:47,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-03 14:22:47,603 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:47,603 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:47,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 14:22:47,604 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:47,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:47,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1314976646, now seen corresponding path program 1 times [2025-03-03 14:22:47,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:47,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850059824] [2025-03-03 14:22:47,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:47,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:47,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-03 14:22:47,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-03 14:22:47,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:47,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:48,236 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:22:48,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:48,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850059824] [2025-03-03 14:22:48,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850059824] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:48,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:48,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-03 14:22:48,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673994456] [2025-03-03 14:22:48,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:48,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 14:22:48,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:48,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 14:22:48,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2025-03-03 14:22:48,239 INFO L87 Difference]: Start difference. First operand 101698 states and 169909 transitions. Second operand has 13 states, 11 states have (on average 9.090909090909092) internal successors, (100), 12 states have internal predecessors, (100), 8 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 6 states have call predecessors, (15), 7 states have call successors, (15) [2025-03-03 14:22:50,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:50,012 INFO L93 Difference]: Finished difference Result 102175 states and 170592 transitions. [2025-03-03 14:22:50,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 14:22:50,012 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 9.090909090909092) internal successors, (100), 12 states have internal predecessors, (100), 8 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 6 states have call predecessors, (15), 7 states have call successors, (15) Word has length 145 [2025-03-03 14:22:50,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:50,390 INFO L225 Difference]: With dead ends: 102175 [2025-03-03 14:22:50,390 INFO L226 Difference]: Without dead ends: 101757 [2025-03-03 14:22:50,447 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2025-03-03 14:22:50,447 INFO L435 NwaCegarLoop]: 473 mSDtfsCounter, 156 mSDsluCounter, 5188 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 5661 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:50,447 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 5661 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:22:50,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101757 states. [2025-03-03 14:22:53,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101757 to 101753. [2025-03-03 14:22:53,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101753 states, 86357 states have (on average 1.5873756614981993) internal successors, (137081), 86364 states have internal predecessors, (137081), 15357 states have call successors, (15357), 32 states have call predecessors, (15357), 38 states have return successors, (17553), 15356 states have call predecessors, (17553), 15355 states have call successors, (17553) [2025-03-03 14:22:54,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101753 states to 101753 states and 169991 transitions. [2025-03-03 14:22:54,061 INFO L78 Accepts]: Start accepts. Automaton has 101753 states and 169991 transitions. Word has length 145 [2025-03-03 14:22:54,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:54,061 INFO L471 AbstractCegarLoop]: Abstraction has 101753 states and 169991 transitions. [2025-03-03 14:22:54,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 9.090909090909092) internal successors, (100), 12 states have internal predecessors, (100), 8 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 6 states have call predecessors, (15), 7 states have call successors, (15) [2025-03-03 14:22:54,061 INFO L276 IsEmpty]: Start isEmpty. Operand 101753 states and 169991 transitions. [2025-03-03 14:22:54,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-03 14:22:54,188 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:54,188 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:54,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-03 14:22:54,188 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:54,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:54,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1395836387, now seen corresponding path program 1 times [2025-03-03 14:22:54,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:54,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455261170] [2025-03-03 14:22:54,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:54,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:54,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-03 14:22:54,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-03 14:22:54,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:54,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:54,305 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-03-03 14:22:54,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:54,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455261170] [2025-03-03 14:22:54,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455261170] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:54,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:54,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:22:54,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120114629] [2025-03-03 14:22:54,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:54,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:22:54,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:54,307 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:22:54,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:22:54,307 INFO L87 Difference]: Start difference. First operand 101753 states and 169991 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-03 14:22:56,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:56,326 INFO L93 Difference]: Finished difference Result 102486 states and 171021 transitions. [2025-03-03 14:22:56,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 14:22:56,326 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) Word has length 169 [2025-03-03 14:22:56,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:56,780 INFO L225 Difference]: With dead ends: 102486 [2025-03-03 14:22:56,780 INFO L226 Difference]: Without dead ends: 102136 [2025-03-03 14:22:56,816 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:22:56,816 INFO L435 NwaCegarLoop]: 669 mSDtfsCounter, 421 mSDsluCounter, 2104 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 2773 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:56,816 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [423 Valid, 2773 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:22:56,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102136 states.