./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec3_product19.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_spec3_product19.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 0eb0a93133a0d165b4e13ef7269be4b8c3f0f81976a167102da919b09b6c6616 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 14:23:02,636 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 14:23:02,697 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 14:23:02,704 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 14:23:02,704 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 14:23:02,728 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 14:23:02,728 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 14:23:02,728 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 14:23:02,729 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 14:23:02,729 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 14:23:02,729 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 14:23:02,729 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 14:23:02,729 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 14:23:02,729 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 14:23:02,729 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 14:23:02,729 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 14:23:02,729 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 14:23:02,729 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 14:23:02,730 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 14:23:02,730 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 14:23:02,730 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 14:23:02,730 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 14:23:02,730 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 14:23:02,730 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 14:23:02,730 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 14:23:02,730 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 14:23:02,730 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 14:23:02,730 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 14:23:02,730 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 14:23:02,730 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 14:23:02,730 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 14:23:02,730 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 14:23:02,731 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:23:02,731 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 14:23:02,731 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 14:23:02,731 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 14:23:02,731 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 14:23:02,731 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 14:23:02,731 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 14:23:02,731 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 14:23:02,731 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 14:23:02,731 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 14:23:02,731 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 14:23:02,731 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 -> 0eb0a93133a0d165b4e13ef7269be4b8c3f0f81976a167102da919b09b6c6616 [2025-03-03 14:23:02,972 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 14:23:02,978 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 14:23:02,980 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 14:23:02,982 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 14:23:02,982 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 14:23:02,983 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec3_product19.cil.c [2025-03-03 14:23:04,140 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce65b7764/4284c37129f94902ab82e1ca55cc9668/FLAG31979bbbc [2025-03-03 14:23:04,434 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 14:23:04,435 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec3_product19.cil.c [2025-03-03 14:23:04,457 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce65b7764/4284c37129f94902ab82e1ca55cc9668/FLAG31979bbbc [2025-03-03 14:23:04,474 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce65b7764/4284c37129f94902ab82e1ca55cc9668 [2025-03-03 14:23:04,476 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 14:23:04,478 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 14:23:04,478 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 14:23:04,479 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 14:23:04,482 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 14:23:04,484 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:23:04" (1/1) ... [2025-03-03 14:23:04,484 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@99c01a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:23:04, skipping insertion in model container [2025-03-03 14:23:04,485 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:23:04" (1/1) ... [2025-03-03 14:23:04,534 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 14:23:04,743 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_spec3_product19.cil.c[8336,8349] [2025-03-03 14:23:04,892 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:23:04,902 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 14:23:04,911 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [48] [2025-03-03 14:23:04,912 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [66] [2025-03-03 14:23:04,913 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [115] [2025-03-03 14:23:04,913 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [431] [2025-03-03 14:23:04,913 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"SignVerify_spec.i","") [440] [2025-03-03 14:23:04,913 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [498] [2025-03-03 14:23:04,913 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [723] [2025-03-03 14:23:04,913 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [821] [2025-03-03 14:23:04,913 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [1895] [2025-03-03 14:23:04,914 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [2170] [2025-03-03 14:23:04,914 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [2571] [2025-03-03 14:23:04,939 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_spec3_product19.cil.c[8336,8349] [2025-03-03 14:23:05,032 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:23:05,059 INFO L204 MainTranslator]: Completed translation [2025-03-03 14:23:05,060 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:23:05 WrapperNode [2025-03-03 14:23:05,060 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 14:23:05,061 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 14:23:05,061 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 14:23:05,061 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 14:23:05,066 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:23:05" (1/1) ... [2025-03-03 14:23:05,086 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:23:05" (1/1) ... [2025-03-03 14:23:05,139 INFO L138 Inliner]: procedures = 128, calls = 192, calls flagged for inlining = 58, calls inlined = 53, statements flattened = 976 [2025-03-03 14:23:05,140 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 14:23:05,140 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 14:23:05,140 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 14:23:05,141 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 14:23:05,147 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:23:05" (1/1) ... [2025-03-03 14:23:05,147 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:23:05" (1/1) ... [2025-03-03 14:23:05,156 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:23:05" (1/1) ... [2025-03-03 14:23:05,173 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:23:05,173 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:23:05" (1/1) ... [2025-03-03 14:23:05,173 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:23:05" (1/1) ... [2025-03-03 14:23:05,184 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:23:05" (1/1) ... [2025-03-03 14:23:05,185 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:23:05" (1/1) ... [2025-03-03 14:23:05,187 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:23:05" (1/1) ... [2025-03-03 14:23:05,189 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:23:05" (1/1) ... [2025-03-03 14:23:05,193 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 14:23:05,194 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 14:23:05,194 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 14:23:05,194 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 14:23:05,195 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:23:05" (1/1) ... [2025-03-03 14:23:05,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:23:05,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:23:05,230 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:23:05,232 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:23:05,250 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-03-03 14:23:05,250 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-03-03 14:23:05,250 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-03-03 14:23:05,250 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-03-03 14:23:05,251 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2025-03-03 14:23:05,251 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2025-03-03 14:23:05,251 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-03-03 14:23:05,251 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-03-03 14:23:05,251 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2025-03-03 14:23:05,251 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2025-03-03 14:23:05,251 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-03-03 14:23:05,251 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-03-03 14:23:05,251 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-03-03 14:23:05,251 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-03-03 14:23:05,251 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-03-03 14:23:05,251 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-03-03 14:23:05,251 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 14:23:05,251 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2025-03-03 14:23:05,251 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2025-03-03 14:23:05,251 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2025-03-03 14:23:05,251 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2025-03-03 14:23:05,251 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-03-03 14:23:05,252 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-03-03 14:23:05,252 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2025-03-03 14:23:05,252 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2025-03-03 14:23:05,252 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-03-03 14:23:05,252 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-03-03 14:23:05,252 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-03-03 14:23:05,252 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-03-03 14:23:05,252 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2025-03-03 14:23:05,252 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2025-03-03 14:23:05,252 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-03-03 14:23:05,252 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-03-03 14:23:05,252 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-03-03 14:23:05,252 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-03-03 14:23:05,252 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-03-03 14:23:05,252 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-03-03 14:23:05,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 14:23:05,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 14:23:05,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-03 14:23:05,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-03 14:23:05,253 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-03-03 14:23:05,253 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-03-03 14:23:05,253 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 14:23:05,253 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 14:23:05,420 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 14:23:05,423 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 14:23:05,723 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1872-1: getClientId_#res#1 := getClientId_~retValue_acc~27#1; [2025-03-03 14:23:05,723 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1825-1: getClientForwardReceiver_#res#1 := getClientForwardReceiver_~retValue_acc~26#1; [2025-03-03 14:23:05,723 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1437-1: getClientPrivateKey_#res#1 := getClientPrivateKey_~retValue_acc~20#1; [2025-03-03 14:23:05,723 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2552-1: isVerified_#res#1 := isVerified_~retValue_acc~39#1; [2025-03-03 14:23:05,723 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2215-1: getEmailId_#res#1 := getEmailId_~retValue_acc~30#1; [2025-03-03 14:23:05,731 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2478: #res := ~retValue_acc~37; [2025-03-03 14:23:05,744 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L331: #res := ~retValue_acc~7; [2025-03-03 14:23:05,773 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1529: #res#1 := ~retValue_acc~22#1; [2025-03-03 14:23:05,773 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1484-1: getClientKeyringSize_#res#1 := getClientKeyringSize_~retValue_acc~21#1; [2025-03-03 14:23:05,797 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1753: #res := ~retValue_acc~25; [2025-03-03 14:23:05,806 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L818-1: createEmail_#res#1 := createEmail_~retValue_acc~10#1; [2025-03-03 14:23:05,813 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2515: #res := ~retValue_acc~38; [2025-03-03 14:23:05,833 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2289: #res := ~retValue_acc~32; [2025-03-03 14:23:06,054 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L112-1: valid_product_#res#1 := valid_product_~retValue_acc~2#1; [2025-03-03 14:23:06,054 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1699-1: getClientKeyringPublicKey_#res#1 := getClientKeyringPublicKey_~retValue_acc~24#1; [2025-03-03 14:23:06,054 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1592-1: getClientKeyringUser_#res#1 := getClientKeyringUser_~retValue_acc~23#1; [2025-03-03 14:23:06,054 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L288-1: is_queue_empty_#res#1 := is_queue_empty_~retValue_acc~4#1; [2025-03-03 14:23:06,054 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L297-1: get_queued_client_#res#1 := get_queued_client_~retValue_acc~5#1; [2025-03-03 14:23:06,054 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L306-1: get_queued_email_#res#1 := get_queued_email_~retValue_acc~6#1; [2025-03-03 14:23:06,060 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2252: #res := ~retValue_acc~31; [2025-03-03 14:23:06,062 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L794: #res := ~retValue_acc~8; [2025-03-03 14:23:06,173 INFO L? ?]: Removed 433 outVars from TransFormulas that were not future-live. [2025-03-03 14:23:06,173 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 14:23:06,188 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 14:23:06,188 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 14:23:06,189 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:23:06 BoogieIcfgContainer [2025-03-03 14:23:06,189 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 14:23:06,190 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 14:23:06,190 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 14:23:06,194 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 14:23:06,194 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 02:23:04" (1/3) ... [2025-03-03 14:23:06,194 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f4034bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:23:06, skipping insertion in model container [2025-03-03 14:23:06,195 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:23:05" (2/3) ... [2025-03-03 14:23:06,195 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f4034bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:23:06, skipping insertion in model container [2025-03-03 14:23:06,195 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:23:06" (3/3) ... [2025-03-03 14:23:06,196 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec3_product19.cil.c [2025-03-03 14:23:06,208 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 14:23:06,211 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec3_product19.cil.c that has 20 procedures, 322 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 14:23:06,283 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 14:23:06,292 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;@33503c7a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 14:23:06,292 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 14:23:06,297 INFO L276 IsEmpty]: Start isEmpty. Operand has 322 states, 251 states have (on average 1.5179282868525896) internal successors, (381), 255 states have internal predecessors, (381), 50 states have call successors, (50), 19 states have call predecessors, (50), 19 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-03 14:23:06,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-03 14:23:06,312 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:23:06,313 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] [2025-03-03 14:23:06,313 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:23:06,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:23:06,317 INFO L85 PathProgramCache]: Analyzing trace with hash -387050900, now seen corresponding path program 1 times [2025-03-03 14:23:06,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:23:06,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158326679] [2025-03-03 14:23:06,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:06,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:23:06,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-03 14:23:06,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-03 14:23:06,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:06,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:06,880 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:23:06,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:23:06,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158326679] [2025-03-03 14:23:06,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158326679] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:23:06,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1713268097] [2025-03-03 14:23:06,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:06,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:23:06,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:23:06,885 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:23:06,887 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:23:07,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-03 14:23:07,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-03 14:23:07,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:07,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:07,157 INFO L256 TraceCheckSpWp]: Trace formula consists of 1022 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 14:23:07,164 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:23:07,179 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:23:07,179 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:23:07,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1713268097] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:23:07,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:23:07,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 5 [2025-03-03 14:23:07,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659957813] [2025-03-03 14:23:07,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:23:07,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 14:23:07,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:23:07,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 14:23:07,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:23:07,202 INFO L87 Difference]: Start difference. First operand has 322 states, 251 states have (on average 1.5179282868525896) internal successors, (381), 255 states have internal predecessors, (381), 50 states have call successors, (50), 19 states have call predecessors, (50), 19 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) Second operand has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:23:07,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:23:07,248 INFO L93 Difference]: Finished difference Result 490 states and 718 transitions. [2025-03-03 14:23:07,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 14:23:07,250 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 103 [2025-03-03 14:23:07,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:23:07,258 INFO L225 Difference]: With dead ends: 490 [2025-03-03 14:23:07,259 INFO L226 Difference]: Without dead ends: 314 [2025-03-03 14:23:07,263 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 104 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:23:07,266 INFO L435 NwaCegarLoop]: 476 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, 476 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:23:07,266 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 476 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:23:07,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2025-03-03 14:23:07,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 314. [2025-03-03 14:23:07,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 245 states have (on average 1.5142857142857142) internal successors, (371), 247 states have internal predecessors, (371), 50 states have call successors, (50), 19 states have call predecessors, (50), 18 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47) [2025-03-03 14:23:07,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 468 transitions. [2025-03-03 14:23:07,313 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 468 transitions. Word has length 103 [2025-03-03 14:23:07,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:23:07,315 INFO L471 AbstractCegarLoop]: Abstraction has 314 states and 468 transitions. [2025-03-03 14:23:07,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:23:07,315 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 468 transitions. [2025-03-03 14:23:07,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-03 14:23:07,318 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:23:07,319 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] [2025-03-03 14:23:07,328 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:23:07,519 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:23:07,520 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:23:07,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:23:07,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1206420046, now seen corresponding path program 1 times [2025-03-03 14:23:07,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:23:07,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842176555] [2025-03-03 14:23:07,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:07,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:23:07,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-03 14:23:07,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-03 14:23:07,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:07,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:07,764 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:23:07,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:23:07,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842176555] [2025-03-03 14:23:07,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842176555] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:23:07,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [173806493] [2025-03-03 14:23:07,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:07,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:23:07,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:23:07,768 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:23:07,770 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:23:07,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-03 14:23:08,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-03 14:23:08,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:08,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:08,020 INFO L256 TraceCheckSpWp]: Trace formula consists of 1023 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 14:23:08,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:23:08,048 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:23:08,048 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:23:08,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [173806493] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:23:08,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:23:08,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 14:23:08,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564392609] [2025-03-03 14:23:08,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:23:08,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:23:08,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:23:08,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:23:08,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:23:08,050 INFO L87 Difference]: Start difference. First operand 314 states and 468 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:23:08,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:23:08,092 INFO L93 Difference]: Finished difference Result 478 states and 695 transitions. [2025-03-03 14:23:08,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:23:08,093 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 104 [2025-03-03 14:23:08,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:23:08,095 INFO L225 Difference]: With dead ends: 478 [2025-03-03 14:23:08,095 INFO L226 Difference]: Without dead ends: 316 [2025-03-03 14:23:08,098 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 104 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:23:08,099 INFO L435 NwaCegarLoop]: 467 mSDtfsCounter, 0 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 932 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:23:08,099 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 932 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:23:08,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2025-03-03 14:23:08,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 316. [2025-03-03 14:23:08,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 247 states have (on average 1.5101214574898785) internal successors, (373), 249 states have internal predecessors, (373), 50 states have call successors, (50), 19 states have call predecessors, (50), 18 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47) [2025-03-03 14:23:08,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 470 transitions. [2025-03-03 14:23:08,129 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 470 transitions. Word has length 104 [2025-03-03 14:23:08,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:23:08,129 INFO L471 AbstractCegarLoop]: Abstraction has 316 states and 470 transitions. [2025-03-03 14:23:08,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:23:08,130 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 470 transitions. [2025-03-03 14:23:08,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-03 14:23:08,131 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:23:08,131 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] [2025-03-03 14:23:08,141 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:23:08,332 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:23:08,332 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:23:08,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:23:08,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1396924663, now seen corresponding path program 1 times [2025-03-03 14:23:08,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:23:08,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249031358] [2025-03-03 14:23:08,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:08,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:23:08,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-03 14:23:08,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-03 14:23:08,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:08,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:08,516 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:23:08,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:23:08,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249031358] [2025-03-03 14:23:08,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249031358] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:23:08,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [452905333] [2025-03-03 14:23:08,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:08,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:23:08,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:23:08,521 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:23:08,522 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:23:08,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-03 14:23:08,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-03 14:23:08,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:08,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:08,755 INFO L256 TraceCheckSpWp]: Trace formula consists of 1035 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:23:08,758 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:23:08,770 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:23:08,770 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:23:08,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [452905333] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:23:08,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:23:08,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 14:23:08,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362569832] [2025-03-03 14:23:08,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:23:08,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:23:08,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:23:08,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:23:08,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:23:08,772 INFO L87 Difference]: Start difference. First operand 316 states and 470 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:23:08,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:23:08,796 INFO L93 Difference]: Finished difference Result 661 states and 998 transitions. [2025-03-03 14:23:08,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:23:08,797 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 109 [2025-03-03 14:23:08,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:23:08,800 INFO L225 Difference]: With dead ends: 661 [2025-03-03 14:23:08,801 INFO L226 Difference]: Without dead ends: 372 [2025-03-03 14:23:08,804 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:23:08,806 INFO L435 NwaCegarLoop]: 480 mSDtfsCounter, 107 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 900 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:23:08,807 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 900 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:23:08,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2025-03-03 14:23:08,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 364. [2025-03-03 14:23:08,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 284 states have (on average 1.528169014084507) internal successors, (434), 286 states have internal predecessors, (434), 61 states have call successors, (61), 19 states have call predecessors, (61), 18 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-03 14:23:08,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 553 transitions. [2025-03-03 14:23:08,833 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 553 transitions. Word has length 109 [2025-03-03 14:23:08,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:23:08,835 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 553 transitions. [2025-03-03 14:23:08,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:23:08,836 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 553 transitions. [2025-03-03 14:23:08,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-03 14:23:08,838 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:23:08,838 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:23:08,846 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:23:09,038 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:23:09,039 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:23:09,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:23:09,040 INFO L85 PathProgramCache]: Analyzing trace with hash 132479635, now seen corresponding path program 1 times [2025-03-03 14:23:09,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:23:09,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213595773] [2025-03-03 14:23:09,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:09,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:23:09,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-03 14:23:09,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-03 14:23:09,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:09,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:09,155 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:23:09,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:23:09,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213595773] [2025-03-03 14:23:09,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213595773] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:23:09,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [313217908] [2025-03-03 14:23:09,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:09,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:23:09,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:23:09,162 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:23:09,164 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:23:09,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-03 14:23:09,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-03 14:23:09,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:09,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:09,393 INFO L256 TraceCheckSpWp]: Trace formula consists of 1040 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 14:23:09,397 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:23:09,440 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:23:09,440 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:23:09,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [313217908] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:23:09,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:23:09,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-03-03 14:23:09,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688381288] [2025-03-03 14:23:09,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:23:09,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:23:09,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:23:09,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:23:09,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:23:09,443 INFO L87 Difference]: Start difference. First operand 364 states and 553 transitions. Second operand has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 states have internal predecessors, (74), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 14:23:09,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:23:09,498 INFO L93 Difference]: Finished difference Result 719 states and 1096 transitions. [2025-03-03 14:23:09,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:23:09,499 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 states have internal predecessors, (74), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 110 [2025-03-03 14:23:09,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:23:09,502 INFO L225 Difference]: With dead ends: 719 [2025-03-03 14:23:09,504 INFO L226 Difference]: Without dead ends: 366 [2025-03-03 14:23:09,505 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 108 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:23:09,506 INFO L435 NwaCegarLoop]: 460 mSDtfsCounter, 2 mSDsluCounter, 1369 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1829 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:23:09,507 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1829 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:23:09,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2025-03-03 14:23:09,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 366. [2025-03-03 14:23:09,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 285 states have (on average 1.5263157894736843) internal successors, (435), 288 states have internal predecessors, (435), 61 states have call successors, (61), 19 states have call predecessors, (61), 19 states have return successors, (60), 58 states have call predecessors, (60), 58 states have call successors, (60) [2025-03-03 14:23:09,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 556 transitions. [2025-03-03 14:23:09,520 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 556 transitions. Word has length 110 [2025-03-03 14:23:09,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:23:09,520 INFO L471 AbstractCegarLoop]: Abstraction has 366 states and 556 transitions. [2025-03-03 14:23:09,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 states have internal predecessors, (74), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 14:23:09,520 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 556 transitions. [2025-03-03 14:23:09,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-03 14:23:09,521 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:23:09,522 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] [2025-03-03 14:23:09,529 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 14:23:09,722 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:23:09,722 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:23:09,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:23:09,723 INFO L85 PathProgramCache]: Analyzing trace with hash 619606216, now seen corresponding path program 1 times [2025-03-03 14:23:09,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:23:09,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584191501] [2025-03-03 14:23:09,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:09,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:23:09,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-03 14:23:09,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-03 14:23:09,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:09,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:09,852 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:23:09,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:23:09,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584191501] [2025-03-03 14:23:09,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584191501] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:23:09,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1117400146] [2025-03-03 14:23:09,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:09,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:23:09,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:23:09,856 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:23:09,856 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:23:09,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-03 14:23:10,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-03 14:23:10,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:10,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:10,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 1041 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 14:23:10,086 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:23:10,126 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:23:10,130 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:23:10,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1117400146] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:23:10,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:23:10,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-03-03 14:23:10,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958495259] [2025-03-03 14:23:10,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:23:10,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:23:10,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:23:10,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:23:10,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:23:10,131 INFO L87 Difference]: Start difference. First operand 366 states and 556 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 14:23:10,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:23:10,180 INFO L93 Difference]: Finished difference Result 721 states and 1101 transitions. [2025-03-03 14:23:10,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:23:10,180 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 111 [2025-03-03 14:23:10,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:23:10,182 INFO L225 Difference]: With dead ends: 721 [2025-03-03 14:23:10,182 INFO L226 Difference]: Without dead ends: 368 [2025-03-03 14:23:10,183 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 109 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:23:10,186 INFO L435 NwaCegarLoop]: 458 mSDtfsCounter, 2 mSDsluCounter, 1357 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1815 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:23:10,186 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1815 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:23:10,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2025-03-03 14:23:10,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 368. [2025-03-03 14:23:10,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 286 states have (on average 1.5244755244755244) internal successors, (436), 290 states have internal predecessors, (436), 61 states have call successors, (61), 19 states have call predecessors, (61), 20 states have return successors, (65), 58 states have call predecessors, (65), 58 states have call successors, (65) [2025-03-03 14:23:10,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 562 transitions. [2025-03-03 14:23:10,202 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 562 transitions. Word has length 111 [2025-03-03 14:23:10,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:23:10,202 INFO L471 AbstractCegarLoop]: Abstraction has 368 states and 562 transitions. [2025-03-03 14:23:10,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 14:23:10,203 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 562 transitions. [2025-03-03 14:23:10,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-03 14:23:10,204 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:23:10,204 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] [2025-03-03 14:23:10,212 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-03 14:23:10,404 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:23:10,405 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:23:10,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:23:10,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1862274218, now seen corresponding path program 1 times [2025-03-03 14:23:10,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:23:10,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670071017] [2025-03-03 14:23:10,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:10,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:23:10,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 14:23:10,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 14:23:10,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:10,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:10,520 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:23:10,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:23:10,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670071017] [2025-03-03 14:23:10,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670071017] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:23:10,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:23:10,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:23:10,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501931745] [2025-03-03 14:23:10,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:23:10,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:23:10,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:23:10,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:23:10,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:23:10,522 INFO L87 Difference]: Start difference. First operand 368 states and 562 transitions. Second operand has 5 states, 4 states have (on average 18.0) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 14:23:10,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:23:10,559 INFO L93 Difference]: Finished difference Result 713 states and 1092 transitions. [2025-03-03 14:23:10,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:23:10,559 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 18.0) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 112 [2025-03-03 14:23:10,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:23:10,562 INFO L225 Difference]: With dead ends: 713 [2025-03-03 14:23:10,562 INFO L226 Difference]: Without dead ends: 368 [2025-03-03 14:23:10,563 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:23:10,563 INFO L435 NwaCegarLoop]: 461 mSDtfsCounter, 2 mSDsluCounter, 1372 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1833 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:23:10,563 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1833 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:23:10,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2025-03-03 14:23:10,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 368. [2025-03-03 14:23:10,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 286 states have (on average 1.5244755244755244) internal successors, (436), 290 states have internal predecessors, (436), 61 states have call successors, (61), 19 states have call predecessors, (61), 20 states have return successors, (64), 58 states have call predecessors, (64), 58 states have call successors, (64) [2025-03-03 14:23:10,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 561 transitions. [2025-03-03 14:23:10,584 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 561 transitions. Word has length 112 [2025-03-03 14:23:10,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:23:10,585 INFO L471 AbstractCegarLoop]: Abstraction has 368 states and 561 transitions. [2025-03-03 14:23:10,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 18.0) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 14:23:10,586 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 561 transitions. [2025-03-03 14:23:10,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-03 14:23:10,588 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:23:10,588 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] [2025-03-03 14:23:10,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 14:23:10,588 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:23:10,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:23:10,589 INFO L85 PathProgramCache]: Analyzing trace with hash 495147433, now seen corresponding path program 2 times [2025-03-03 14:23:10,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:23:10,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459816009] [2025-03-03 14:23:10,589 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 14:23:10,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:23:10,607 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 113 statements into 2 equivalence classes. [2025-03-03 14:23:10,620 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 113 of 113 statements. [2025-03-03 14:23:10,621 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 14:23:10,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:10,713 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-03 14:23:10,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:23:10,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459816009] [2025-03-03 14:23:10,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459816009] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:23:10,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:23:10,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:23:10,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051785095] [2025-03-03 14:23:10,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:23:10,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:23:10,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:23:10,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:23:10,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:23:10,715 INFO L87 Difference]: Start difference. First operand 368 states and 561 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 14:23:10,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:23:10,754 INFO L93 Difference]: Finished difference Result 711 states and 1087 transitions. [2025-03-03 14:23:10,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:23:10,755 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 113 [2025-03-03 14:23:10,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:23:10,757 INFO L225 Difference]: With dead ends: 711 [2025-03-03 14:23:10,757 INFO L226 Difference]: Without dead ends: 368 [2025-03-03 14:23:10,758 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:23:10,759 INFO L435 NwaCegarLoop]: 459 mSDtfsCounter, 2 mSDsluCounter, 1360 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1819 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:23:10,759 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1819 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:23:10,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2025-03-03 14:23:10,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 368. [2025-03-03 14:23:10,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 286 states have (on average 1.5244755244755244) internal successors, (436), 290 states have internal predecessors, (436), 61 states have call successors, (61), 19 states have call predecessors, (61), 20 states have return successors, (63), 58 states have call predecessors, (63), 58 states have call successors, (63) [2025-03-03 14:23:10,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 560 transitions. [2025-03-03 14:23:10,771 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 560 transitions. Word has length 113 [2025-03-03 14:23:10,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:23:10,772 INFO L471 AbstractCegarLoop]: Abstraction has 368 states and 560 transitions. [2025-03-03 14:23:10,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 14:23:10,772 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 560 transitions. [2025-03-03 14:23:10,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-03 14:23:10,773 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:23:10,773 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:23:10,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 14:23:10,774 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:23:10,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:23:10,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1553478037, now seen corresponding path program 3 times [2025-03-03 14:23:10,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:23:10,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702608985] [2025-03-03 14:23:10,774 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 14:23:10,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:23:10,791 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 114 statements into 3 equivalence classes. [2025-03-03 14:23:10,800 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 102 of 114 statements. [2025-03-03 14:23:10,800 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-03 14:23:10,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:10,985 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-03 14:23:10,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:23:10,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702608985] [2025-03-03 14:23:10,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702608985] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:23:10,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:23:10,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 14:23:10,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744477776] [2025-03-03 14:23:10,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:23:10,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 14:23:10,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:23:10,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 14:23:10,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:23:10,987 INFO L87 Difference]: Start difference. First operand 368 states and 560 transitions. Second operand has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 8 states have internal predecessors, (69), 3 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (13), 4 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 14:23:11,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:23:11,444 INFO L93 Difference]: Finished difference Result 962 states and 1390 transitions. [2025-03-03 14:23:11,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 14:23:11,445 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 8 states have internal predecessors, (69), 3 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (13), 4 states have call predecessors, (13), 3 states have call successors, (13) Word has length 114 [2025-03-03 14:23:11,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:23:11,451 INFO L225 Difference]: With dead ends: 962 [2025-03-03 14:23:11,451 INFO L226 Difference]: Without dead ends: 807 [2025-03-03 14:23:11,453 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2025-03-03 14:23:11,453 INFO L435 NwaCegarLoop]: 723 mSDtfsCounter, 1403 mSDsluCounter, 3030 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 251 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1409 SdHoareTripleChecker+Valid, 3753 SdHoareTripleChecker+Invalid, 639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 251 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 14:23:11,453 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1409 Valid, 3753 Invalid, 639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [251 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 14:23:11,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 807 states. [2025-03-03 14:23:11,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 807 to 797. [2025-03-03 14:23:11,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 797 states, 629 states have (on average 1.4721780604133545) internal successors, (926), 636 states have internal predecessors, (926), 112 states have call successors, (112), 49 states have call predecessors, (112), 55 states have return successors, (122), 111 states have call predecessors, (122), 106 states have call successors, (122) [2025-03-03 14:23:11,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 1160 transitions. [2025-03-03 14:23:11,489 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 1160 transitions. Word has length 114 [2025-03-03 14:23:11,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:23:11,490 INFO L471 AbstractCegarLoop]: Abstraction has 797 states and 1160 transitions. [2025-03-03 14:23:11,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 8 states have internal predecessors, (69), 3 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (13), 4 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 14:23:11,491 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 1160 transitions. [2025-03-03 14:23:11,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-03 14:23:11,492 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:23:11,492 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:23:11,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 14:23:11,493 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:23:11,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:23:11,493 INFO L85 PathProgramCache]: Analyzing trace with hash 580101088, now seen corresponding path program 1 times [2025-03-03 14:23:11,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:23:11,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081432608] [2025-03-03 14:23:11,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:11,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:23:11,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-03 14:23:11,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-03 14:23:11,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:11,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:11,605 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:23:11,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:23:11,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081432608] [2025-03-03 14:23:11,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081432608] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:23:11,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:23:11,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:23:11,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955788114] [2025-03-03 14:23:11,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:23:11,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:23:11,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:23:11,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:23:11,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:23:11,607 INFO L87 Difference]: Start difference. First operand 797 states and 1160 transitions. Second operand has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 states have internal predecessors, (74), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 14:23:11,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:23:11,651 INFO L93 Difference]: Finished difference Result 1573 states and 2293 transitions. [2025-03-03 14:23:11,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:23:11,651 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 states have internal predecessors, (74), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 115 [2025-03-03 14:23:11,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:23:11,655 INFO L225 Difference]: With dead ends: 1573 [2025-03-03 14:23:11,655 INFO L226 Difference]: Without dead ends: 799 [2025-03-03 14:23:11,658 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:23:11,658 INFO L435 NwaCegarLoop]: 462 mSDtfsCounter, 1 mSDsluCounter, 1374 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1836 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:23:11,658 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1836 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:23:11,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2025-03-03 14:23:11,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 799. [2025-03-03 14:23:11,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 799 states, 630 states have (on average 1.4714285714285715) internal successors, (927), 638 states have internal predecessors, (927), 112 states have call successors, (112), 49 states have call predecessors, (112), 56 states have return successors, (124), 111 states have call predecessors, (124), 106 states have call successors, (124) [2025-03-03 14:23:11,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 1163 transitions. [2025-03-03 14:23:11,686 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 1163 transitions. Word has length 115 [2025-03-03 14:23:11,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:23:11,686 INFO L471 AbstractCegarLoop]: Abstraction has 799 states and 1163 transitions. [2025-03-03 14:23:11,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 states have internal predecessors, (74), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 14:23:11,686 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 1163 transitions. [2025-03-03 14:23:11,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-03 14:23:11,688 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:23:11,688 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:23:11,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 14:23:11,688 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:23:11,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:23:11,689 INFO L85 PathProgramCache]: Analyzing trace with hash -290131318, now seen corresponding path program 1 times [2025-03-03 14:23:11,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:23:11,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199847189] [2025-03-03 14:23:11,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:11,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:23:11,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-03 14:23:11,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-03 14:23:11,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:11,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:11,801 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-03 14:23:11,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:23:11,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199847189] [2025-03-03 14:23:11,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199847189] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:23:11,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:23:11,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 14:23:11,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685229619] [2025-03-03 14:23:11,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:23:11,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 14:23:11,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:23:11,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 14:23:11,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:23:11,803 INFO L87 Difference]: Start difference. First operand 799 states and 1163 transitions. Second operand has 8 states, 7 states have (on average 11.285714285714286) internal successors, (79), 8 states have internal predecessors, (79), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2025-03-03 14:23:11,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:23:11,922 INFO L93 Difference]: Finished difference Result 1578 states and 2302 transitions. [2025-03-03 14:23:11,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 14:23:11,922 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 11.285714285714286) internal successors, (79), 8 states have internal predecessors, (79), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) Word has length 116 [2025-03-03 14:23:11,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:23:11,928 INFO L225 Difference]: With dead ends: 1578 [2025-03-03 14:23:11,928 INFO L226 Difference]: Without dead ends: 804 [2025-03-03 14:23:11,931 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:23:11,931 INFO L435 NwaCegarLoop]: 454 mSDtfsCounter, 5 mSDsluCounter, 2695 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 3149 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:23:11,932 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 3149 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:23:11,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2025-03-03 14:23:11,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 804. [2025-03-03 14:23:11,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 804 states, 634 states have (on average 1.4700315457413249) internal successors, (932), 642 states have internal predecessors, (932), 112 states have call successors, (112), 50 states have call predecessors, (112), 57 states have return successors, (129), 111 states have call predecessors, (129), 106 states have call successors, (129) [2025-03-03 14:23:11,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 1173 transitions. [2025-03-03 14:23:11,963 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 1173 transitions. Word has length 116 [2025-03-03 14:23:11,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:23:11,963 INFO L471 AbstractCegarLoop]: Abstraction has 804 states and 1173 transitions. [2025-03-03 14:23:11,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 11.285714285714286) internal successors, (79), 8 states have internal predecessors, (79), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2025-03-03 14:23:11,964 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1173 transitions. [2025-03-03 14:23:11,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-03 14:23:11,965 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:23:11,965 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:23:11,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 14:23:11,966 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:23:11,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:23:11,966 INFO L85 PathProgramCache]: Analyzing trace with hash 973384741, now seen corresponding path program 1 times [2025-03-03 14:23:11,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:23:11,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175495054] [2025-03-03 14:23:11,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:11,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:23:11,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-03 14:23:11,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-03 14:23:11,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:11,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:12,046 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:23:12,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:23:12,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175495054] [2025-03-03 14:23:12,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175495054] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:23:12,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [500553505] [2025-03-03 14:23:12,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:12,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:23:12,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:23:12,049 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:23:12,050 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:23:12,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-03 14:23:12,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-03 14:23:12,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:12,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:12,277 INFO L256 TraceCheckSpWp]: Trace formula consists of 1047 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:23:12,279 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:23:12,299 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:23:12,301 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:23:12,365 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:23:12,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [500553505] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:23:12,366 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:23:12,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-03 14:23:12,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855611040] [2025-03-03 14:23:12,366 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:23:12,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:23:12,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:23:12,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:23:12,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:23:12,368 INFO L87 Difference]: Start difference. First operand 804 states and 1173 transitions. Second operand has 7 states, 7 states have (on average 15.285714285714286) internal successors, (107), 7 states have internal predecessors, (107), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-03 14:23:12,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:23:12,515 INFO L93 Difference]: Finished difference Result 1796 states and 2664 transitions. [2025-03-03 14:23:12,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:23:12,516 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.285714285714286) internal successors, (107), 7 states have internal predecessors, (107), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 117 [2025-03-03 14:23:12,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:23:12,525 INFO L225 Difference]: With dead ends: 1796 [2025-03-03 14:23:12,525 INFO L226 Difference]: Without dead ends: 1205 [2025-03-03 14:23:12,531 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:23:12,532 INFO L435 NwaCegarLoop]: 498 mSDtfsCounter, 563 mSDsluCounter, 926 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 608 SdHoareTripleChecker+Valid, 1424 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:23:12,532 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [608 Valid, 1424 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:23:12,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1205 states. [2025-03-03 14:23:12,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1205 to 1127. [2025-03-03 14:23:12,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1127 states, 893 states have (on average 1.528555431131019) internal successors, (1365), 901 states have internal predecessors, (1365), 176 states have call successors, (176), 50 states have call predecessors, (176), 57 states have return successors, (203), 175 states have call predecessors, (203), 170 states have call successors, (203) [2025-03-03 14:23:12,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1127 states to 1127 states and 1744 transitions. [2025-03-03 14:23:12,591 INFO L78 Accepts]: Start accepts. Automaton has 1127 states and 1744 transitions. Word has length 117 [2025-03-03 14:23:12,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:23:12,591 INFO L471 AbstractCegarLoop]: Abstraction has 1127 states and 1744 transitions. [2025-03-03 14:23:12,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.285714285714286) internal successors, (107), 7 states have internal predecessors, (107), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-03 14:23:12,592 INFO L276 IsEmpty]: Start isEmpty. Operand 1127 states and 1744 transitions. [2025-03-03 14:23:12,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-03 14:23:12,595 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:23:12,596 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:23:12,603 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:23:12,796 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:23:12,796 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:23:12,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:23:12,797 INFO L85 PathProgramCache]: Analyzing trace with hash 420370693, now seen corresponding path program 1 times [2025-03-03 14:23:12,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:23:12,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165900759] [2025-03-03 14:23:12,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:12,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:23:12,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-03 14:23:12,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-03 14:23:12,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:12,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:12,850 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:23:12,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:23:12,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165900759] [2025-03-03 14:23:12,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165900759] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:23:12,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:23:12,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:23:12,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130828143] [2025-03-03 14:23:12,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:23:12,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:23:12,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:23:12,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:23:12,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:23:12,852 INFO L87 Difference]: Start difference. First operand 1127 states and 1744 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:23:12,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:23:12,893 INFO L93 Difference]: Finished difference Result 2531 states and 3974 transitions. [2025-03-03 14:23:12,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:23:12,893 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 123 [2025-03-03 14:23:12,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:23:12,900 INFO L225 Difference]: With dead ends: 2531 [2025-03-03 14:23:12,900 INFO L226 Difference]: Without dead ends: 1473 [2025-03-03 14:23:12,904 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:23:12,905 INFO L435 NwaCegarLoop]: 479 mSDtfsCounter, 105 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 944 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:23:12,905 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 944 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:23:12,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1473 states. [2025-03-03 14:23:12,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1473 to 1447. [2025-03-03 14:23:12,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1447 states, 1149 states have (on average 1.5535248041775458) internal successors, (1785), 1157 states have internal predecessors, (1785), 240 states have call successors, (240), 50 states have call predecessors, (240), 57 states have return successors, (277), 239 states have call predecessors, (277), 234 states have call successors, (277) [2025-03-03 14:23:12,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1447 states to 1447 states and 2302 transitions. [2025-03-03 14:23:12,961 INFO L78 Accepts]: Start accepts. Automaton has 1447 states and 2302 transitions. Word has length 123 [2025-03-03 14:23:12,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:23:12,962 INFO L471 AbstractCegarLoop]: Abstraction has 1447 states and 2302 transitions. [2025-03-03 14:23:12,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:23:12,962 INFO L276 IsEmpty]: Start isEmpty. Operand 1447 states and 2302 transitions. [2025-03-03 14:23:12,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-03 14:23:12,967 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:23:12,967 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:23:12,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 14:23:12,967 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:23:12,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:23:12,967 INFO L85 PathProgramCache]: Analyzing trace with hash 962108668, now seen corresponding path program 1 times [2025-03-03 14:23:12,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:23:12,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730340206] [2025-03-03 14:23:12,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:12,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:23:13,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-03 14:23:13,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-03 14:23:13,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:13,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:13,045 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:23:13,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:23:13,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730340206] [2025-03-03 14:23:13,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730340206] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:23:13,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:23:13,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:23:13,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922010459] [2025-03-03 14:23:13,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:23:13,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:23:13,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:23:13,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:23:13,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:23:13,048 INFO L87 Difference]: Start difference. First operand 1447 states and 2302 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:23:13,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:23:13,130 INFO L93 Difference]: Finished difference Result 3300 states and 5296 transitions. [2025-03-03 14:23:13,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:23:13,131 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 124 [2025-03-03 14:23:13,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:23:13,141 INFO L225 Difference]: With dead ends: 3300 [2025-03-03 14:23:13,142 INFO L226 Difference]: Without dead ends: 1973 [2025-03-03 14:23:13,148 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:23:13,149 INFO L435 NwaCegarLoop]: 469 mSDtfsCounter, 103 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 930 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:23:13,150 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 930 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:23:13,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1973 states. [2025-03-03 14:23:13,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1973 to 1947. [2025-03-03 14:23:13,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1947 states, 1554 states have (on average 1.5752895752895753) internal successors, (2448), 1562 states have internal predecessors, (2448), 335 states have call successors, (335), 50 states have call predecessors, (335), 57 states have return successors, (372), 334 states have call predecessors, (372), 329 states have call successors, (372) [2025-03-03 14:23:13,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1947 states to 1947 states and 3155 transitions. [2025-03-03 14:23:13,230 INFO L78 Accepts]: Start accepts. Automaton has 1947 states and 3155 transitions. Word has length 124 [2025-03-03 14:23:13,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:23:13,230 INFO L471 AbstractCegarLoop]: Abstraction has 1947 states and 3155 transitions. [2025-03-03 14:23:13,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:23:13,230 INFO L276 IsEmpty]: Start isEmpty. Operand 1947 states and 3155 transitions. [2025-03-03 14:23:13,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-03 14:23:13,240 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:23:13,240 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:23:13,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 14:23:13,240 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:23:13,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:23:13,241 INFO L85 PathProgramCache]: Analyzing trace with hash -93045532, now seen corresponding path program 1 times [2025-03-03 14:23:13,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:23:13,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093906800] [2025-03-03 14:23:13,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:13,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:23:13,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-03 14:23:13,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-03 14:23:13,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:13,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:13,296 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:23:13,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:23:13,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093906800] [2025-03-03 14:23:13,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093906800] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:23:13,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:23:13,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:23:13,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621106616] [2025-03-03 14:23:13,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:23:13,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:23:13,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:23:13,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:23:13,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:23:13,297 INFO L87 Difference]: Start difference. First operand 1947 states and 3155 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:23:13,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:23:13,382 INFO L93 Difference]: Finished difference Result 4434 states and 7253 transitions. [2025-03-03 14:23:13,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:23:13,383 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 125 [2025-03-03 14:23:13,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:23:13,397 INFO L225 Difference]: With dead ends: 4434 [2025-03-03 14:23:13,397 INFO L226 Difference]: Without dead ends: 2729 [2025-03-03 14:23:13,404 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:23:13,404 INFO L435 NwaCegarLoop]: 467 mSDtfsCounter, 101 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 925 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:23:13,405 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 925 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:23:13,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2729 states. [2025-03-03 14:23:13,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2729 to 2703. [2025-03-03 14:23:13,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2703 states, 2187 states have (on average 1.5939643347050754) internal successors, (3486), 2195 states have internal predecessors, (3486), 458 states have call successors, (458), 50 states have call predecessors, (458), 57 states have return successors, (511), 457 states have call predecessors, (511), 452 states have call successors, (511) [2025-03-03 14:23:13,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2703 states to 2703 states and 4455 transitions. [2025-03-03 14:23:13,517 INFO L78 Accepts]: Start accepts. Automaton has 2703 states and 4455 transitions. Word has length 125 [2025-03-03 14:23:13,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:23:13,517 INFO L471 AbstractCegarLoop]: Abstraction has 2703 states and 4455 transitions. [2025-03-03 14:23:13,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:23:13,517 INFO L276 IsEmpty]: Start isEmpty. Operand 2703 states and 4455 transitions. [2025-03-03 14:23:13,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-03 14:23:13,527 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:23:13,527 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:23:13,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 14:23:13,528 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:23:13,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:23:13,528 INFO L85 PathProgramCache]: Analyzing trace with hash 279616189, now seen corresponding path program 1 times [2025-03-03 14:23:13,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:23:13,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967759614] [2025-03-03 14:23:13,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:13,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:23:13,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-03 14:23:13,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-03 14:23:13,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:13,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:13,578 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:23:13,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:23:13,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967759614] [2025-03-03 14:23:13,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967759614] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:23:13,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:23:13,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:23:13,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750012558] [2025-03-03 14:23:13,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:23:13,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:23:13,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:23:13,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:23:13,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:23:13,580 INFO L87 Difference]: Start difference. First operand 2703 states and 4455 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:23:13,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:23:13,683 INFO L93 Difference]: Finished difference Result 6197 states and 10299 transitions. [2025-03-03 14:23:13,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:23:13,683 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 126 [2025-03-03 14:23:13,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:23:13,701 INFO L225 Difference]: With dead ends: 6197 [2025-03-03 14:23:13,702 INFO L226 Difference]: Without dead ends: 3936 [2025-03-03 14:23:13,710 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:23:13,710 INFO L435 NwaCegarLoop]: 467 mSDtfsCounter, 99 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 925 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:23:13,710 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 925 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:23:13,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3936 states. [2025-03-03 14:23:13,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3936 to 3910. [2025-03-03 14:23:13,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3910 states, 3215 states have (on average 1.608398133748056) internal successors, (5171), 3223 states have internal predecessors, (5171), 637 states have call successors, (637), 50 states have call predecessors, (637), 57 states have return successors, (716), 636 states have call predecessors, (716), 631 states have call successors, (716) [2025-03-03 14:23:13,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3910 states to 3910 states and 6524 transitions. [2025-03-03 14:23:13,859 INFO L78 Accepts]: Start accepts. Automaton has 3910 states and 6524 transitions. Word has length 126 [2025-03-03 14:23:13,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:23:13,859 INFO L471 AbstractCegarLoop]: Abstraction has 3910 states and 6524 transitions. [2025-03-03 14:23:13,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:23:13,859 INFO L276 IsEmpty]: Start isEmpty. Operand 3910 states and 6524 transitions. [2025-03-03 14:23:13,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-03 14:23:13,871 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:23:13,871 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:23:13,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 14:23:13,871 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:23:13,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:23:13,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1576894947, now seen corresponding path program 1 times [2025-03-03 14:23:13,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:23:13,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258125567] [2025-03-03 14:23:13,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:13,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:23:13,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-03 14:23:13,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-03 14:23:13,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:13,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:13,942 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:23:13,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:23:13,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258125567] [2025-03-03 14:23:13,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258125567] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:23:13,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:23:13,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:23:13,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366729069] [2025-03-03 14:23:13,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:23:13,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:23:13,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:23:13,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:23:13,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:23:13,945 INFO L87 Difference]: Start difference. First operand 3910 states and 6524 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:23:14,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:23:14,104 INFO L93 Difference]: Finished difference Result 9089 states and 15290 transitions. [2025-03-03 14:23:14,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:23:14,105 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 127 [2025-03-03 14:23:14,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:23:14,132 INFO L225 Difference]: With dead ends: 9089 [2025-03-03 14:23:14,132 INFO L226 Difference]: Without dead ends: 5928 [2025-03-03 14:23:14,145 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:23:14,146 INFO L435 NwaCegarLoop]: 476 mSDtfsCounter, 97 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 931 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:23:14,146 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 931 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:23:14,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5928 states. [2025-03-03 14:23:14,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5928 to 5902. [2025-03-03 14:23:14,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5902 states, 4831 states have (on average 1.6112606085696544) internal successors, (7784), 4839 states have internal predecessors, (7784), 1013 states have call successors, (1013), 50 states have call predecessors, (1013), 57 states have return successors, (1136), 1012 states have call predecessors, (1136), 1007 states have call successors, (1136) [2025-03-03 14:23:14,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5902 states to 5902 states and 9933 transitions. [2025-03-03 14:23:14,420 INFO L78 Accepts]: Start accepts. Automaton has 5902 states and 9933 transitions. Word has length 127 [2025-03-03 14:23:14,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:23:14,421 INFO L471 AbstractCegarLoop]: Abstraction has 5902 states and 9933 transitions. [2025-03-03 14:23:14,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:23:14,421 INFO L276 IsEmpty]: Start isEmpty. Operand 5902 states and 9933 transitions. [2025-03-03 14:23:14,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-03 14:23:14,437 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:23:14,437 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:23:14,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 14:23:14,437 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:23:14,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:23:14,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1633235330, now seen corresponding path program 1 times [2025-03-03 14:23:14,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:23:14,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159739624] [2025-03-03 14:23:14,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:14,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:23:14,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-03 14:23:14,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-03 14:23:14,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:14,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:14,479 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:23:14,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:23:14,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159739624] [2025-03-03 14:23:14,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159739624] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:23:14,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:23:14,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:23:14,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375108605] [2025-03-03 14:23:14,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:23:14,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:23:14,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:23:14,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:23:14,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:23:14,481 INFO L87 Difference]: Start difference. First operand 5902 states and 9933 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:23:14,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:23:14,690 INFO L93 Difference]: Finished difference Result 14321 states and 24295 transitions. [2025-03-03 14:23:14,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:23:14,690 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 128 [2025-03-03 14:23:14,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:23:14,734 INFO L225 Difference]: With dead ends: 14321 [2025-03-03 14:23:14,735 INFO L226 Difference]: Without dead ends: 9539 [2025-03-03 14:23:14,754 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:23:14,755 INFO L435 NwaCegarLoop]: 467 mSDtfsCounter, 95 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 928 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:23:14,755 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 928 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:23:14,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9539 states. [2025-03-03 14:23:15,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9539 to 9513. [2025-03-03 14:23:15,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9513 states, 7836 states have (on average 1.6153649821337417) internal successors, (12658), 7844 states have internal predecessors, (12658), 1619 states have call successors, (1619), 50 states have call predecessors, (1619), 57 states have return successors, (1820), 1618 states have call predecessors, (1820), 1613 states have call successors, (1820) [2025-03-03 14:23:15,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9513 states to 9513 states and 16097 transitions. [2025-03-03 14:23:15,117 INFO L78 Accepts]: Start accepts. Automaton has 9513 states and 16097 transitions. Word has length 128 [2025-03-03 14:23:15,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:23:15,117 INFO L471 AbstractCegarLoop]: Abstraction has 9513 states and 16097 transitions. [2025-03-03 14:23:15,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:23:15,118 INFO L276 IsEmpty]: Start isEmpty. Operand 9513 states and 16097 transitions. [2025-03-03 14:23:15,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-03 14:23:15,140 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:23:15,140 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:23:15,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 14:23:15,140 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:23:15,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:23:15,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1797925122, now seen corresponding path program 1 times [2025-03-03 14:23:15,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:23:15,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081651656] [2025-03-03 14:23:15,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:15,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:23:15,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-03 14:23:15,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-03 14:23:15,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:15,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:15,218 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:23:15,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:23:15,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081651656] [2025-03-03 14:23:15,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081651656] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:23:15,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:23:15,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:23:15,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750479972] [2025-03-03 14:23:15,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:23:15,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:23:15,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:23:15,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:23:15,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:23:15,220 INFO L87 Difference]: Start difference. First operand 9513 states and 16097 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:23:15,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:23:15,675 INFO L93 Difference]: Finished difference Result 24303 states and 41358 transitions. [2025-03-03 14:23:15,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:23:15,676 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 129 [2025-03-03 14:23:15,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:23:15,737 INFO L225 Difference]: With dead ends: 24303 [2025-03-03 14:23:15,738 INFO L226 Difference]: Without dead ends: 16355 [2025-03-03 14:23:15,810 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:23:15,811 INFO L435 NwaCegarLoop]: 478 mSDtfsCounter, 93 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 942 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:23:15,811 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 942 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:23:15,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16355 states. [2025-03-03 14:23:16,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16355 to 16329. [2025-03-03 14:23:16,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16329 states, 13449 states have (on average 1.610751728753067) internal successors, (21663), 13457 states have internal predecessors, (21663), 2822 states have call successors, (2822), 50 states have call predecessors, (2822), 57 states have return successors, (3167), 2821 states have call predecessors, (3167), 2816 states have call successors, (3167) [2025-03-03 14:23:16,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16329 states to 16329 states and 27652 transitions. [2025-03-03 14:23:16,355 INFO L78 Accepts]: Start accepts. Automaton has 16329 states and 27652 transitions. Word has length 129 [2025-03-03 14:23:16,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:23:16,355 INFO L471 AbstractCegarLoop]: Abstraction has 16329 states and 27652 transitions. [2025-03-03 14:23:16,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:23:16,356 INFO L276 IsEmpty]: Start isEmpty. Operand 16329 states and 27652 transitions. [2025-03-03 14:23:16,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-03 14:23:16,387 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:23:16,387 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:23:16,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 14:23:16,387 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:23:16,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:23:16,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1673036223, now seen corresponding path program 1 times [2025-03-03 14:23:16,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:23:16,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360167260] [2025-03-03 14:23:16,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:16,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:23:16,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-03 14:23:16,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-03 14:23:16,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:16,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:16,437 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:23:16,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:23:16,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360167260] [2025-03-03 14:23:16,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360167260] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:23:16,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:23:16,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:23:16,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561509815] [2025-03-03 14:23:16,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:23:16,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:23:16,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:23:16,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:23:16,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:23:16,438 INFO L87 Difference]: Start difference. First operand 16329 states and 27652 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:23:17,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:23:17,125 INFO L93 Difference]: Finished difference Result 42874 states and 73022 transitions. [2025-03-03 14:23:17,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:23:17,126 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 130 [2025-03-03 14:23:17,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:23:17,234 INFO L225 Difference]: With dead ends: 42874 [2025-03-03 14:23:17,235 INFO L226 Difference]: Without dead ends: 28744 [2025-03-03 14:23:17,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:23:17,273 INFO L435 NwaCegarLoop]: 467 mSDtfsCounter, 91 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 928 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:23:17,273 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 928 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:23:17,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28744 states. [2025-03-03 14:23:18,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28744 to 28718. [2025-03-03 14:23:18,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28718 states, 23799 states have (on average 1.6093533341737047) internal successors, (38301), 23807 states have internal predecessors, (38301), 4861 states have call successors, (4861), 50 states have call predecessors, (4861), 57 states have return successors, (5480), 4860 states have call predecessors, (5480), 4855 states have call successors, (5480) [2025-03-03 14:23:18,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28718 states to 28718 states and 48642 transitions. [2025-03-03 14:23:18,550 INFO L78 Accepts]: Start accepts. Automaton has 28718 states and 48642 transitions. Word has length 130 [2025-03-03 14:23:18,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:23:18,551 INFO L471 AbstractCegarLoop]: Abstraction has 28718 states and 48642 transitions. [2025-03-03 14:23:18,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:23:18,551 INFO L276 IsEmpty]: Start isEmpty. Operand 28718 states and 48642 transitions. [2025-03-03 14:23:18,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-03 14:23:18,583 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:23:18,584 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] [2025-03-03 14:23:18,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 14:23:18,584 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:23:18,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:23:18,584 INFO L85 PathProgramCache]: Analyzing trace with hash 460869441, now seen corresponding path program 1 times [2025-03-03 14:23:18,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:23:18,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771218671] [2025-03-03 14:23:18,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:18,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:23:18,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-03 14:23:18,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-03 14:23:18,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:18,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:18,629 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:23:18,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:23:18,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771218671] [2025-03-03 14:23:18,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771218671] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:23:18,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:23:18,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:23:18,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470139429] [2025-03-03 14:23:18,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:23:18,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:23:18,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:23:18,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:23:18,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:23:18,630 INFO L87 Difference]: Start difference. First operand 28718 states and 48642 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, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:23:19,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:23:19,538 INFO L93 Difference]: Finished difference Result 77856 states and 132469 transitions. [2025-03-03 14:23:19,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:23:19,539 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, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 131 [2025-03-03 14:23:19,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:23:19,748 INFO L225 Difference]: With dead ends: 77856 [2025-03-03 14:23:19,749 INFO L226 Difference]: Without dead ends: 52100 [2025-03-03 14:23:19,829 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:23:19,832 INFO L435 NwaCegarLoop]: 472 mSDtfsCounter, 89 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 933 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:23:19,832 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 933 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:23:19,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52100 states. [2025-03-03 14:23:21,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52100 to 52074. [2025-03-03 14:23:21,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52074 states, 43440 states have (on average 1.6055939226519338) internal successors, (69747), 43448 states have internal predecessors, (69747), 8576 states have call successors, (8576), 50 states have call predecessors, (8576), 57 states have return successors, (9727), 8575 states have call predecessors, (9727), 8570 states have call successors, (9727) [2025-03-03 14:23:21,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52074 states to 52074 states and 88050 transitions. [2025-03-03 14:23:21,828 INFO L78 Accepts]: Start accepts. Automaton has 52074 states and 88050 transitions. Word has length 131 [2025-03-03 14:23:21,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:23:21,829 INFO L471 AbstractCegarLoop]: Abstraction has 52074 states and 88050 transitions. [2025-03-03 14:23:21,829 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, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:23:21,829 INFO L276 IsEmpty]: Start isEmpty. Operand 52074 states and 88050 transitions. [2025-03-03 14:23:21,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-03 14:23:21,864 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:23:21,864 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] [2025-03-03 14:23:21,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 14:23:21,864 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:23:21,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:23:21,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1842398816, now seen corresponding path program 1 times [2025-03-03 14:23:21,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:23:21,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556717337] [2025-03-03 14:23:21,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:21,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:23:21,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-03 14:23:21,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-03 14:23:21,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:21,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:21,925 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:23:21,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:23:21,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556717337] [2025-03-03 14:23:21,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556717337] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:23:21,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:23:21,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:23:21,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240528] [2025-03-03 14:23:21,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:23:21,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:23:21,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:23:21,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:23:21,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:23:21,927 INFO L87 Difference]: Start difference. First operand 52074 states and 88050 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, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:23:23,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:23:23,898 INFO L93 Difference]: Finished difference Result 97117 states and 164577 transitions. [2025-03-03 14:23:23,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:23:23,899 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, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 132 [2025-03-03 14:23:23,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:23:24,203 INFO L225 Difference]: With dead ends: 97117 [2025-03-03 14:23:24,203 INFO L226 Difference]: Without dead ends: 96526 [2025-03-03 14:23:24,235 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:23:24,236 INFO L435 NwaCegarLoop]: 476 mSDtfsCounter, 84 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 942 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:23:24,236 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 942 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:23:24,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96526 states. [2025-03-03 14:23:26,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96526 to 96500. [2025-03-03 14:23:26,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96500 states, 81067 states have (on average 1.599713816966213) internal successors, (129684), 81075 states have internal predecessors, (129684), 15375 states have call successors, (15375), 50 states have call predecessors, (15375), 57 states have return successors, (17572), 15374 states have call predecessors, (17572), 15369 states have call successors, (17572) [2025-03-03 14:23:27,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96500 states to 96500 states and 162631 transitions. [2025-03-03 14:23:27,224 INFO L78 Accepts]: Start accepts. Automaton has 96500 states and 162631 transitions. Word has length 132 [2025-03-03 14:23:27,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:23:27,225 INFO L471 AbstractCegarLoop]: Abstraction has 96500 states and 162631 transitions. [2025-03-03 14:23:27,225 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, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:23:27,225 INFO L276 IsEmpty]: Start isEmpty. Operand 96500 states and 162631 transitions. [2025-03-03 14:23:27,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-03 14:23:27,270 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:23:27,270 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] [2025-03-03 14:23:27,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 14:23:27,270 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:23:27,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:23:27,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1622502720, now seen corresponding path program 1 times [2025-03-03 14:23:27,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:23:27,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212683951] [2025-03-03 14:23:27,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:27,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:23:27,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-03 14:23:27,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-03 14:23:27,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:27,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:27,505 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:23:27,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:23:27,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212683951] [2025-03-03 14:23:27,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212683951] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:23:27,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:23:27,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 14:23:27,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536215165] [2025-03-03 14:23:27,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:23:27,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 14:23:27,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:23:27,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 14:23:27,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:23:27,508 INFO L87 Difference]: Start difference. First operand 96500 states and 162631 transitions. Second operand has 11 states, 9 states have (on average 10.11111111111111) internal successors, (91), 10 states have internal predecessors, (91), 6 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (13), 4 states have call predecessors, (13), 5 states have call successors, (13) [2025-03-03 14:23:29,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:23:29,685 INFO L93 Difference]: Finished difference Result 97283 states and 163752 transitions. [2025-03-03 14:23:29,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 14:23:29,685 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 10.11111111111111) internal successors, (91), 10 states have internal predecessors, (91), 6 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (13), 4 states have call predecessors, (13), 5 states have call successors, (13) Word has length 133 [2025-03-03 14:23:29,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:23:30,050 INFO L225 Difference]: With dead ends: 97283 [2025-03-03 14:23:30,050 INFO L226 Difference]: Without dead ends: 96450 [2025-03-03 14:23:30,099 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2025-03-03 14:23:30,102 INFO L435 NwaCegarLoop]: 459 mSDtfsCounter, 125 mSDsluCounter, 4114 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 4573 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:23:30,103 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 4573 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:23:30,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96450 states. [2025-03-03 14:23:33,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96450 to 96444. [2025-03-03 14:23:33,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96444 states, 81022 states have (on average 1.5998494236133396) internal successors, (129623), 81031 states have internal predecessors, (129623), 15369 states have call successors, (15369), 46 states have call predecessors, (15369), 52 states have return successors, (17567), 15366 states have call predecessors, (17567), 15364 states have call successors, (17567) [2025-03-03 14:23:33,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96444 states to 96444 states and 162559 transitions. [2025-03-03 14:23:33,870 INFO L78 Accepts]: Start accepts. Automaton has 96444 states and 162559 transitions. Word has length 133 [2025-03-03 14:23:33,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:23:33,870 INFO L471 AbstractCegarLoop]: Abstraction has 96444 states and 162559 transitions. [2025-03-03 14:23:33,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 10.11111111111111) internal successors, (91), 10 states have internal predecessors, (91), 6 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (13), 4 states have call predecessors, (13), 5 states have call successors, (13) [2025-03-03 14:23:33,871 INFO L276 IsEmpty]: Start isEmpty. Operand 96444 states and 162559 transitions. [2025-03-03 14:23:33,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-03 14:23:33,915 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:23:33,916 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:23:33,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 14:23:33,916 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:23:33,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:23:33,916 INFO L85 PathProgramCache]: Analyzing trace with hash -487923017, now seen corresponding path program 1 times [2025-03-03 14:23:33,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:23:33,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521840462] [2025-03-03 14:23:33,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:33,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:23:33,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-03 14:23:33,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-03 14:23:33,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:33,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:34,641 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-03 14:23:34,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:23:34,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521840462] [2025-03-03 14:23:34,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521840462] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:23:34,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [838894403] [2025-03-03 14:23:34,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:34,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:23:34,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:23:34,644 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:23:34,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-03 14:23:34,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-03 14:23:34,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-03 14:23:34,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:34,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:34,884 INFO L256 TraceCheckSpWp]: Trace formula consists of 1121 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-03 14:23:34,887 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:23:35,157 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-03 14:23:35,161 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:23:35,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [838894403] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:23:35,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:23:35,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [16] total 27 [2025-03-03 14:23:35,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650678911] [2025-03-03 14:23:35,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:23:35,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 14:23:35,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:23:35,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 14:23:35,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=639, Unknown=0, NotChecked=0, Total=702 [2025-03-03 14:23:35,162 INFO L87 Difference]: Start difference. First operand 96444 states and 162559 transitions. Second operand has 13 states, 12 states have (on average 8.416666666666666) internal successors, (101), 11 states have internal predecessors, (101), 6 states have call successors, (16), 5 states have call predecessors, (16), 6 states have return successors, (13), 7 states have call predecessors, (13), 5 states have call successors, (13) [2025-03-03 14:23:37,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:23:37,101 INFO L93 Difference]: Finished difference Result 97253 states and 163685 transitions. [2025-03-03 14:23:37,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-03 14:23:37,102 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 8.416666666666666) internal successors, (101), 11 states have internal predecessors, (101), 6 states have call successors, (16), 5 states have call predecessors, (16), 6 states have return successors, (13), 7 states have call predecessors, (13), 5 states have call successors, (13) Word has length 136 [2025-03-03 14:23:37,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:23:37,490 INFO L225 Difference]: With dead ends: 97253 [2025-03-03 14:23:37,490 INFO L226 Difference]: Without dead ends: 97075 [2025-03-03 14:23:37,560 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=181, Invalid=1541, Unknown=0, NotChecked=0, Total=1722 [2025-03-03 14:23:37,560 INFO L435 NwaCegarLoop]: 491 mSDtfsCounter, 748 mSDsluCounter, 4751 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 752 SdHoareTripleChecker+Valid, 5242 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 14:23:37,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [752 Valid, 5242 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 14:23:37,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97075 states.