./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec27_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_spec27_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 195d502e207cba6e22b4d3a0f1eab4288ed491325552159482eaed582ac159e0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 14:22:05,458 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 14:22:05,516 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 14:22:05,524 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 14:22:05,524 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 14:22:05,546 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 14:22:05,546 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 14:22:05,546 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 14:22:05,547 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 14:22:05,547 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 14:22:05,547 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 14:22:05,547 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 14:22:05,547 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 14:22:05,547 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 14:22:05,547 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 14:22:05,547 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 14:22:05,547 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 14:22:05,547 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 14:22:05,549 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 14:22:05,549 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 14:22:05,549 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 14:22:05,549 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 14:22:05,549 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 14:22:05,549 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 14:22:05,549 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 14:22:05,549 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 14:22:05,549 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 14:22:05,549 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 14:22:05,549 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 14:22:05,550 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 14:22:05,550 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 14:22:05,550 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 14:22:05,550 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:22:05,550 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 14:22:05,550 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 14:22:05,550 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 14:22:05,550 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 14:22:05,550 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 14:22:05,550 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 14:22:05,550 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 14:22:05,550 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 14:22:05,550 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 14:22:05,550 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 14:22:05,550 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 -> 195d502e207cba6e22b4d3a0f1eab4288ed491325552159482eaed582ac159e0 [2025-03-03 14:22:05,784 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 14:22:05,790 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 14:22:05,795 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 14:22:05,796 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 14:22:05,796 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 14:22:05,798 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec27_product19.cil.c [2025-03-03 14:22:06,955 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a62728a2a/bf395d2bdb244be4ba5e5cadbfaf735d/FLAG17f0de387 [2025-03-03 14:22:07,282 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 14:22:07,282 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec27_product19.cil.c [2025-03-03 14:22:07,298 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a62728a2a/bf395d2bdb244be4ba5e5cadbfaf735d/FLAG17f0de387 [2025-03-03 14:22:07,532 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a62728a2a/bf395d2bdb244be4ba5e5cadbfaf735d [2025-03-03 14:22:07,534 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 14:22:07,535 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 14:22:07,538 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 14:22:07,538 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 14:22:07,541 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 14:22:07,542 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:22:07" (1/1) ... [2025-03-03 14:22:07,544 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60cd8bab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:07, skipping insertion in model container [2025-03-03 14:22:07,545 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:22:07" (1/1) ... [2025-03-03 14:22:07,587 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 14:22:07,856 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec27_product19.cil.c[17762,17775] [2025-03-03 14:22:08,006 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:22:08,016 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 14:22:08,023 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [48] [2025-03-03 14:22:08,024 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"VerifyForward_spec.i","") [414] [2025-03-03 14:22:08,024 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [461] [2025-03-03 14:22:08,024 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [499] [2025-03-03 14:22:08,024 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [799] [2025-03-03 14:22:08,025 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [808] [2025-03-03 14:22:08,025 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [1024] [2025-03-03 14:22:08,025 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [1129] [2025-03-03 14:22:08,026 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [1146] [2025-03-03 14:22:08,026 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [2217] [2025-03-03 14:22:08,026 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [2621] [2025-03-03 14:22:08,057 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec27_product19.cil.c[17762,17775] [2025-03-03 14:22:08,118 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:22:08,140 INFO L204 MainTranslator]: Completed translation [2025-03-03 14:22:08,141 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:08 WrapperNode [2025-03-03 14:22:08,142 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 14:22:08,143 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 14:22:08,143 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 14:22:08,143 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 14:22:08,148 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:08" (1/1) ... [2025-03-03 14:22:08,163 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:08" (1/1) ... [2025-03-03 14:22:08,195 INFO L138 Inliner]: procedures = 127, calls = 186, calls flagged for inlining = 58, calls inlined = 53, statements flattened = 956 [2025-03-03 14:22:08,196 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 14:22:08,196 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 14:22:08,196 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 14:22:08,196 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 14:22:08,202 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:08" (1/1) ... [2025-03-03 14:22:08,203 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:08" (1/1) ... [2025-03-03 14:22:08,207 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:08" (1/1) ... [2025-03-03 14:22:08,231 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 4, 4, 4]. 29 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 4, 4, 4]. The 0 writes are split as follows [0, 0, 0, 0]. [2025-03-03 14:22:08,231 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:08" (1/1) ... [2025-03-03 14:22:08,232 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:08" (1/1) ... [2025-03-03 14:22:08,253 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:08" (1/1) ... [2025-03-03 14:22:08,254 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:08" (1/1) ... [2025-03-03 14:22:08,257 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:08" (1/1) ... [2025-03-03 14:22:08,261 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:08" (1/1) ... [2025-03-03 14:22:08,265 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 14:22:08,269 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 14:22:08,269 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 14:22:08,270 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 14:22:08,271 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:08" (1/1) ... [2025-03-03 14:22:08,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:22:08,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:22:08,296 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 14:22:08,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 14:22:08,316 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-03-03 14:22:08,317 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-03-03 14:22:08,317 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-03-03 14:22:08,317 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-03-03 14:22:08,317 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2025-03-03 14:22:08,317 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2025-03-03 14:22:08,317 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-03-03 14:22:08,317 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-03-03 14:22:08,317 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2025-03-03 14:22:08,318 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2025-03-03 14:22:08,318 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-03-03 14:22:08,318 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-03-03 14:22:08,318 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-03-03 14:22:08,319 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-03-03 14:22:08,319 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-03-03 14:22:08,319 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-03-03 14:22:08,319 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 14:22:08,319 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2025-03-03 14:22:08,319 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2025-03-03 14:22:08,320 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-03-03 14:22:08,320 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-03-03 14:22:08,320 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-03-03 14:22:08,320 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-03-03 14:22:08,320 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-03-03 14:22:08,320 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-03-03 14:22:08,320 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2025-03-03 14:22:08,320 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2025-03-03 14:22:08,320 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2025-03-03 14:22:08,320 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2025-03-03 14:22:08,320 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-03-03 14:22:08,320 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-03-03 14:22:08,320 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-03-03 14:22:08,320 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-03-03 14:22:08,320 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-03-03 14:22:08,320 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-03-03 14:22:08,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 14:22:08,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 14:22:08,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-03 14:22:08,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-03 14:22:08,320 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-03-03 14:22:08,320 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-03-03 14:22:08,320 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 14:22:08,320 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 14:22:08,492 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 14:22:08,494 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 14:22:08,547 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2565: #res := ~retValue_acc~36; [2025-03-03 14:22:08,763 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2265-1: getEmailId_#res#1 := getEmailId_~retValue_acc~28#1; [2025-03-03 14:22:08,763 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2812-1: isKeyPairValid_#res#1 := isKeyPairValid_~retValue_acc~42#1; [2025-03-03 14:22:08,763 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2194-1: getClientId_#res#1 := getClientId_~retValue_acc~26#1; [2025-03-03 14:22:08,763 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2147-1: getClientForwardReceiver_#res#1 := getClientForwardReceiver_~retValue_acc~25#1; [2025-03-03 14:22:08,763 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1759-1: getClientPrivateKey_#res#1 := getClientPrivateKey_~retValue_acc~19#1; [2025-03-03 14:22:08,769 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2528: #res := ~retValue_acc~35; [2025-03-03 14:22:08,792 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2602: #res := ~retValue_acc~37; [2025-03-03 14:22:08,809 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2339: #res := ~retValue_acc~30; [2025-03-03 14:22:08,835 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1851: #res#1 := ~retValue_acc~21#1; [2025-03-03 14:22:08,836 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1806-1: getClientKeyringSize_#res#1 := getClientKeyringSize_~retValue_acc~20#1; [2025-03-03 14:22:08,856 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2075: #res := ~retValue_acc~24; [2025-03-03 14:22:08,885 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1126-1: createEmail_#res#1 := createEmail_~retValue_acc~8#1; [2025-03-03 14:22:09,103 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2769-1: is_queue_empty_#res#1 := is_queue_empty_~retValue_acc~39#1; [2025-03-03 14:22:09,103 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2778-1: get_queued_client_#res#1 := get_queued_client_~retValue_acc~40#1; [2025-03-03 14:22:09,103 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2787-1: get_queued_email_#res#1 := get_queued_email_~retValue_acc~41#1; [2025-03-03 14:22:09,103 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2021-1: getClientKeyringPublicKey_#res#1 := getClientKeyringPublicKey_~retValue_acc~23#1; [2025-03-03 14:22:09,103 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1914-1: getClientKeyringUser_#res#1 := getClientKeyringUser_~retValue_acc~22#1; [2025-03-03 14:22:09,103 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L496-1: valid_product_#res#1 := valid_product_~retValue_acc~4#1; [2025-03-03 14:22:09,109 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2302: #res := ~retValue_acc~29; [2025-03-03 14:22:09,111 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1102: #res := ~retValue_acc~6; [2025-03-03 14:22:09,236 INFO L? ?]: Removed 430 outVars from TransFormulas that were not future-live. [2025-03-03 14:22:09,237 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 14:22:09,251 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 14:22:09,251 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 14:22:09,252 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:22:09 BoogieIcfgContainer [2025-03-03 14:22:09,252 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 14:22:09,253 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 14:22:09,253 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 14:22:09,257 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 14:22:09,257 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 02:22:07" (1/3) ... [2025-03-03 14:22:09,257 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55ff090c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:22:09, skipping insertion in model container [2025-03-03 14:22:09,257 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:08" (2/3) ... [2025-03-03 14:22:09,257 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55ff090c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:22:09, skipping insertion in model container [2025-03-03 14:22:09,257 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:22:09" (3/3) ... [2025-03-03 14:22:09,258 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec27_product19.cil.c [2025-03-03 14:22:09,272 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 14:22:09,276 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec27_product19.cil.c that has 19 procedures, 313 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 14:22:09,332 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 14:22:09,355 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;@54f278dc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 14:22:09,355 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 14:22:09,359 INFO L276 IsEmpty]: Start isEmpty. Operand has 313 states, 247 states have (on average 1.5222672064777327) internal successors, (376), 249 states have internal predecessors, (376), 46 states have call successors, (46), 18 states have call predecessors, (46), 18 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-03 14:22:09,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-03 14:22:09,369 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:09,370 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:09,370 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:09,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:09,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1850852269, now seen corresponding path program 1 times [2025-03-03 14:22:09,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:09,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469494120] [2025-03-03 14:22:09,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:09,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:09,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-03 14:22:09,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-03 14:22:09,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:09,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:09,971 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-03 14:22:09,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:09,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469494120] [2025-03-03 14:22:09,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469494120] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:22:09,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [336826173] [2025-03-03 14:22:09,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:09,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:22:09,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:22:09,978 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:22:09,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 14:22:10,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-03 14:22:10,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-03 14:22:10,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:10,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:10,262 INFO L256 TraceCheckSpWp]: Trace formula consists of 1028 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 14:22:10,268 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:22:10,287 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-03 14:22:10,287 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:22:10,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [336826173] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:10,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:22:10,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 5 [2025-03-03 14:22:10,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448461105] [2025-03-03 14:22:10,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:10,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 14:22:10,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:10,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 14:22:10,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:22:10,311 INFO L87 Difference]: Start difference. First operand has 313 states, 247 states have (on average 1.5222672064777327) internal successors, (376), 249 states have internal predecessors, (376), 46 states have call successors, (46), 18 states have call predecessors, (46), 18 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) Second operand has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-03 14:22:10,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:10,358 INFO L93 Difference]: Finished difference Result 473 states and 692 transitions. [2025-03-03 14:22:10,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 14:22:10,361 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 108 [2025-03-03 14:22:10,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:10,372 INFO L225 Difference]: With dead ends: 473 [2025-03-03 14:22:10,372 INFO L226 Difference]: Without dead ends: 306 [2025-03-03 14:22:10,377 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:22:10,380 INFO L435 NwaCegarLoop]: 465 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, 465 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:10,382 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:10,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2025-03-03 14:22:10,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 306. [2025-03-03 14:22:10,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 241 states have (on average 1.5186721991701244) internal successors, (366), 242 states have internal predecessors, (366), 46 states have call successors, (46), 18 states have call predecessors, (46), 18 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2025-03-03 14:22:10,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 457 transitions. [2025-03-03 14:22:10,422 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 457 transitions. Word has length 108 [2025-03-03 14:22:10,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:10,425 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 457 transitions. [2025-03-03 14:22:10,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-03 14:22:10,425 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 457 transitions. [2025-03-03 14:22:10,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-03 14:22:10,430 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:10,430 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:10,438 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 14:22:10,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 14:22:10,631 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:10,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:10,631 INFO L85 PathProgramCache]: Analyzing trace with hash 900611797, now seen corresponding path program 1 times [2025-03-03 14:22:10,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:10,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200396873] [2025-03-03 14:22:10,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:10,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:10,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-03 14:22:10,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-03 14:22:10,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:10,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:10,850 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-03 14:22:10,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:10,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200396873] [2025-03-03 14:22:10,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200396873] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:22:10,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2041247135] [2025-03-03 14:22:10,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:10,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:22:10,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:22:10,853 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:22:10,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 14:22:11,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-03 14:22:11,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-03 14:22:11,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:11,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:11,136 INFO L256 TraceCheckSpWp]: Trace formula consists of 1029 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 14:22:11,141 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:22:11,174 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-03 14:22:11,174 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:22:11,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2041247135] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:11,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:22:11,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 14:22:11,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77867934] [2025-03-03 14:22:11,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:11,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:22:11,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:11,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:22:11,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:22:11,176 INFO L87 Difference]: Start difference. First operand 306 states and 457 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-03 14:22:11,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:11,216 INFO L93 Difference]: Finished difference Result 462 states and 673 transitions. [2025-03-03 14:22:11,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:22:11,218 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 109 [2025-03-03 14:22:11,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:11,221 INFO L225 Difference]: With dead ends: 462 [2025-03-03 14:22:11,221 INFO L226 Difference]: Without dead ends: 308 [2025-03-03 14:22:11,225 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:22:11,225 INFO L435 NwaCegarLoop]: 456 mSDtfsCounter, 0 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 910 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:11,226 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 910 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:11,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2025-03-03 14:22:11,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 308. [2025-03-03 14:22:11,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 243 states have (on average 1.51440329218107) internal successors, (368), 244 states have internal predecessors, (368), 46 states have call successors, (46), 18 states have call predecessors, (46), 18 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2025-03-03 14:22:11,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 459 transitions. [2025-03-03 14:22:11,252 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 459 transitions. Word has length 109 [2025-03-03 14:22:11,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:11,253 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 459 transitions. [2025-03-03 14:22:11,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-03 14:22:11,253 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 459 transitions. [2025-03-03 14:22:11,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-03 14:22:11,257 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:11,257 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:11,265 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 14:22:11,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-03 14:22:11,458 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:11,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:11,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1725815336, now seen corresponding path program 1 times [2025-03-03 14:22:11,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:11,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575408450] [2025-03-03 14:22:11,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:11,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:11,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-03 14:22:11,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-03 14:22:11,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:11,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:11,648 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-03 14:22:11,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:11,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575408450] [2025-03-03 14:22:11,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575408450] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:22:11,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1475824762] [2025-03-03 14:22:11,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:11,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:22:11,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:22:11,651 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:22:11,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 14:22:11,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-03 14:22:11,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-03 14:22:11,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:11,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:11,905 INFO L256 TraceCheckSpWp]: Trace formula consists of 1041 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:22:11,908 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:22:11,924 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-03 14:22:11,924 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:22:11,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1475824762] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:11,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:22:11,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 14:22:11,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942047197] [2025-03-03 14:22:11,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:11,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:22:11,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:11,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:22:11,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:22:11,927 INFO L87 Difference]: Start difference. First operand 308 states and 459 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-03 14:22:11,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:11,958 INFO L93 Difference]: Finished difference Result 645 states and 976 transitions. [2025-03-03 14:22:11,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:22:11,958 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 114 [2025-03-03 14:22:11,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:11,961 INFO L225 Difference]: With dead ends: 645 [2025-03-03 14:22:11,961 INFO L226 Difference]: Without dead ends: 364 [2025-03-03 14:22:11,962 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:22:11,962 INFO L435 NwaCegarLoop]: 469 mSDtfsCounter, 107 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 879 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:11,964 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 879 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:11,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2025-03-03 14:22:11,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 356. [2025-03-03 14:22:11,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 280 states have (on average 1.5321428571428573) internal successors, (429), 281 states have internal predecessors, (429), 57 states have call successors, (57), 18 states have call predecessors, (57), 18 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2025-03-03 14:22:11,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 542 transitions. [2025-03-03 14:22:11,983 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 542 transitions. Word has length 114 [2025-03-03 14:22:11,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:11,983 INFO L471 AbstractCegarLoop]: Abstraction has 356 states and 542 transitions. [2025-03-03 14:22:11,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-03 14:22:11,983 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 542 transitions. [2025-03-03 14:22:11,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-03 14:22:11,986 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:11,986 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:11,999 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 14:22:12,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:22:12,188 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:12,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:12,189 INFO L85 PathProgramCache]: Analyzing trace with hash 367643696, now seen corresponding path program 1 times [2025-03-03 14:22:12,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:12,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625575651] [2025-03-03 14:22:12,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:12,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:12,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-03 14:22:12,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-03 14:22:12,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:12,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:12,339 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-03 14:22:12,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:12,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625575651] [2025-03-03 14:22:12,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625575651] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:22:12,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [690386182] [2025-03-03 14:22:12,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:12,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:22:12,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:22:12,342 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:22:12,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 14:22:12,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-03 14:22:12,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-03 14:22:12,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:12,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:12,588 INFO L256 TraceCheckSpWp]: Trace formula consists of 1046 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 14:22:12,592 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:22:12,664 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-03 14:22:12,664 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:22:12,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [690386182] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:12,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:22:12,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-03-03 14:22:12,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87927524] [2025-03-03 14:22:12,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:12,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:22:12,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:12,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:22:12,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:22:12,666 INFO L87 Difference]: Start difference. First operand 356 states and 542 transitions. Second operand has 5 states, 4 states have (on average 19.5) internal successors, (78), 5 states have internal predecessors, (78), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-03 14:22:12,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:12,725 INFO L93 Difference]: Finished difference Result 703 states and 1074 transitions. [2025-03-03 14:22:12,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:22:12,727 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.5) internal successors, (78), 5 states have internal predecessors, (78), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) Word has length 115 [2025-03-03 14:22:12,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:12,730 INFO L225 Difference]: With dead ends: 703 [2025-03-03 14:22:12,730 INFO L226 Difference]: Without dead ends: 358 [2025-03-03 14:22:12,731 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:22:12,732 INFO L435 NwaCegarLoop]: 449 mSDtfsCounter, 2 mSDsluCounter, 1336 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1785 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:12,732 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1785 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:12,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2025-03-03 14:22:12,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 358. [2025-03-03 14:22:12,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 281 states have (on average 1.5302491103202847) internal successors, (430), 283 states have internal predecessors, (430), 57 states have call successors, (57), 18 states have call predecessors, (57), 19 states have return successors, (58), 56 states have call predecessors, (58), 56 states have call successors, (58) [2025-03-03 14:22:12,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 545 transitions. [2025-03-03 14:22:12,753 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 545 transitions. Word has length 115 [2025-03-03 14:22:12,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:12,753 INFO L471 AbstractCegarLoop]: Abstraction has 358 states and 545 transitions. [2025-03-03 14:22:12,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.5) internal successors, (78), 5 states have internal predecessors, (78), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-03 14:22:12,753 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 545 transitions. [2025-03-03 14:22:12,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-03 14:22:12,756 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:12,757 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:12,765 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:22:12,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:22:12,957 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:12,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:12,958 INFO L85 PathProgramCache]: Analyzing trace with hash -190121786, now seen corresponding path program 1 times [2025-03-03 14:22:12,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:12,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125781224] [2025-03-03 14:22:12,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:12,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:12,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-03 14:22:12,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-03 14:22:12,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:12,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:13,114 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-03 14:22:13,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:13,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125781224] [2025-03-03 14:22:13,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125781224] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:22:13,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1577657040] [2025-03-03 14:22:13,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:13,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:22:13,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:22:13,117 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:22:13,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 14:22:13,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-03 14:22:13,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-03 14:22:13,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:13,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:13,351 INFO L256 TraceCheckSpWp]: Trace formula consists of 1047 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 14:22:13,355 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:22:13,394 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-03 14:22:13,394 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:22:13,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1577657040] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:13,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:22:13,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-03-03 14:22:13,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489702593] [2025-03-03 14:22:13,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:13,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:22:13,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:13,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:22:13,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:22:13,396 INFO L87 Difference]: Start difference. First operand 358 states and 545 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-03 14:22:13,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:13,457 INFO L93 Difference]: Finished difference Result 705 states and 1079 transitions. [2025-03-03 14:22:13,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:22:13,458 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 116 [2025-03-03 14:22:13,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:13,460 INFO L225 Difference]: With dead ends: 705 [2025-03-03 14:22:13,460 INFO L226 Difference]: Without dead ends: 360 [2025-03-03 14:22:13,461 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:22:13,461 INFO L435 NwaCegarLoop]: 447 mSDtfsCounter, 2 mSDsluCounter, 1324 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1771 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:13,461 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1771 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:13,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2025-03-03 14:22:13,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 360. [2025-03-03 14:22:13,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 282 states have (on average 1.5283687943262412) internal successors, (431), 285 states have internal predecessors, (431), 57 states have call successors, (57), 18 states have call predecessors, (57), 20 states have return successors, (63), 56 states have call predecessors, (63), 56 states have call successors, (63) [2025-03-03 14:22:13,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 551 transitions. [2025-03-03 14:22:13,473 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 551 transitions. Word has length 116 [2025-03-03 14:22:13,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:13,474 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 551 transitions. [2025-03-03 14:22:13,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-03 14:22:13,474 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 551 transitions. [2025-03-03 14:22:13,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-03 14:22:13,476 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:13,476 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:22:13,484 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-03 14:22:13,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:22:13,677 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:13,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:13,677 INFO L85 PathProgramCache]: Analyzing trace with hash 674328118, now seen corresponding path program 1 times [2025-03-03 14:22:13,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:13,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541543556] [2025-03-03 14:22:13,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:13,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:13,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-03 14:22:13,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-03 14:22:13,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:13,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:13,820 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-03 14:22:13,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:13,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541543556] [2025-03-03 14:22:13,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541543556] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:13,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:13,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:22:13,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388422362] [2025-03-03 14:22:13,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:13,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:22:13,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:13,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:22:13,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:22:13,822 INFO L87 Difference]: Start difference. First operand 360 states and 551 transitions. Second operand has 5 states, 4 states have (on average 19.0) internal successors, (76), 5 states have internal predecessors, (76), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-03 14:22:13,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:13,864 INFO L93 Difference]: Finished difference Result 697 states and 1070 transitions. [2025-03-03 14:22:13,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:22:13,864 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.0) internal successors, (76), 5 states have internal predecessors, (76), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) Word has length 117 [2025-03-03 14:22:13,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:13,868 INFO L225 Difference]: With dead ends: 697 [2025-03-03 14:22:13,868 INFO L226 Difference]: Without dead ends: 360 [2025-03-03 14:22:13,869 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:22:13,869 INFO L435 NwaCegarLoop]: 450 mSDtfsCounter, 2 mSDsluCounter, 1339 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1789 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:13,870 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1789 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:13,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2025-03-03 14:22:13,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 360. [2025-03-03 14:22:13,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 282 states have (on average 1.5283687943262412) internal successors, (431), 285 states have internal predecessors, (431), 57 states have call successors, (57), 18 states have call predecessors, (57), 20 states have return successors, (62), 56 states have call predecessors, (62), 56 states have call successors, (62) [2025-03-03 14:22:13,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 550 transitions. [2025-03-03 14:22:13,891 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 550 transitions. Word has length 117 [2025-03-03 14:22:13,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:13,891 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 550 transitions. [2025-03-03 14:22:13,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.0) internal successors, (76), 5 states have internal predecessors, (76), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-03 14:22:13,892 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 550 transitions. [2025-03-03 14:22:13,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-03 14:22:13,895 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:13,895 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:13,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 14:22:13,895 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:13,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:13,896 INFO L85 PathProgramCache]: Analyzing trace with hash 264922478, now seen corresponding path program 2 times [2025-03-03 14:22:13,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:13,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890079321] [2025-03-03 14:22:13,896 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 14:22:13,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:13,914 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 118 statements into 2 equivalence classes. [2025-03-03 14:22:13,919 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 66 of 118 statements. [2025-03-03 14:22:13,920 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-03 14:22:13,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:13,976 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-03 14:22:13,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:13,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890079321] [2025-03-03 14:22:13,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890079321] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:13,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:13,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:22:13,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745753122] [2025-03-03 14:22:13,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:13,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:22:13,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:13,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:22:13,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:22:13,979 INFO L87 Difference]: Start difference. First operand 360 states and 550 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (16), 1 states have call predecessors, (16), 2 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-03 14:22:13,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:14,000 INFO L93 Difference]: Finished difference Result 506 states and 753 transitions. [2025-03-03 14:22:14,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:22:14,000 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (16), 1 states have call predecessors, (16), 2 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) Word has length 118 [2025-03-03 14:22:14,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:14,003 INFO L225 Difference]: With dead ends: 506 [2025-03-03 14:22:14,003 INFO L226 Difference]: Without dead ends: 360 [2025-03-03 14:22:14,003 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:22:14,004 INFO L435 NwaCegarLoop]: 454 mSDtfsCounter, 0 mSDsluCounter, 1355 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1809 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:14,004 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1809 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:14,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2025-03-03 14:22:14,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 360. [2025-03-03 14:22:14,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 282 states have (on average 1.524822695035461) internal successors, (430), 285 states have internal predecessors, (430), 57 states have call successors, (57), 18 states have call predecessors, (57), 20 states have return successors, (62), 56 states have call predecessors, (62), 56 states have call successors, (62) [2025-03-03 14:22:14,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 549 transitions. [2025-03-03 14:22:14,023 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 549 transitions. Word has length 118 [2025-03-03 14:22:14,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:14,024 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 549 transitions. [2025-03-03 14:22:14,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (16), 1 states have call predecessors, (16), 2 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-03 14:22:14,024 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 549 transitions. [2025-03-03 14:22:14,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-03 14:22:14,025 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:14,026 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:14,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 14:22:14,026 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:14,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:14,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1100064246, now seen corresponding path program 1 times [2025-03-03 14:22:14,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:14,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649917668] [2025-03-03 14:22:14,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:14,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:14,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-03 14:22:14,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-03 14:22:14,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:14,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:14,149 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-03 14:22:14,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:14,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649917668] [2025-03-03 14:22:14,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649917668] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:14,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:14,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:22:14,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035093030] [2025-03-03 14:22:14,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:14,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:22:14,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:14,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:22:14,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:22:14,151 INFO L87 Difference]: Start difference. First operand 360 states and 549 transitions. Second operand has 5 states, 4 states have (on average 20.5) internal successors, (82), 5 states have internal predecessors, (82), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-03 14:22:14,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:14,188 INFO L93 Difference]: Finished difference Result 699 states and 1071 transitions. [2025-03-03 14:22:14,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:22:14,188 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.5) internal successors, (82), 5 states have internal predecessors, (82), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 125 [2025-03-03 14:22:14,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:14,191 INFO L225 Difference]: With dead ends: 699 [2025-03-03 14:22:14,191 INFO L226 Difference]: Without dead ends: 362 [2025-03-03 14:22:14,192 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:22:14,193 INFO L435 NwaCegarLoop]: 450 mSDtfsCounter, 1 mSDsluCounter, 1338 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1788 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:14,193 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1788 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:14,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2025-03-03 14:22:14,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 362. [2025-03-03 14:22:14,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 283 states have (on average 1.5229681978798586) internal successors, (431), 287 states have internal predecessors, (431), 57 states have call successors, (57), 18 states have call predecessors, (57), 21 states have return successors, (64), 56 states have call predecessors, (64), 56 states have call successors, (64) [2025-03-03 14:22:14,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 552 transitions. [2025-03-03 14:22:14,213 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 552 transitions. Word has length 125 [2025-03-03 14:22:14,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:14,214 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 552 transitions. [2025-03-03 14:22:14,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.5) internal successors, (82), 5 states have internal predecessors, (82), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-03 14:22:14,214 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 552 transitions. [2025-03-03 14:22:14,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-03 14:22:14,216 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:14,217 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:14,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 14:22:14,217 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:14,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:14,217 INFO L85 PathProgramCache]: Analyzing trace with hash 852995787, now seen corresponding path program 1 times [2025-03-03 14:22:14,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:14,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128516185] [2025-03-03 14:22:14,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:14,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:14,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-03 14:22:14,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-03 14:22:14,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:14,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:14,371 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-03 14:22:14,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:14,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128516185] [2025-03-03 14:22:14,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128516185] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:14,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:14,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 14:22:14,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352500836] [2025-03-03 14:22:14,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:14,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 14:22:14,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:14,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 14:22:14,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:22:14,373 INFO L87 Difference]: Start difference. First operand 362 states and 552 transitions. Second operand has 8 states, 7 states have (on average 12.285714285714286) internal successors, (86), 8 states have internal predecessors, (86), 4 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2025-03-03 14:22:14,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:14,485 INFO L93 Difference]: Finished difference Result 701 states and 1070 transitions. [2025-03-03 14:22:14,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 14:22:14,486 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 12.285714285714286) internal successors, (86), 8 states have internal predecessors, (86), 4 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 126 [2025-03-03 14:22:14,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:14,488 INFO L225 Difference]: With dead ends: 701 [2025-03-03 14:22:14,488 INFO L226 Difference]: Without dead ends: 364 [2025-03-03 14:22:14,489 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:22:14,490 INFO L435 NwaCegarLoop]: 440 mSDtfsCounter, 7 mSDsluCounter, 2611 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 3051 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:14,490 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 3051 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:22:14,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2025-03-03 14:22:14,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 364. [2025-03-03 14:22:14,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 285 states have (on average 1.5192982456140351) internal successors, (433), 288 states have internal predecessors, (433), 57 states have call successors, (57), 19 states have call predecessors, (57), 21 states have return successors, (63), 56 states have call predecessors, (63), 56 states have call successors, (63) [2025-03-03 14:22:14,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 553 transitions. [2025-03-03 14:22:14,502 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 553 transitions. Word has length 126 [2025-03-03 14:22:14,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:14,503 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 553 transitions. [2025-03-03 14:22:14,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 12.285714285714286) internal successors, (86), 8 states have internal predecessors, (86), 4 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2025-03-03 14:22:14,503 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 553 transitions. [2025-03-03 14:22:14,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-03 14:22:14,504 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:14,505 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:14,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 14:22:14,505 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:14,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:14,505 INFO L85 PathProgramCache]: Analyzing trace with hash -118759633, now seen corresponding path program 2 times [2025-03-03 14:22:14,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:14,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253764615] [2025-03-03 14:22:14,506 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 14:22:14,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:14,522 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 127 statements into 2 equivalence classes. [2025-03-03 14:22:14,532 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 127 of 127 statements. [2025-03-03 14:22:14,534 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 14:22:14,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:14,631 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-03 14:22:14,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:14,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253764615] [2025-03-03 14:22:14,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253764615] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:14,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:14,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 14:22:14,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436561137] [2025-03-03 14:22:14,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:14,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:22:14,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:14,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:22:14,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:22:14,632 INFO L87 Difference]: Start difference. First operand 364 states and 553 transitions. Second operand has 7 states, 6 states have (on average 14.0) internal successors, (84), 7 states have internal predecessors, (84), 4 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2025-03-03 14:22:14,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:14,696 INFO L93 Difference]: Finished difference Result 701 states and 1074 transitions. [2025-03-03 14:22:14,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:22:14,696 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 14.0) internal successors, (84), 7 states have internal predecessors, (84), 4 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 127 [2025-03-03 14:22:14,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:14,698 INFO L225 Difference]: With dead ends: 701 [2025-03-03 14:22:14,698 INFO L226 Difference]: Without dead ends: 366 [2025-03-03 14:22:14,702 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:22:14,702 INFO L435 NwaCegarLoop]: 448 mSDtfsCounter, 2 mSDsluCounter, 1769 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2217 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:14,702 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2217 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:14,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2025-03-03 14:22:14,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 366. [2025-03-03 14:22:14,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 286 states have (on average 1.5174825174825175) internal successors, (434), 290 states have internal predecessors, (434), 57 states have call successors, (57), 19 states have call predecessors, (57), 22 states have return successors, (68), 56 states have call predecessors, (68), 56 states have call successors, (68) [2025-03-03 14:22:14,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 559 transitions. [2025-03-03 14:22:14,718 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 559 transitions. Word has length 127 [2025-03-03 14:22:14,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:14,718 INFO L471 AbstractCegarLoop]: Abstraction has 366 states and 559 transitions. [2025-03-03 14:22:14,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 14.0) internal successors, (84), 7 states have internal predecessors, (84), 4 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2025-03-03 14:22:14,719 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 559 transitions. [2025-03-03 14:22:14,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-03 14:22:14,720 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:14,720 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:14,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 14:22:14,721 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:14,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:14,721 INFO L85 PathProgramCache]: Analyzing trace with hash -846971224, now seen corresponding path program 1 times [2025-03-03 14:22:14,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:14,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168442176] [2025-03-03 14:22:14,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:14,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:14,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-03 14:22:14,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-03 14:22:14,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:14,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:14,843 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:22:14,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:14,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168442176] [2025-03-03 14:22:14,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168442176] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:22:14,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1930847158] [2025-03-03 14:22:14,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:14,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:22:14,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:22:14,846 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:22:14,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 14:22:15,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-03 14:22:15,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-03 14:22:15,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:15,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:15,105 INFO L256 TraceCheckSpWp]: Trace formula consists of 1072 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:22:15,108 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:22:15,133 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:22:15,133 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:22:15,218 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:22:15,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1930847158] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:22:15,219 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:22:15,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-03 14:22:15,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551852977] [2025-03-03 14:22:15,219 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:22:15,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:22:15,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:15,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:22:15,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:22:15,220 INFO L87 Difference]: Start difference. First operand 366 states and 559 transitions. Second operand has 7 states, 7 states have (on average 17.0) internal successors, (119), 7 states have internal predecessors, (119), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-03 14:22:15,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:15,332 INFO L93 Difference]: Finished difference Result 867 states and 1375 transitions. [2025-03-03 14:22:15,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:22:15,333 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.0) internal successors, (119), 7 states have internal predecessors, (119), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 128 [2025-03-03 14:22:15,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:15,337 INFO L225 Difference]: With dead ends: 867 [2025-03-03 14:22:15,337 INFO L226 Difference]: Without dead ends: 713 [2025-03-03 14:22:15,338 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 253 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:22:15,339 INFO L435 NwaCegarLoop]: 498 mSDtfsCounter, 412 mSDsluCounter, 1653 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 457 SdHoareTripleChecker+Valid, 2151 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:15,339 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [457 Valid, 2151 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:22:15,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2025-03-03 14:22:15,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 689. [2025-03-03 14:22:15,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 689 states, 545 states have (on average 1.5908256880733944) internal successors, (867), 549 states have internal predecessors, (867), 121 states have call successors, (121), 19 states have call predecessors, (121), 22 states have return successors, (142), 120 states have call predecessors, (142), 120 states have call successors, (142) [2025-03-03 14:22:15,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 1130 transitions. [2025-03-03 14:22:15,365 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 1130 transitions. Word has length 128 [2025-03-03 14:22:15,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:15,365 INFO L471 AbstractCegarLoop]: Abstraction has 689 states and 1130 transitions. [2025-03-03 14:22:15,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.0) internal successors, (119), 7 states have internal predecessors, (119), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-03 14:22:15,365 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 1130 transitions. [2025-03-03 14:22:15,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-03 14:22:15,369 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:15,369 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:15,378 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-03 14:22:15,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:22:15,570 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:15,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:15,571 INFO L85 PathProgramCache]: Analyzing trace with hash 617924104, now seen corresponding path program 1 times [2025-03-03 14:22:15,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:15,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566961317] [2025-03-03 14:22:15,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:15,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:15,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-03 14:22:15,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-03 14:22:15,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:15,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:15,638 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:22:15,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:15,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566961317] [2025-03-03 14:22:15,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566961317] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:15,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:15,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:22:15,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086921089] [2025-03-03 14:22:15,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:15,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:22:15,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:15,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:22:15,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:15,640 INFO L87 Difference]: Start difference. First operand 689 states and 1130 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 14:22:15,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:15,669 INFO L93 Difference]: Finished difference Result 1638 states and 2727 transitions. [2025-03-03 14:22:15,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:22:15,670 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 134 [2025-03-03 14:22:15,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:15,676 INFO L225 Difference]: With dead ends: 1638 [2025-03-03 14:22:15,676 INFO L226 Difference]: Without dead ends: 1017 [2025-03-03 14:22:15,678 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:15,679 INFO L435 NwaCegarLoop]: 465 mSDtfsCounter, 105 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 918 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:15,679 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 918 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:15,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1017 states. [2025-03-03 14:22:15,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1017 to 1009. [2025-03-03 14:22:15,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1009 states, 801 states have (on average 1.6067415730337078) internal successors, (1287), 805 states have internal predecessors, (1287), 185 states have call successors, (185), 19 states have call predecessors, (185), 22 states have return successors, (216), 184 states have call predecessors, (216), 184 states have call successors, (216) [2025-03-03 14:22:15,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 1009 states and 1688 transitions. [2025-03-03 14:22:15,718 INFO L78 Accepts]: Start accepts. Automaton has 1009 states and 1688 transitions. Word has length 134 [2025-03-03 14:22:15,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:15,718 INFO L471 AbstractCegarLoop]: Abstraction has 1009 states and 1688 transitions. [2025-03-03 14:22:15,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 14:22:15,718 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1688 transitions. [2025-03-03 14:22:15,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-03 14:22:15,723 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:15,723 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:15,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 14:22:15,724 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:15,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:15,724 INFO L85 PathProgramCache]: Analyzing trace with hash -761314297, now seen corresponding path program 1 times [2025-03-03 14:22:15,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:15,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028896028] [2025-03-03 14:22:15,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:15,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:15,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-03 14:22:15,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-03 14:22:15,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:15,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:15,794 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:22:15,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:15,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028896028] [2025-03-03 14:22:15,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028896028] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:15,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:15,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:22:15,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900572428] [2025-03-03 14:22:15,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:15,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:22:15,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:15,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:22:15,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:15,797 INFO L87 Difference]: Start difference. First operand 1009 states and 1688 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 14:22:15,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:15,843 INFO L93 Difference]: Finished difference Result 2407 states and 4049 transitions. [2025-03-03 14:22:15,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:22:15,843 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 135 [2025-03-03 14:22:15,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:15,854 INFO L225 Difference]: With dead ends: 2407 [2025-03-03 14:22:15,855 INFO L226 Difference]: Without dead ends: 1517 [2025-03-03 14:22:15,858 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:15,859 INFO L435 NwaCegarLoop]: 455 mSDtfsCounter, 103 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 904 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:15,859 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 904 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:15,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1517 states. [2025-03-03 14:22:15,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1517 to 1509. [2025-03-03 14:22:15,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1509 states, 1206 states have (on average 1.6169154228855722) internal successors, (1950), 1210 states have internal predecessors, (1950), 280 states have call successors, (280), 19 states have call predecessors, (280), 22 states have return successors, (311), 279 states have call predecessors, (311), 279 states have call successors, (311) [2025-03-03 14:22:15,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1509 states to 1509 states and 2541 transitions. [2025-03-03 14:22:15,933 INFO L78 Accepts]: Start accepts. Automaton has 1509 states and 2541 transitions. Word has length 135 [2025-03-03 14:22:15,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:15,934 INFO L471 AbstractCegarLoop]: Abstraction has 1509 states and 2541 transitions. [2025-03-03 14:22:15,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 14:22:15,934 INFO L276 IsEmpty]: Start isEmpty. Operand 1509 states and 2541 transitions. [2025-03-03 14:22:15,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-03 14:22:15,942 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:15,943 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:15,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 14:22:15,943 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:15,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:15,943 INFO L85 PathProgramCache]: Analyzing trace with hash -797680759, now seen corresponding path program 1 times [2025-03-03 14:22:15,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:15,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084904440] [2025-03-03 14:22:15,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:15,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:15,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-03 14:22:15,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-03 14:22:15,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:15,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:16,008 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:22:16,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:16,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084904440] [2025-03-03 14:22:16,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084904440] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:16,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:16,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:22:16,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335117024] [2025-03-03 14:22:16,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:16,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:22:16,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:16,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:22:16,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:16,010 INFO L87 Difference]: Start difference. First operand 1509 states and 2541 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 14:22:16,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:16,102 INFO L93 Difference]: Finished difference Result 3541 states and 6006 transitions. [2025-03-03 14:22:16,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:22:16,103 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 136 [2025-03-03 14:22:16,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:16,114 INFO L225 Difference]: With dead ends: 3541 [2025-03-03 14:22:16,114 INFO L226 Difference]: Without dead ends: 2273 [2025-03-03 14:22:16,117 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:16,118 INFO L435 NwaCegarLoop]: 455 mSDtfsCounter, 101 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 901 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:16,118 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 901 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:16,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2273 states. [2025-03-03 14:22:16,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2273 to 2265. [2025-03-03 14:22:16,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2265 states, 1839 states have (on average 1.6247960848287113) internal successors, (2988), 1843 states have internal predecessors, (2988), 403 states have call successors, (403), 19 states have call predecessors, (403), 22 states have return successors, (450), 402 states have call predecessors, (450), 402 states have call successors, (450) [2025-03-03 14:22:16,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2265 states to 2265 states and 3841 transitions. [2025-03-03 14:22:16,211 INFO L78 Accepts]: Start accepts. Automaton has 2265 states and 3841 transitions. Word has length 136 [2025-03-03 14:22:16,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:16,211 INFO L471 AbstractCegarLoop]: Abstraction has 2265 states and 3841 transitions. [2025-03-03 14:22:16,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 14:22:16,212 INFO L276 IsEmpty]: Start isEmpty. Operand 2265 states and 3841 transitions. [2025-03-03 14:22:16,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-03 14:22:16,222 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:16,222 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:16,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 14:22:16,223 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:16,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:16,223 INFO L85 PathProgramCache]: Analyzing trace with hash 798089446, now seen corresponding path program 1 times [2025-03-03 14:22:16,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:16,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886388103] [2025-03-03 14:22:16,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:16,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:16,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-03 14:22:16,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-03 14:22:16,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:16,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:16,288 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:22:16,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:16,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886388103] [2025-03-03 14:22:16,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886388103] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:16,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:16,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:22:16,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564531560] [2025-03-03 14:22:16,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:16,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:22:16,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:16,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:22:16,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:16,289 INFO L87 Difference]: Start difference. First operand 2265 states and 3841 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 14:22:16,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:16,407 INFO L93 Difference]: Finished difference Result 5304 states and 9052 transitions. [2025-03-03 14:22:16,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:22:16,408 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 137 [2025-03-03 14:22:16,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:16,428 INFO L225 Difference]: With dead ends: 5304 [2025-03-03 14:22:16,429 INFO L226 Difference]: Without dead ends: 3480 [2025-03-03 14:22:16,435 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:16,436 INFO L435 NwaCegarLoop]: 455 mSDtfsCounter, 99 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 901 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:16,437 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 901 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:16,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3480 states. [2025-03-03 14:22:16,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3480 to 3472. [2025-03-03 14:22:16,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3472 states, 2867 states have (on average 1.629926752703174) internal successors, (4673), 2871 states have internal predecessors, (4673), 582 states have call successors, (582), 19 states have call predecessors, (582), 22 states have return successors, (655), 581 states have call predecessors, (655), 581 states have call successors, (655) [2025-03-03 14:22:16,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3472 states to 3472 states and 5910 transitions. [2025-03-03 14:22:16,625 INFO L78 Accepts]: Start accepts. Automaton has 3472 states and 5910 transitions. Word has length 137 [2025-03-03 14:22:16,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:16,626 INFO L471 AbstractCegarLoop]: Abstraction has 3472 states and 5910 transitions. [2025-03-03 14:22:16,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 14:22:16,627 INFO L276 IsEmpty]: Start isEmpty. Operand 3472 states and 5910 transitions. [2025-03-03 14:22:16,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-03 14:22:16,646 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:16,646 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:16,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 14:22:16,647 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:16,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:16,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1954999274, now seen corresponding path program 1 times [2025-03-03 14:22:16,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:16,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216890487] [2025-03-03 14:22:16,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:16,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:16,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-03 14:22:16,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-03 14:22:16,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:16,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:16,719 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:22:16,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:16,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216890487] [2025-03-03 14:22:16,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216890487] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:16,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:16,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:22:16,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926315956] [2025-03-03 14:22:16,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:16,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:22:16,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:16,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:22:16,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:16,720 INFO L87 Difference]: Start difference. First operand 3472 states and 5910 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 14:22:16,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:16,879 INFO L93 Difference]: Finished difference Result 8196 states and 14043 transitions. [2025-03-03 14:22:16,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:22:16,879 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 138 [2025-03-03 14:22:16,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:16,910 INFO L225 Difference]: With dead ends: 8196 [2025-03-03 14:22:16,910 INFO L226 Difference]: Without dead ends: 5472 [2025-03-03 14:22:16,920 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:16,921 INFO L435 NwaCegarLoop]: 465 mSDtfsCounter, 97 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 909 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:16,921 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 909 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:16,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5472 states. [2025-03-03 14:22:17,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5472 to 5464. [2025-03-03 14:22:17,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5464 states, 4483 states have (on average 1.6252509480258754) internal successors, (7286), 4487 states have internal predecessors, (7286), 958 states have call successors, (958), 19 states have call predecessors, (958), 22 states have return successors, (1075), 957 states have call predecessors, (1075), 957 states have call successors, (1075) [2025-03-03 14:22:17,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5464 states to 5464 states and 9319 transitions. [2025-03-03 14:22:17,174 INFO L78 Accepts]: Start accepts. Automaton has 5464 states and 9319 transitions. Word has length 138 [2025-03-03 14:22:17,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:17,175 INFO L471 AbstractCegarLoop]: Abstraction has 5464 states and 9319 transitions. [2025-03-03 14:22:17,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 14:22:17,175 INFO L276 IsEmpty]: Start isEmpty. Operand 5464 states and 9319 transitions. [2025-03-03 14:22:17,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-03 14:22:17,197 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:17,197 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:17,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 14:22:17,198 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:17,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:17,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1695664187, now seen corresponding path program 1 times [2025-03-03 14:22:17,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:17,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50908221] [2025-03-03 14:22:17,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:17,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:17,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-03 14:22:17,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-03 14:22:17,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:17,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:17,249 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:22:17,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:17,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50908221] [2025-03-03 14:22:17,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50908221] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:17,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:17,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:22:17,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151295508] [2025-03-03 14:22:17,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:17,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:22:17,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:17,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:22:17,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:17,251 INFO L87 Difference]: Start difference. First operand 5464 states and 9319 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 14:22:17,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:17,439 INFO L93 Difference]: Finished difference Result 13428 states and 23048 transitions. [2025-03-03 14:22:17,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:22:17,439 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 139 [2025-03-03 14:22:17,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:17,481 INFO L225 Difference]: With dead ends: 13428 [2025-03-03 14:22:17,481 INFO L226 Difference]: Without dead ends: 9083 [2025-03-03 14:22:17,497 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:17,498 INFO L435 NwaCegarLoop]: 455 mSDtfsCounter, 95 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 904 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:17,498 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 904 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:17,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9083 states. [2025-03-03 14:22:17,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9083 to 9075. [2025-03-03 14:22:17,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9075 states, 7488 states have (on average 1.623931623931624) internal successors, (12160), 7492 states have internal predecessors, (12160), 1564 states have call successors, (1564), 19 states have call predecessors, (1564), 22 states have return successors, (1759), 1563 states have call predecessors, (1759), 1563 states have call successors, (1759) [2025-03-03 14:22:17,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9075 states to 9075 states and 15483 transitions. [2025-03-03 14:22:17,917 INFO L78 Accepts]: Start accepts. Automaton has 9075 states and 15483 transitions. Word has length 139 [2025-03-03 14:22:17,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:17,917 INFO L471 AbstractCegarLoop]: Abstraction has 9075 states and 15483 transitions. [2025-03-03 14:22:17,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 14:22:17,921 INFO L276 IsEmpty]: Start isEmpty. Operand 9075 states and 15483 transitions. [2025-03-03 14:22:17,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-03 14:22:17,953 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:17,953 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:17,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 14:22:17,954 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:17,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:17,954 INFO L85 PathProgramCache]: Analyzing trace with hash 643683883, now seen corresponding path program 1 times [2025-03-03 14:22:17,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:17,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743646330] [2025-03-03 14:22:17,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:17,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:17,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-03 14:22:17,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-03 14:22:17,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:17,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:18,013 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:22:18,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:18,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743646330] [2025-03-03 14:22:18,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743646330] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:18,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:18,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:22:18,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595622358] [2025-03-03 14:22:18,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:18,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:22:18,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:18,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:22:18,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:18,015 INFO L87 Difference]: Start difference. First operand 9075 states and 15483 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 14:22:18,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:18,399 INFO L93 Difference]: Finished difference Result 23410 states and 40111 transitions. [2025-03-03 14:22:18,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:22:18,399 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 140 [2025-03-03 14:22:18,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:18,469 INFO L225 Difference]: With dead ends: 23410 [2025-03-03 14:22:18,469 INFO L226 Difference]: Without dead ends: 15899 [2025-03-03 14:22:18,501 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:18,501 INFO L435 NwaCegarLoop]: 460 mSDtfsCounter, 93 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 912 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:18,501 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 912 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:18,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15899 states. [2025-03-03 14:22:19,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15899 to 15891. [2025-03-03 14:22:19,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15891 states, 13101 states have (on average 1.6155255324021067) internal successors, (21165), 13105 states have internal predecessors, (21165), 2767 states have call successors, (2767), 19 states have call predecessors, (2767), 22 states have return successors, (3106), 2766 states have call predecessors, (3106), 2766 states have call successors, (3106) [2025-03-03 14:22:19,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15891 states to 15891 states and 27038 transitions. [2025-03-03 14:22:19,139 INFO L78 Accepts]: Start accepts. Automaton has 15891 states and 27038 transitions. Word has length 140 [2025-03-03 14:22:19,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:19,140 INFO L471 AbstractCegarLoop]: Abstraction has 15891 states and 27038 transitions. [2025-03-03 14:22:19,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 14:22:19,141 INFO L276 IsEmpty]: Start isEmpty. Operand 15891 states and 27038 transitions. [2025-03-03 14:22:19,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-03 14:22:19,182 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:19,183 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:19,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 14:22:19,183 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:19,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:19,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1589120804, now seen corresponding path program 1 times [2025-03-03 14:22:19,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:19,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835912543] [2025-03-03 14:22:19,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:19,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:19,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-03 14:22:19,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-03 14:22:19,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:19,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:19,237 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:22:19,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:19,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835912543] [2025-03-03 14:22:19,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835912543] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:19,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:19,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:22:19,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422242771] [2025-03-03 14:22:19,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:19,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:22:19,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:19,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:22:19,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:19,239 INFO L87 Difference]: Start difference. First operand 15891 states and 27038 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 14:22:19,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:19,940 INFO L93 Difference]: Finished difference Result 41981 states and 71775 transitions. [2025-03-03 14:22:19,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:22:19,941 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 141 [2025-03-03 14:22:19,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:20,082 INFO L225 Difference]: With dead ends: 41981 [2025-03-03 14:22:20,083 INFO L226 Difference]: Without dead ends: 28288 [2025-03-03 14:22:20,137 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:20,137 INFO L435 NwaCegarLoop]: 455 mSDtfsCounter, 91 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 904 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:20,137 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 904 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:20,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28288 states. [2025-03-03 14:22:21,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28288 to 28280. [2025-03-03 14:22:21,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28280 states, 23451 states have (on average 1.6119994882947422) internal successors, (37803), 23455 states have internal predecessors, (37803), 4806 states have call successors, (4806), 19 states have call predecessors, (4806), 22 states have return successors, (5419), 4805 states have call predecessors, (5419), 4805 states have call successors, (5419) [2025-03-03 14:22:21,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28280 states to 28280 states and 48028 transitions. [2025-03-03 14:22:21,394 INFO L78 Accepts]: Start accepts. Automaton has 28280 states and 48028 transitions. Word has length 141 [2025-03-03 14:22:21,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:21,394 INFO L471 AbstractCegarLoop]: Abstraction has 28280 states and 48028 transitions. [2025-03-03 14:22:21,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 14:22:21,395 INFO L276 IsEmpty]: Start isEmpty. Operand 28280 states and 48028 transitions. [2025-03-03 14:22:21,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-03 14:22:21,440 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:21,440 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:21,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 14:22:21,440 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:21,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:21,440 INFO L85 PathProgramCache]: Analyzing trace with hash -240984756, now seen corresponding path program 1 times [2025-03-03 14:22:21,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:21,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996094987] [2025-03-03 14:22:21,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:21,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:21,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-03 14:22:21,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-03 14:22:21,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:21,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:21,492 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:22:21,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:21,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996094987] [2025-03-03 14:22:21,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996094987] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:21,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:21,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:22:21,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242264182] [2025-03-03 14:22:21,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:21,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:22:21,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:21,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:22:21,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:21,495 INFO L87 Difference]: Start difference. First operand 28280 states and 48028 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 14:22:22,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:22,332 INFO L93 Difference]: Finished difference Result 76963 states and 131222 transitions. [2025-03-03 14:22:22,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:22:22,332 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 142 [2025-03-03 14:22:22,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:22,571 INFO L225 Difference]: With dead ends: 76963 [2025-03-03 14:22:22,572 INFO L226 Difference]: Without dead ends: 51644 [2025-03-03 14:22:22,884 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:22,885 INFO L435 NwaCegarLoop]: 455 mSDtfsCounter, 89 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 904 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:22,885 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 904 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:22,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51644 states. [2025-03-03 14:22:24,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51644 to 51636. [2025-03-03 14:22:24,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51636 states, 43092 states have (on average 1.607003620161515) internal successors, (69249), 43096 states have internal predecessors, (69249), 8521 states have call successors, (8521), 19 states have call predecessors, (8521), 22 states have return successors, (9666), 8520 states have call predecessors, (9666), 8520 states have call successors, (9666) [2025-03-03 14:22:24,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51636 states to 51636 states and 87436 transitions. [2025-03-03 14:22:24,774 INFO L78 Accepts]: Start accepts. Automaton has 51636 states and 87436 transitions. Word has length 142 [2025-03-03 14:22:24,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:24,775 INFO L471 AbstractCegarLoop]: Abstraction has 51636 states and 87436 transitions. [2025-03-03 14:22:24,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 14:22:24,775 INFO L276 IsEmpty]: Start isEmpty. Operand 51636 states and 87436 transitions. [2025-03-03 14:22:24,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-03 14:22:24,832 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:24,833 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:24,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 14:22:24,833 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:24,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:24,833 INFO L85 PathProgramCache]: Analyzing trace with hash 934505955, now seen corresponding path program 1 times [2025-03-03 14:22:24,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:24,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969054867] [2025-03-03 14:22:24,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:24,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:24,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-03 14:22:24,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-03 14:22:24,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:24,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:24,901 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:22:24,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:24,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969054867] [2025-03-03 14:22:24,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969054867] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:24,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:24,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:22:24,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545925635] [2025-03-03 14:22:24,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:24,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:22:24,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:24,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:22:24,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:24,904 INFO L87 Difference]: Start difference. First operand 51636 states and 87436 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 14:22:26,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:26,546 INFO L93 Difference]: Finished difference Result 96224 states and 163330 transitions. [2025-03-03 14:22:26,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:22:26,547 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 143 [2025-03-03 14:22:26,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:26,906 INFO L225 Difference]: With dead ends: 96224 [2025-03-03 14:22:26,906 INFO L226 Difference]: Without dead ends: 96070 [2025-03-03 14:22:26,949 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:26,951 INFO L435 NwaCegarLoop]: 464 mSDtfsCounter, 84 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 918 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:26,951 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 918 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:27,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96070 states. [2025-03-03 14:22:29,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96070 to 96062. [2025-03-03 14:22:29,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96062 states, 80719 states have (on average 1.600441036187267) internal successors, (129186), 80723 states have internal predecessors, (129186), 15320 states have call successors, (15320), 19 states have call predecessors, (15320), 22 states have return successors, (17511), 15319 states have call predecessors, (17511), 15319 states have call successors, (17511) [2025-03-03 14:22:30,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96062 states to 96062 states and 162017 transitions. [2025-03-03 14:22:30,219 INFO L78 Accepts]: Start accepts. Automaton has 96062 states and 162017 transitions. Word has length 143 [2025-03-03 14:22:30,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:30,219 INFO L471 AbstractCegarLoop]: Abstraction has 96062 states and 162017 transitions. [2025-03-03 14:22:30,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 14:22:30,220 INFO L276 IsEmpty]: Start isEmpty. Operand 96062 states and 162017 transitions. [2025-03-03 14:22:30,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-03 14:22:30,304 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:30,304 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:30,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 14:22:30,304 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:30,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:30,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1944001363, now seen corresponding path program 1 times [2025-03-03 14:22:30,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:30,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705880384] [2025-03-03 14:22:30,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:30,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:30,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-03 14:22:30,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-03 14:22:30,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:30,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:30,492 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:22:30,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:30,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705880384] [2025-03-03 14:22:30,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705880384] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:30,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:30,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:22:30,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412486275] [2025-03-03 14:22:30,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:30,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:22:30,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:30,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:22:30,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:22:30,495 INFO L87 Difference]: Start difference. First operand 96062 states and 162017 transitions. Second operand has 6 states, 6 states have (on average 16.5) internal successors, (99), 5 states have internal predecessors, (99), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 14:22:32,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:32,786 INFO L93 Difference]: Finished difference Result 96360 states and 162430 transitions. [2025-03-03 14:22:32,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 14:22:32,787 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 5 states have internal predecessors, (99), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) Word has length 144 [2025-03-03 14:22:32,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:33,176 INFO L225 Difference]: With dead ends: 96360 [2025-03-03 14:22:33,177 INFO L226 Difference]: Without dead ends: 96214 [2025-03-03 14:22:33,225 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:22:33,229 INFO L435 NwaCegarLoop]: 492 mSDtfsCounter, 389 mSDsluCounter, 1573 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 2065 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:33,229 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [391 Valid, 2065 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 14:22:33,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96214 states. [2025-03-03 14:22:35,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96214 to 96210. [2025-03-03 14:22:35,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96210 states, 80837 states have (on average 1.600170713905761) internal successors, (129353), 80841 states have internal predecessors, (129353), 15338 states have call successors, (15338), 29 states have call predecessors, (15338), 34 states have return successors, (17532), 15339 states have call predecessors, (17532), 15336 states have call successors, (17532) [2025-03-03 14:22:36,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96210 states to 96210 states and 162223 transitions. [2025-03-03 14:22:36,310 INFO L78 Accepts]: Start accepts. Automaton has 96210 states and 162223 transitions. Word has length 144 [2025-03-03 14:22:36,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:36,311 INFO L471 AbstractCegarLoop]: Abstraction has 96210 states and 162223 transitions. [2025-03-03 14:22:36,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 5 states have internal predecessors, (99), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 14:22:36,311 INFO L276 IsEmpty]: Start isEmpty. Operand 96210 states and 162223 transitions. [2025-03-03 14:22:36,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-03 14:22:36,388 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:36,388 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:36,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 14:22:36,389 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:36,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:36,389 INFO L85 PathProgramCache]: Analyzing trace with hash 2111806613, now seen corresponding path program 1 times [2025-03-03 14:22:36,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:36,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630539568] [2025-03-03 14:22:36,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:36,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:36,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-03 14:22:36,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-03 14:22:36,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:36,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:36,760 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:22:36,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:36,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630539568] [2025-03-03 14:22:36,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630539568] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:36,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:36,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-03 14:22:36,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722839912] [2025-03-03 14:22:36,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:36,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 14:22:36,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:36,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 14:22:36,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2025-03-03 14:22:36,762 INFO L87 Difference]: Start difference. First operand 96210 states and 162223 transitions. Second operand has 13 states, 11 states have (on average 9.090909090909092) internal successors, (100), 12 states have internal predecessors, (100), 8 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 6 states have call predecessors, (15), 7 states have call successors, (15) [2025-03-03 14:22:39,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:39,461 INFO L93 Difference]: Finished difference Result 96637 states and 162826 transitions. [2025-03-03 14:22:39,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 14:22:39,462 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 9.090909090909092) internal successors, (100), 12 states have internal predecessors, (100), 8 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 6 states have call predecessors, (15), 7 states have call successors, (15) Word has length 145 [2025-03-03 14:22:39,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:39,805 INFO L225 Difference]: With dead ends: 96637 [2025-03-03 14:22:39,805 INFO L226 Difference]: Without dead ends: 96269 [2025-03-03 14:22:39,856 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2025-03-03 14:22:39,857 INFO L435 NwaCegarLoop]: 445 mSDtfsCounter, 145 mSDsluCounter, 4880 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 5325 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:39,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 5325 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:22:39,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96269 states.