./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec0_product11.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/email_spec0_product11.cil.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 0a22b5b7c3f7f6e8ff7182918ba517a92e8c6204e4a486ab05fe09fb2404c376 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 03:48:42,202 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 03:48:42,279 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 03:48:42,287 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 03:48:42,288 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 03:48:42,311 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 03:48:42,312 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 03:48:42,313 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 03:48:42,313 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 03:48:42,313 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 03:48:42,314 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 03:48:42,314 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 03:48:42,314 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 03:48:42,314 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 03:48:42,315 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 03:48:42,315 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 03:48:42,315 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 03:48:42,315 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 03:48:42,315 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 03:48:42,315 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 03:48:42,315 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 03:48:42,316 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 03:48:42,316 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 03:48:42,316 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 03:48:42,316 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 03:48:42,316 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 03:48:42,316 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 03:48:42,316 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 03:48:42,316 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 03:48:42,316 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:48:42,317 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:48:42,317 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:48:42,317 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:48:42,317 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 03:48:42,317 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:48:42,317 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:48:42,317 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:48:42,317 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:48:42,318 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 03:48:42,318 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 03:48:42,318 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 03:48:42,318 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 03:48:42,318 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 03:48:42,318 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 03:48:42,318 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 03:48:42,318 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 03:48:42,318 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 03:48:42,319 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 03:48:42,319 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-jdk21/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 -> 0a22b5b7c3f7f6e8ff7182918ba517a92e8c6204e4a486ab05fe09fb2404c376 [2025-01-09 03:48:42,613 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 03:48:42,621 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 03:48:42,625 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 03:48:42,626 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 03:48:42,626 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 03:48:42,627 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec0_product11.cil.c [2025-01-09 03:48:43,908 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e164e4298/c621360612a14df5af343f1c4657625d/FLAGd100005b2 [2025-01-09 03:48:44,367 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 03:48:44,368 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec0_product11.cil.c [2025-01-09 03:48:44,394 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e164e4298/c621360612a14df5af343f1c4657625d/FLAGd100005b2 [2025-01-09 03:48:44,412 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e164e4298/c621360612a14df5af343f1c4657625d [2025-01-09 03:48:44,414 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 03:48:44,415 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 03:48:44,417 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 03:48:44,417 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 03:48:44,421 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 03:48:44,422 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:48:44" (1/1) ... [2025-01-09 03:48:44,422 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5be4c194 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:44, skipping insertion in model container [2025-01-09 03:48:44,423 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:48:44" (1/1) ... [2025-01-09 03:48:44,477 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 03:48:45,002 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec0_product11.cil.c[59717,59730] [2025-01-09 03:48:45,009 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:48:45,027 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 03:48:45,036 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [48] [2025-01-09 03:48:45,037 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [460] [2025-01-09 03:48:45,038 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [509] [2025-01-09 03:48:45,038 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [576] [2025-01-09 03:48:45,038 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"DecryptForward_spec.i","") [876] [2025-01-09 03:48:45,038 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [896] [2025-01-09 03:48:45,039 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [1262] [2025-01-09 03:48:45,039 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [1478] [2025-01-09 03:48:45,039 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [1671] [2025-01-09 03:48:45,039 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [2740] [2025-01-09 03:48:45,039 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [2749] [2025-01-09 03:48:45,130 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec0_product11.cil.c[59717,59730] [2025-01-09 03:48:45,132 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:48:45,162 INFO L204 MainTranslator]: Completed translation [2025-01-09 03:48:45,163 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:45 WrapperNode [2025-01-09 03:48:45,163 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 03:48:45,164 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 03:48:45,164 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 03:48:45,164 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 03:48:45,170 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:45" (1/1) ... [2025-01-09 03:48:45,195 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:45" (1/1) ... [2025-01-09 03:48:45,246 INFO L138 Inliner]: procedures = 121, calls = 162, calls flagged for inlining = 48, calls inlined = 43, statements flattened = 796 [2025-01-09 03:48:45,247 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 03:48:45,249 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 03:48:45,249 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 03:48:45,249 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 03:48:45,257 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:45" (1/1) ... [2025-01-09 03:48:45,258 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:45" (1/1) ... [2025-01-09 03:48:45,265 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:45" (1/1) ... [2025-01-09 03:48:45,290 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-01-09 03:48:45,290 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:45" (1/1) ... [2025-01-09 03:48:45,290 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:45" (1/1) ... [2025-01-09 03:48:45,308 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:45" (1/1) ... [2025-01-09 03:48:45,311 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:45" (1/1) ... [2025-01-09 03:48:45,324 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:45" (1/1) ... [2025-01-09 03:48:45,329 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:45" (1/1) ... [2025-01-09 03:48:45,334 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:45" (1/1) ... [2025-01-09 03:48:45,346 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 03:48:45,350 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 03:48:45,350 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 03:48:45,350 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 03:48:45,351 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:45" (1/1) ... [2025-01-09 03:48:45,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:48:45,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:48:45,401 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 03:48:45,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 03:48:45,423 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-01-09 03:48:45,424 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-01-09 03:48:45,424 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-01-09 03:48:45,424 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-01-09 03:48:45,424 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2025-01-09 03:48:45,424 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2025-01-09 03:48:45,424 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-01-09 03:48:45,425 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-01-09 03:48:45,425 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-01-09 03:48:45,425 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-01-09 03:48:45,425 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-01-09 03:48:45,425 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-01-09 03:48:45,425 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 03:48:45,425 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-01-09 03:48:45,425 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-01-09 03:48:45,425 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-01-09 03:48:45,425 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-01-09 03:48:45,426 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-01-09 03:48:45,426 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-01-09 03:48:45,426 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-01-09 03:48:45,426 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-01-09 03:48:45,426 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-01-09 03:48:45,426 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-01-09 03:48:45,426 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-01-09 03:48:45,426 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-01-09 03:48:45,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 03:48:45,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 03:48:45,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 03:48:45,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 03:48:45,427 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-01-09 03:48:45,427 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-01-09 03:48:45,427 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 03:48:45,427 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 03:48:45,605 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 03:48:45,607 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 03:48:46,352 INFO L? ?]: Removed 304 outVars from TransFormulas that were not future-live. [2025-01-09 03:48:46,353 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 03:48:46,374 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 03:48:46,375 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 03:48:46,376 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:48:46 BoogieIcfgContainer [2025-01-09 03:48:46,376 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 03:48:46,379 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 03:48:46,379 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 03:48:46,383 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 03:48:46,383 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:48:44" (1/3) ... [2025-01-09 03:48:46,384 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c324a4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:48:46, skipping insertion in model container [2025-01-09 03:48:46,385 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:45" (2/3) ... [2025-01-09 03:48:46,385 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c324a4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:48:46, skipping insertion in model container [2025-01-09 03:48:46,385 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:48:46" (3/3) ... [2025-01-09 03:48:46,386 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec0_product11.cil.c [2025-01-09 03:48:46,403 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 03:48:46,406 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec0_product11.cil.c that has 14 procedures, 234 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 03:48:46,475 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 03:48:46,488 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;@540d170, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 03:48:46,488 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 03:48:46,493 INFO L276 IsEmpty]: Start isEmpty. Operand has 234 states, 184 states have (on average 1.5271739130434783) internal successors, (281), 186 states have internal predecessors, (281), 35 states have call successors, (35), 13 states have call predecessors, (35), 13 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-01-09 03:48:46,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-01-09 03:48:46,506 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:46,507 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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] [2025-01-09 03:48:46,507 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:46,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:46,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1081346050, now seen corresponding path program 1 times [2025-01-09 03:48:46,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:46,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129406635] [2025-01-09 03:48:46,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:46,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:46,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-09 03:48:46,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-09 03:48:46,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:46,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:47,236 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-01-09 03:48:47,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:47,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129406635] [2025-01-09 03:48:47,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129406635] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:48:47,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2132483462] [2025-01-09 03:48:47,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:47,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:48:47,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:48:47,245 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:48:47,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 03:48:47,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-09 03:48:47,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-09 03:48:47,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:47,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:47,589 INFO L256 TraceCheckSpWp]: Trace formula consists of 893 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 03:48:47,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:48:47,664 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-01-09 03:48:47,664 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:48:47,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2132483462] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:47,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:48:47,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-01-09 03:48:47,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227572296] [2025-01-09 03:48:47,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:47,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:48:47,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:47,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:48:47,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:48:47,698 INFO L87 Difference]: Start difference. First operand has 234 states, 184 states have (on average 1.5271739130434783) internal successors, (281), 186 states have internal predecessors, (281), 35 states have call successors, (35), 13 states have call predecessors, (35), 13 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:48:47,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:47,768 INFO L93 Difference]: Finished difference Result 317 states and 462 transitions. [2025-01-09 03:48:47,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:48:47,771 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 93 [2025-01-09 03:48:47,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:47,781 INFO L225 Difference]: With dead ends: 317 [2025-01-09 03:48:47,783 INFO L226 Difference]: Without dead ends: 229 [2025-01-09 03:48:47,788 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 93 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-01-09 03:48:47,792 INFO L435 NwaCegarLoop]: 346 mSDtfsCounter, 1 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:47,794 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 689 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:48:47,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2025-01-09 03:48:47,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 228. [2025-01-09 03:48:47,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 179 states have (on average 1.5195530726256983) internal successors, (272), 180 states have internal predecessors, (272), 35 states have call successors, (35), 13 states have call predecessors, (35), 13 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-01-09 03:48:47,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 341 transitions. [2025-01-09 03:48:47,860 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 341 transitions. Word has length 93 [2025-01-09 03:48:47,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:47,863 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 341 transitions. [2025-01-09 03:48:47,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:48:47,863 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 341 transitions. [2025-01-09 03:48:47,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-01-09 03:48:47,868 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:47,868 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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] [2025-01-09 03:48:47,879 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 03:48:48,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 03:48:48,069 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:48,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:48,070 INFO L85 PathProgramCache]: Analyzing trace with hash 786015636, now seen corresponding path program 1 times [2025-01-09 03:48:48,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:48,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16729678] [2025-01-09 03:48:48,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:48,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:48,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 03:48:48,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 03:48:48,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:48,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:48,351 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-01-09 03:48:48,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:48,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16729678] [2025-01-09 03:48:48,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16729678] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:48:48,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [40258963] [2025-01-09 03:48:48,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:48,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:48:48,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:48:48,357 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:48:48,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 03:48:48,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 03:48:48,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 03:48:48,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:48,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:48,672 INFO L256 TraceCheckSpWp]: Trace formula consists of 904 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 03:48:48,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:48:48,703 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-01-09 03:48:48,703 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:48:48,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [40258963] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:48,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:48:48,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-01-09 03:48:48,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721169796] [2025-01-09 03:48:48,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:48,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:48:48,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:48,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:48:48,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:48:48,706 INFO L87 Difference]: Start difference. First operand 228 states and 341 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:48:48,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:48,764 INFO L93 Difference]: Finished difference Result 486 states and 741 transitions. [2025-01-09 03:48:48,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:48:48,765 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 98 [2025-01-09 03:48:48,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:48,768 INFO L225 Difference]: With dead ends: 486 [2025-01-09 03:48:48,768 INFO L226 Difference]: Without dead ends: 284 [2025-01-09 03:48:48,770 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 98 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-01-09 03:48:48,771 INFO L435 NwaCegarLoop]: 351 mSDtfsCounter, 107 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 643 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-01-09 03:48:48,771 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 643 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:48:48,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2025-01-09 03:48:48,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 276. [2025-01-09 03:48:48,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 216 states have (on average 1.5416666666666667) internal successors, (333), 217 states have internal predecessors, (333), 46 states have call successors, (46), 13 states have call predecessors, (46), 13 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2025-01-09 03:48:48,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 424 transitions. [2025-01-09 03:48:48,802 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 424 transitions. Word has length 98 [2025-01-09 03:48:48,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:48,803 INFO L471 AbstractCegarLoop]: Abstraction has 276 states and 424 transitions. [2025-01-09 03:48:48,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:48:48,803 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 424 transitions. [2025-01-09 03:48:48,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-09 03:48:48,810 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:48,810 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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] [2025-01-09 03:48:48,820 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 03:48:49,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:48:49,011 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:49,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:49,012 INFO L85 PathProgramCache]: Analyzing trace with hash 402979123, now seen corresponding path program 1 times [2025-01-09 03:48:49,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:49,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070807842] [2025-01-09 03:48:49,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:49,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:49,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 03:48:49,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 03:48:49,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:49,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:49,272 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-01-09 03:48:49,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:49,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070807842] [2025-01-09 03:48:49,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070807842] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:48:49,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [960248626] [2025-01-09 03:48:49,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:49,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:48:49,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:48:49,279 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:48:49,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 03:48:49,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 03:48:49,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 03:48:49,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:49,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:49,559 INFO L256 TraceCheckSpWp]: Trace formula consists of 909 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 03:48:49,564 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:48:49,619 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-01-09 03:48:49,620 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:48:49,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [960248626] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:49,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:48:49,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-01-09 03:48:49,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409502393] [2025-01-09 03:48:49,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:49,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:48:49,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:49,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:48:49,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:48:49,622 INFO L87 Difference]: Start difference. First operand 276 states and 424 transitions. Second operand has 5 states, 4 states have (on average 16.0) internal successors, (64), 5 states have internal predecessors, (64), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 03:48:49,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:49,691 INFO L93 Difference]: Finished difference Result 543 states and 838 transitions. [2025-01-09 03:48:49,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:48:49,692 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.0) internal successors, (64), 5 states have internal predecessors, (64), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 99 [2025-01-09 03:48:49,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:49,696 INFO L225 Difference]: With dead ends: 543 [2025-01-09 03:48:49,696 INFO L226 Difference]: Without dead ends: 278 [2025-01-09 03:48:49,698 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 97 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-01-09 03:48:49,699 INFO L435 NwaCegarLoop]: 332 mSDtfsCounter, 2 mSDsluCounter, 985 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1317 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-01-09 03:48:49,699 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1317 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:48:49,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2025-01-09 03:48:49,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2025-01-09 03:48:49,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 217 states have (on average 1.5391705069124424) internal successors, (334), 219 states have internal predecessors, (334), 46 states have call successors, (46), 13 states have call predecessors, (46), 14 states have return successors, (47), 45 states have call predecessors, (47), 45 states have call successors, (47) [2025-01-09 03:48:49,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 427 transitions. [2025-01-09 03:48:49,717 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 427 transitions. Word has length 99 [2025-01-09 03:48:49,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:49,718 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 427 transitions. [2025-01-09 03:48:49,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.0) internal successors, (64), 5 states have internal predecessors, (64), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 03:48:49,718 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 427 transitions. [2025-01-09 03:48:49,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-09 03:48:49,721 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:49,721 INFO L218 NwaCegarLoop]: trace histogram [3, 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] [2025-01-09 03:48:49,731 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 03:48:49,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:48:49,926 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:49,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:49,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1289494450, now seen corresponding path program 1 times [2025-01-09 03:48:49,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:49,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789952798] [2025-01-09 03:48:49,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:49,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:49,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 03:48:49,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 03:48:49,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:49,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:50,135 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-09 03:48:50,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:50,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789952798] [2025-01-09 03:48:50,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789952798] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:48:50,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [346949400] [2025-01-09 03:48:50,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:50,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:48:50,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:48:50,141 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:48:50,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 03:48:50,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 03:48:50,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 03:48:50,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:50,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:50,421 INFO L256 TraceCheckSpWp]: Trace formula consists of 910 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 03:48:50,425 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:48:50,484 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-01-09 03:48:50,485 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:48:50,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [346949400] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:50,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:48:50,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-01-09 03:48:50,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631273900] [2025-01-09 03:48:50,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:50,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:48:50,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:50,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:48:50,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-01-09 03:48:50,487 INFO L87 Difference]: Start difference. First operand 278 states and 427 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 03:48:50,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:50,568 INFO L93 Difference]: Finished difference Result 545 states and 843 transitions. [2025-01-09 03:48:50,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:48:50,569 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 100 [2025-01-09 03:48:50,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:50,572 INFO L225 Difference]: With dead ends: 545 [2025-01-09 03:48:50,572 INFO L226 Difference]: Without dead ends: 280 [2025-01-09 03:48:50,575 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-01-09 03:48:50,576 INFO L435 NwaCegarLoop]: 330 mSDtfsCounter, 2 mSDsluCounter, 973 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1303 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-01-09 03:48:50,576 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1303 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:48:50,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2025-01-09 03:48:50,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 280. [2025-01-09 03:48:50,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 218 states have (on average 1.536697247706422) internal successors, (335), 221 states have internal predecessors, (335), 46 states have call successors, (46), 13 states have call predecessors, (46), 15 states have return successors, (52), 45 states have call predecessors, (52), 45 states have call successors, (52) [2025-01-09 03:48:50,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 433 transitions. [2025-01-09 03:48:50,604 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 433 transitions. Word has length 100 [2025-01-09 03:48:50,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:50,606 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 433 transitions. [2025-01-09 03:48:50,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 03:48:50,606 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 433 transitions. [2025-01-09 03:48:50,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-01-09 03:48:50,608 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:50,608 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:48:50,617 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 03:48:50,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:48:50,809 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:50,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:50,810 INFO L85 PathProgramCache]: Analyzing trace with hash 301832339, now seen corresponding path program 1 times [2025-01-09 03:48:50,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:50,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845944334] [2025-01-09 03:48:50,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:50,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:50,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 03:48:50,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 03:48:50,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:50,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:50,992 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-01-09 03:48:50,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:50,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845944334] [2025-01-09 03:48:50,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845944334] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:50,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:50,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:48:50,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522209798] [2025-01-09 03:48:50,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:50,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:48:50,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:50,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:48:50,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:48:50,995 INFO L87 Difference]: Start difference. First operand 280 states and 433 transitions. Second operand has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 03:48:51,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:51,048 INFO L93 Difference]: Finished difference Result 537 states and 834 transitions. [2025-01-09 03:48:51,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:48:51,049 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 101 [2025-01-09 03:48:51,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:51,053 INFO L225 Difference]: With dead ends: 537 [2025-01-09 03:48:51,053 INFO L226 Difference]: Without dead ends: 280 [2025-01-09 03:48:51,054 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-01-09 03:48:51,054 INFO L435 NwaCegarLoop]: 333 mSDtfsCounter, 2 mSDsluCounter, 988 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1321 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-01-09 03:48:51,054 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1321 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:48:51,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2025-01-09 03:48:51,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 280. [2025-01-09 03:48:51,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 218 states have (on average 1.536697247706422) internal successors, (335), 221 states have internal predecessors, (335), 46 states have call successors, (46), 13 states have call predecessors, (46), 15 states have return successors, (51), 45 states have call predecessors, (51), 45 states have call successors, (51) [2025-01-09 03:48:51,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 432 transitions. [2025-01-09 03:48:51,079 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 432 transitions. Word has length 101 [2025-01-09 03:48:51,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:51,080 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 432 transitions. [2025-01-09 03:48:51,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 03:48:51,080 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 432 transitions. [2025-01-09 03:48:51,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-01-09 03:48:51,085 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:51,085 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:48:51,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 03:48:51,086 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:51,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:51,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1221424368, now seen corresponding path program 2 times [2025-01-09 03:48:51,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:51,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121972128] [2025-01-09 03:48:51,087 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 03:48:51,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:51,105 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 102 statements into 2 equivalence classes. [2025-01-09 03:48:51,113 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 102 statements. [2025-01-09 03:48:51,114 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 03:48:51,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:51,199 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-09 03:48:51,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:51,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121972128] [2025-01-09 03:48:51,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121972128] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:51,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:51,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:48:51,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646545389] [2025-01-09 03:48:51,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:51,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:48:51,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:51,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:48:51,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:48:51,202 INFO L87 Difference]: Start difference. First operand 280 states and 432 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:48:51,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:51,277 INFO L93 Difference]: Finished difference Result 603 states and 920 transitions. [2025-01-09 03:48:51,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 03:48:51,278 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 102 [2025-01-09 03:48:51,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:51,282 INFO L225 Difference]: With dead ends: 603 [2025-01-09 03:48:51,285 INFO L226 Difference]: Without dead ends: 536 [2025-01-09 03:48:51,286 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:48:51,286 INFO L435 NwaCegarLoop]: 341 mSDtfsCounter, 298 mSDsluCounter, 980 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 1321 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:51,287 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 1321 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:48:51,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2025-01-09 03:48:51,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 532. [2025-01-09 03:48:51,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 418 states have (on average 1.5526315789473684) internal successors, (649), 422 states have internal predecessors, (649), 86 states have call successors, (86), 25 states have call predecessors, (86), 27 states have return successors, (90), 84 states have call predecessors, (90), 84 states have call successors, (90) [2025-01-09 03:48:51,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 825 transitions. [2025-01-09 03:48:51,326 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 825 transitions. Word has length 102 [2025-01-09 03:48:51,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:51,328 INFO L471 AbstractCegarLoop]: Abstraction has 532 states and 825 transitions. [2025-01-09 03:48:51,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:48:51,328 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 825 transitions. [2025-01-09 03:48:51,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-01-09 03:48:51,331 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:51,332 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:48:51,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 03:48:51,332 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:51,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:51,332 INFO L85 PathProgramCache]: Analyzing trace with hash -710296521, now seen corresponding path program 1 times [2025-01-09 03:48:51,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:51,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652899881] [2025-01-09 03:48:51,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:51,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:51,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-09 03:48:51,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-09 03:48:51,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:51,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:51,509 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-01-09 03:48:51,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:51,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652899881] [2025-01-09 03:48:51,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652899881] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:51,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:51,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:48:51,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322344921] [2025-01-09 03:48:51,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:51,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:48:51,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:51,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:48:51,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:48:51,511 INFO L87 Difference]: Start difference. First operand 532 states and 825 transitions. Second operand has 5 states, 4 states have (on average 16.0) internal successors, (64), 5 states have internal predecessors, (64), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 03:48:51,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:51,574 INFO L93 Difference]: Finished difference Result 1043 states and 1623 transitions. [2025-01-09 03:48:51,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:48:51,575 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.0) internal successors, (64), 5 states have internal predecessors, (64), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 103 [2025-01-09 03:48:51,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:51,580 INFO L225 Difference]: With dead ends: 1043 [2025-01-09 03:48:51,581 INFO L226 Difference]: Without dead ends: 534 [2025-01-09 03:48:51,583 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-01-09 03:48:51,584 INFO L435 NwaCegarLoop]: 334 mSDtfsCounter, 1 mSDsluCounter, 990 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1324 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-01-09 03:48:51,584 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1324 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:48:51,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2025-01-09 03:48:51,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 534. [2025-01-09 03:48:51,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 419 states have (on average 1.5513126491646778) internal successors, (650), 424 states have internal predecessors, (650), 86 states have call successors, (86), 25 states have call predecessors, (86), 28 states have return successors, (92), 84 states have call predecessors, (92), 84 states have call successors, (92) [2025-01-09 03:48:51,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 828 transitions. [2025-01-09 03:48:51,617 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 828 transitions. Word has length 103 [2025-01-09 03:48:51,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:51,618 INFO L471 AbstractCegarLoop]: Abstraction has 534 states and 828 transitions. [2025-01-09 03:48:51,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.0) internal successors, (64), 5 states have internal predecessors, (64), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 03:48:51,618 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 828 transitions. [2025-01-09 03:48:51,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-09 03:48:51,621 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:51,621 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:48:51,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 03:48:51,622 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:51,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:51,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1508252881, now seen corresponding path program 1 times [2025-01-09 03:48:51,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:51,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295483251] [2025-01-09 03:48:51,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:51,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:51,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 03:48:51,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 03:48:51,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:51,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:51,785 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-09 03:48:51,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:51,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295483251] [2025-01-09 03:48:51,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295483251] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:51,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:51,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 03:48:51,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225098525] [2025-01-09 03:48:51,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:51,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 03:48:51,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:51,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 03:48:51,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:48:51,788 INFO L87 Difference]: Start difference. First operand 534 states and 828 transitions. Second operand has 8 states, 7 states have (on average 9.714285714285714) internal successors, (68), 8 states have internal predecessors, (68), 4 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2025-01-09 03:48:51,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:51,941 INFO L93 Difference]: Finished difference Result 1047 states and 1626 transitions. [2025-01-09 03:48:51,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 03:48:51,942 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.714285714285714) internal successors, (68), 8 states have internal predecessors, (68), 4 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) Word has length 104 [2025-01-09 03:48:51,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:51,946 INFO L225 Difference]: With dead ends: 1047 [2025-01-09 03:48:51,946 INFO L226 Difference]: Without dead ends: 538 [2025-01-09 03:48:51,950 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-01-09 03:48:51,951 INFO L435 NwaCegarLoop]: 324 mSDtfsCounter, 7 mSDsluCounter, 1915 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2239 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-01-09 03:48:51,951 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2239 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:48:51,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2025-01-09 03:48:51,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 536. [2025-01-09 03:48:51,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 421 states have (on average 1.5486935866983373) internal successors, (652), 425 states have internal predecessors, (652), 86 states have call successors, (86), 26 states have call predecessors, (86), 28 states have return successors, (91), 84 states have call predecessors, (91), 84 states have call successors, (91) [2025-01-09 03:48:51,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 829 transitions. [2025-01-09 03:48:51,989 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 829 transitions. Word has length 104 [2025-01-09 03:48:51,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:51,990 INFO L471 AbstractCegarLoop]: Abstraction has 536 states and 829 transitions. [2025-01-09 03:48:51,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.714285714285714) internal successors, (68), 8 states have internal predecessors, (68), 4 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2025-01-09 03:48:51,990 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 829 transitions. [2025-01-09 03:48:51,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-01-09 03:48:51,994 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:51,994 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:48:51,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 03:48:51,994 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:51,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:51,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1528663456, now seen corresponding path program 2 times [2025-01-09 03:48:51,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:51,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665851802] [2025-01-09 03:48:51,995 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 03:48:51,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:52,016 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 105 statements into 2 equivalence classes. [2025-01-09 03:48:52,024 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 57 of 105 statements. [2025-01-09 03:48:52,025 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 03:48:52,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:52,108 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-01-09 03:48:52,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:52,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665851802] [2025-01-09 03:48:52,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665851802] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:52,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:52,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:48:52,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725059997] [2025-01-09 03:48:52,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:52,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:48:52,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:52,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:48:52,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:48:52,111 INFO L87 Difference]: Start difference. First operand 536 states and 829 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:48:52,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:52,178 INFO L93 Difference]: Finished difference Result 1184 states and 1801 transitions. [2025-01-09 03:48:52,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 03:48:52,179 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 105 [2025-01-09 03:48:52,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:52,187 INFO L225 Difference]: With dead ends: 1184 [2025-01-09 03:48:52,190 INFO L226 Difference]: Without dead ends: 1048 [2025-01-09 03:48:52,192 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:48:52,193 INFO L435 NwaCegarLoop]: 339 mSDtfsCounter, 295 mSDsluCounter, 973 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 1312 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:52,193 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 1312 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:48:52,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1048 states. [2025-01-09 03:48:52,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1048 to 1036. [2025-01-09 03:48:52,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1036 states, 817 states have (on average 1.561811505507956) internal successors, (1276), 823 states have internal predecessors, (1276), 166 states have call successors, (166), 50 states have call predecessors, (166), 52 states have return successors, (169), 162 states have call predecessors, (169), 162 states have call successors, (169) [2025-01-09 03:48:52,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1036 states to 1036 states and 1611 transitions. [2025-01-09 03:48:52,285 INFO L78 Accepts]: Start accepts. Automaton has 1036 states and 1611 transitions. Word has length 105 [2025-01-09 03:48:52,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:52,286 INFO L471 AbstractCegarLoop]: Abstraction has 1036 states and 1611 transitions. [2025-01-09 03:48:52,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:48:52,286 INFO L276 IsEmpty]: Start isEmpty. Operand 1036 states and 1611 transitions. [2025-01-09 03:48:52,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-01-09 03:48:52,290 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:52,290 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:48:52,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 03:48:52,291 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:52,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:52,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1966477026, now seen corresponding path program 1 times [2025-01-09 03:48:52,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:52,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493537440] [2025-01-09 03:48:52,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:52,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:52,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-01-09 03:48:52,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-01-09 03:48:52,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:52,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:52,447 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-09 03:48:52,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:52,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493537440] [2025-01-09 03:48:52,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493537440] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:52,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:52,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 03:48:52,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619925150] [2025-01-09 03:48:52,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:52,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 03:48:52,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:52,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 03:48:52,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:48:52,450 INFO L87 Difference]: Start difference. First operand 1036 states and 1611 transitions. Second operand has 8 states, 7 states have (on average 10.0) internal successors, (70), 8 states have internal predecessors, (70), 4 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2025-01-09 03:48:52,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:52,621 INFO L93 Difference]: Finished difference Result 2054 states and 3205 transitions. [2025-01-09 03:48:52,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 03:48:52,622 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 10.0) internal successors, (70), 8 states have internal predecessors, (70), 4 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) Word has length 106 [2025-01-09 03:48:52,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:52,630 INFO L225 Difference]: With dead ends: 2054 [2025-01-09 03:48:52,630 INFO L226 Difference]: Without dead ends: 1045 [2025-01-09 03:48:52,634 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-01-09 03:48:52,635 INFO L435 NwaCegarLoop]: 326 mSDtfsCounter, 5 mSDsluCounter, 1927 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 2253 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:52,635 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 2253 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:48:52,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1045 states. [2025-01-09 03:48:52,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1045 to 1039. [2025-01-09 03:48:52,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1039 states, 819 states have (on average 1.5604395604395604) internal successors, (1278), 826 states have internal predecessors, (1278), 166 states have call successors, (166), 50 states have call predecessors, (166), 53 states have return successors, (174), 162 states have call predecessors, (174), 162 states have call successors, (174) [2025-01-09 03:48:52,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1039 states to 1039 states and 1618 transitions. [2025-01-09 03:48:52,692 INFO L78 Accepts]: Start accepts. Automaton has 1039 states and 1618 transitions. Word has length 106 [2025-01-09 03:48:52,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:52,692 INFO L471 AbstractCegarLoop]: Abstraction has 1039 states and 1618 transitions. [2025-01-09 03:48:52,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 10.0) internal successors, (70), 8 states have internal predecessors, (70), 4 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2025-01-09 03:48:52,693 INFO L276 IsEmpty]: Start isEmpty. Operand 1039 states and 1618 transitions. [2025-01-09 03:48:52,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-01-09 03:48:52,697 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:52,697 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:48:52,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 03:48:52,697 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:52,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:52,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1178175912, now seen corresponding path program 1 times [2025-01-09 03:48:52,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:52,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463437125] [2025-01-09 03:48:52,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:52,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:52,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-09 03:48:52,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-09 03:48:52,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:52,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:52,831 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-09 03:48:52,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:52,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463437125] [2025-01-09 03:48:52,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463437125] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:48:52,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [341810638] [2025-01-09 03:48:52,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:52,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:48:52,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:48:52,835 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:48:52,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 03:48:52,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-09 03:48:53,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-09 03:48:53,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:53,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:53,095 INFO L256 TraceCheckSpWp]: Trace formula consists of 917 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 03:48:53,098 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:48:53,122 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-09 03:48:53,123 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:48:53,217 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-09 03:48:53,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [341810638] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:48:53,221 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 03:48:53,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-01-09 03:48:53,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000407240] [2025-01-09 03:48:53,221 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 03:48:53,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 03:48:53,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:53,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 03:48:53,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:48:53,222 INFO L87 Difference]: Start difference. First operand 1039 states and 1618 transitions. Second operand has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 03:48:53,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:53,445 INFO L93 Difference]: Finished difference Result 2216 states and 3507 transitions. [2025-01-09 03:48:53,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:48:53,446 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 107 [2025-01-09 03:48:53,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:53,459 INFO L225 Difference]: With dead ends: 2216 [2025-01-09 03:48:53,459 INFO L226 Difference]: Without dead ends: 1914 [2025-01-09 03:48:53,462 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 211 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-01-09 03:48:53,462 INFO L435 NwaCegarLoop]: 367 mSDtfsCounter, 612 mSDsluCounter, 1013 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 657 SdHoareTripleChecker+Valid, 1380 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:53,463 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [657 Valid, 1380 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:48:53,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1914 states. [2025-01-09 03:48:53,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1914 to 1850. [2025-01-09 03:48:53,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1850 states, 1474 states have (on average 1.6044776119402986) internal successors, (2365), 1481 states have internal predecessors, (2365), 322 states have call successors, (322), 50 states have call predecessors, (322), 53 states have return successors, (340), 318 states have call predecessors, (340), 318 states have call successors, (340) [2025-01-09 03:48:53,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1850 states to 1850 states and 3027 transitions. [2025-01-09 03:48:53,568 INFO L78 Accepts]: Start accepts. Automaton has 1850 states and 3027 transitions. Word has length 107 [2025-01-09 03:48:53,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:53,568 INFO L471 AbstractCegarLoop]: Abstraction has 1850 states and 3027 transitions. [2025-01-09 03:48:53,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 03:48:53,569 INFO L276 IsEmpty]: Start isEmpty. Operand 1850 states and 3027 transitions. [2025-01-09 03:48:53,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-01-09 03:48:53,578 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:53,578 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:48:53,587 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-09 03:48:53,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-01-09 03:48:53,779 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:53,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:53,780 INFO L85 PathProgramCache]: Analyzing trace with hash -307835974, now seen corresponding path program 1 times [2025-01-09 03:48:53,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:53,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36149556] [2025-01-09 03:48:53,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:53,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:53,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-01-09 03:48:53,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-01-09 03:48:53,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:53,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:53,845 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-09 03:48:53,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:53,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36149556] [2025-01-09 03:48:53,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36149556] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:53,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:53,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:48:53,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881481831] [2025-01-09 03:48:53,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:53,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:48:53,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:53,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:48:53,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:48:53,847 INFO L87 Difference]: Start difference. First operand 1850 states and 3027 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:48:53,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:53,939 INFO L93 Difference]: Finished difference Result 4507 states and 7454 transitions. [2025-01-09 03:48:53,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:48:53,939 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 114 [2025-01-09 03:48:53,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:53,956 INFO L225 Difference]: With dead ends: 4507 [2025-01-09 03:48:53,957 INFO L226 Difference]: Without dead ends: 2726 [2025-01-09 03:48:53,964 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-01-09 03:48:53,964 INFO L435 NwaCegarLoop]: 352 mSDtfsCounter, 105 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 691 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-01-09 03:48:53,965 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 691 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:48:53,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2726 states. [2025-01-09 03:48:54,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2726 to 2694. [2025-01-09 03:48:54,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2694 states, 2151 states have (on average 1.6145978614597862) internal successors, (3473), 2158 states have internal predecessors, (3473), 489 states have call successors, (489), 50 states have call predecessors, (489), 53 states have return successors, (517), 485 states have call predecessors, (517), 485 states have call successors, (517) [2025-01-09 03:48:54,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2694 states to 2694 states and 4479 transitions. [2025-01-09 03:48:54,132 INFO L78 Accepts]: Start accepts. Automaton has 2694 states and 4479 transitions. Word has length 114 [2025-01-09 03:48:54,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:54,132 INFO L471 AbstractCegarLoop]: Abstraction has 2694 states and 4479 transitions. [2025-01-09 03:48:54,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:48:54,133 INFO L276 IsEmpty]: Start isEmpty. Operand 2694 states and 4479 transitions. [2025-01-09 03:48:54,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-01-09 03:48:54,146 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:54,146 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:48:54,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 03:48:54,147 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:54,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:54,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1140306096, now seen corresponding path program 1 times [2025-01-09 03:48:54,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:54,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101119340] [2025-01-09 03:48:54,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:54,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:54,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-01-09 03:48:54,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-01-09 03:48:54,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:54,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:54,212 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-09 03:48:54,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:54,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101119340] [2025-01-09 03:48:54,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101119340] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:54,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:54,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:48:54,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813447331] [2025-01-09 03:48:54,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:54,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:48:54,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:54,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:48:54,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:48:54,215 INFO L87 Difference]: Start difference. First operand 2694 states and 4479 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:48:54,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:54,330 INFO L93 Difference]: Finished difference Result 6657 states and 11142 transitions. [2025-01-09 03:48:54,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:48:54,331 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 115 [2025-01-09 03:48:54,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:54,358 INFO L225 Difference]: With dead ends: 6657 [2025-01-09 03:48:54,358 INFO L226 Difference]: Without dead ends: 4083 [2025-01-09 03:48:54,370 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-01-09 03:48:54,371 INFO L435 NwaCegarLoop]: 343 mSDtfsCounter, 103 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 676 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-01-09 03:48:54,372 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 676 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:48:54,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4083 states. [2025-01-09 03:48:54,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4083 to 4051. [2025-01-09 03:48:54,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4051 states, 3249 states have (on average 1.6226531240381656) internal successors, (5272), 3256 states have internal predecessors, (5272), 748 states have call successors, (748), 50 states have call predecessors, (748), 53 states have return successors, (776), 744 states have call predecessors, (776), 744 states have call successors, (776) [2025-01-09 03:48:54,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4051 states to 4051 states and 6796 transitions. [2025-01-09 03:48:54,623 INFO L78 Accepts]: Start accepts. Automaton has 4051 states and 6796 transitions. Word has length 115 [2025-01-09 03:48:54,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:54,623 INFO L471 AbstractCegarLoop]: Abstraction has 4051 states and 6796 transitions. [2025-01-09 03:48:54,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:48:54,624 INFO L276 IsEmpty]: Start isEmpty. Operand 4051 states and 6796 transitions. [2025-01-09 03:48:54,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-01-09 03:48:54,644 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:54,644 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:48:54,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 03:48:54,645 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:54,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:54,645 INFO L85 PathProgramCache]: Analyzing trace with hash 1625483484, now seen corresponding path program 1 times [2025-01-09 03:48:54,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:54,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065333480] [2025-01-09 03:48:54,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:54,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:54,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-09 03:48:54,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-09 03:48:54,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:54,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:54,717 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-09 03:48:54,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:54,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065333480] [2025-01-09 03:48:54,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065333480] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:54,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:54,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:48:54,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364622839] [2025-01-09 03:48:54,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:54,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:48:54,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:54,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:48:54,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:48:54,719 INFO L87 Difference]: Start difference. First operand 4051 states and 6796 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:48:54,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:54,913 INFO L93 Difference]: Finished difference Result 10091 states and 17045 transitions. [2025-01-09 03:48:54,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:48:54,914 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 116 [2025-01-09 03:48:54,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:54,955 INFO L225 Difference]: With dead ends: 10091 [2025-01-09 03:48:54,955 INFO L226 Difference]: Without dead ends: 6281 [2025-01-09 03:48:54,972 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-01-09 03:48:54,973 INFO L435 NwaCegarLoop]: 339 mSDtfsCounter, 101 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 669 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-01-09 03:48:54,973 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 669 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:48:54,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6281 states. [2025-01-09 03:48:55,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6281 to 6249. [2025-01-09 03:48:55,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6249 states, 5086 states have (on average 1.6321274085725521) internal successors, (8301), 5093 states have internal predecessors, (8301), 1109 states have call successors, (1109), 50 states have call predecessors, (1109), 53 states have return successors, (1153), 1105 states have call predecessors, (1153), 1105 states have call successors, (1153) [2025-01-09 03:48:55,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6249 states to 6249 states and 10563 transitions. [2025-01-09 03:48:55,300 INFO L78 Accepts]: Start accepts. Automaton has 6249 states and 10563 transitions. Word has length 116 [2025-01-09 03:48:55,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:55,300 INFO L471 AbstractCegarLoop]: Abstraction has 6249 states and 10563 transitions. [2025-01-09 03:48:55,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:48:55,301 INFO L276 IsEmpty]: Start isEmpty. Operand 6249 states and 10563 transitions. [2025-01-09 03:48:55,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-01-09 03:48:55,324 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:55,324 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:48:55,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 03:48:55,324 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:55,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:55,325 INFO L85 PathProgramCache]: Analyzing trace with hash -597310191, now seen corresponding path program 1 times [2025-01-09 03:48:55,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:55,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256385248] [2025-01-09 03:48:55,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:55,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:55,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-01-09 03:48:55,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-01-09 03:48:55,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:55,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:55,395 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-09 03:48:55,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:55,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256385248] [2025-01-09 03:48:55,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256385248] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:55,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:55,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:48:55,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185573672] [2025-01-09 03:48:55,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:55,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:48:55,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:55,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:48:55,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:48:55,399 INFO L87 Difference]: Start difference. First operand 6249 states and 10563 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:48:55,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:55,686 INFO L93 Difference]: Finished difference Result 15883 states and 27008 transitions. [2025-01-09 03:48:55,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:48:55,686 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 117 [2025-01-09 03:48:55,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:55,757 INFO L225 Difference]: With dead ends: 15883 [2025-01-09 03:48:55,758 INFO L226 Difference]: Without dead ends: 10072 [2025-01-09 03:48:55,781 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-01-09 03:48:55,783 INFO L435 NwaCegarLoop]: 339 mSDtfsCounter, 99 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 669 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-01-09 03:48:55,784 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 669 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:48:55,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10072 states. [2025-01-09 03:48:56,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10072 to 10040. [2025-01-09 03:48:56,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10040 states, 8316 states have (on average 1.6405723905723906) internal successors, (13643), 8323 states have internal predecessors, (13643), 1670 states have call successors, (1670), 50 states have call predecessors, (1670), 53 states have return successors, (1740), 1666 states have call predecessors, (1740), 1666 states have call successors, (1740) [2025-01-09 03:48:56,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10040 states to 10040 states and 17053 transitions. [2025-01-09 03:48:56,271 INFO L78 Accepts]: Start accepts. Automaton has 10040 states and 17053 transitions. Word has length 117 [2025-01-09 03:48:56,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:56,272 INFO L471 AbstractCegarLoop]: Abstraction has 10040 states and 17053 transitions. [2025-01-09 03:48:56,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:48:56,273 INFO L276 IsEmpty]: Start isEmpty. Operand 10040 states and 17053 transitions. [2025-01-09 03:48:56,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-01-09 03:48:56,297 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:56,297 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:48:56,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 03:48:56,297 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:56,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:56,298 INFO L85 PathProgramCache]: Analyzing trace with hash -207297896, now seen corresponding path program 1 times [2025-01-09 03:48:56,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:56,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259634567] [2025-01-09 03:48:56,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:56,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:56,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-01-09 03:48:56,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-01-09 03:48:56,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:56,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:56,359 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-09 03:48:56,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:56,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259634567] [2025-01-09 03:48:56,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259634567] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:56,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:56,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:48:56,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660654882] [2025-01-09 03:48:56,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:56,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:48:56,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:56,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:48:56,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:48:56,362 INFO L87 Difference]: Start difference. First operand 10040 states and 17053 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:48:56,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:56,921 INFO L93 Difference]: Finished difference Result 25330 states and 43348 transitions. [2025-01-09 03:48:56,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:48:56,921 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 118 [2025-01-09 03:48:56,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:57,014 INFO L225 Difference]: With dead ends: 25330 [2025-01-09 03:48:57,015 INFO L226 Difference]: Without dead ends: 16993 [2025-01-09 03:48:57,059 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-01-09 03:48:57,060 INFO L435 NwaCegarLoop]: 344 mSDtfsCounter, 97 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 671 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-01-09 03:48:57,061 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 671 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:48:57,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16993 states. [2025-01-09 03:48:57,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16993 to 16961. [2025-01-09 03:48:57,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16961 states, 13917 states have (on average 1.640942731910613) internal successors, (22837), 13924 states have internal predecessors, (22837), 2990 states have call successors, (2990), 50 states have call predecessors, (2990), 53 states have return successors, (3104), 2986 states have call predecessors, (3104), 2986 states have call successors, (3104) [2025-01-09 03:48:57,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16961 states to 16961 states and 28931 transitions. [2025-01-09 03:48:57,930 INFO L78 Accepts]: Start accepts. Automaton has 16961 states and 28931 transitions. Word has length 118 [2025-01-09 03:48:57,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:57,930 INFO L471 AbstractCegarLoop]: Abstraction has 16961 states and 28931 transitions. [2025-01-09 03:48:57,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:48:57,930 INFO L276 IsEmpty]: Start isEmpty. Operand 16961 states and 28931 transitions. [2025-01-09 03:48:57,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 03:48:57,965 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:57,965 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:48:57,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 03:48:57,965 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:57,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:57,966 INFO L85 PathProgramCache]: Analyzing trace with hash 402272085, now seen corresponding path program 1 times [2025-01-09 03:48:57,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:57,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731381780] [2025-01-09 03:48:57,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:57,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:57,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 03:48:57,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 03:48:57,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:57,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:58,033 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-09 03:48:58,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:58,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731381780] [2025-01-09 03:48:58,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731381780] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:58,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:58,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:48:58,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083773143] [2025-01-09 03:48:58,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:58,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:48:58,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:58,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:48:58,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:48:58,036 INFO L87 Difference]: Start difference. First operand 16961 states and 28931 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:48:58,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:58,756 INFO L93 Difference]: Finished difference Result 45057 states and 77208 transitions. [2025-01-09 03:48:58,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:48:58,756 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 119 [2025-01-09 03:48:58,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:58,907 INFO L225 Difference]: With dead ends: 45057 [2025-01-09 03:48:58,908 INFO L226 Difference]: Without dead ends: 30030 [2025-01-09 03:48:59,063 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-01-09 03:48:59,064 INFO L435 NwaCegarLoop]: 339 mSDtfsCounter, 95 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 672 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-01-09 03:48:59,065 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 672 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:48:59,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30030 states. [2025-01-09 03:49:00,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30030 to 29998. [2025-01-09 03:49:00,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29998 states, 24760 states have (on average 1.637843295638126) internal successors, (40553), 24767 states have internal predecessors, (40553), 5184 states have call successors, (5184), 50 states have call predecessors, (5184), 53 states have return successors, (5376), 5180 states have call predecessors, (5376), 5180 states have call successors, (5376) [2025-01-09 03:49:00,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29998 states to 29998 states and 51113 transitions. [2025-01-09 03:49:00,581 INFO L78 Accepts]: Start accepts. Automaton has 29998 states and 51113 transitions. Word has length 119 [2025-01-09 03:49:00,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:49:00,581 INFO L471 AbstractCegarLoop]: Abstraction has 29998 states and 51113 transitions. [2025-01-09 03:49:00,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:49:00,582 INFO L276 IsEmpty]: Start isEmpty. Operand 29998 states and 51113 transitions. [2025-01-09 03:49:00,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-01-09 03:49:00,627 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:49:00,627 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:49:00,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 03:49:00,628 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:49:00,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:49:00,629 INFO L85 PathProgramCache]: Analyzing trace with hash -341424122, now seen corresponding path program 1 times [2025-01-09 03:49:00,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:49:00,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308187379] [2025-01-09 03:49:00,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:49:00,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:49:00,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-01-09 03:49:00,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-01-09 03:49:00,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:49:00,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:49:00,702 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-09 03:49:00,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:49:00,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308187379] [2025-01-09 03:49:00,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308187379] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:49:00,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:49:00,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:49:00,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549727380] [2025-01-09 03:49:00,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:49:00,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:49:00,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:49:00,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:49:00,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:49:00,706 INFO L87 Difference]: Start difference. First operand 29998 states and 51113 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:49:02,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:49:02,435 INFO L93 Difference]: Finished difference Result 82903 states and 141571 transitions. [2025-01-09 03:49:02,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:49:02,436 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 120 [2025-01-09 03:49:02,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:49:02,721 INFO L225 Difference]: With dead ends: 82903 [2025-01-09 03:49:02,722 INFO L226 Difference]: Without dead ends: 55593 [2025-01-09 03:49:02,804 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:49:02,805 INFO L435 NwaCegarLoop]: 346 mSDtfsCounter, 93 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 682 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-01-09 03:49:02,806 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 682 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:49:02,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55593 states. [2025-01-09 03:49:04,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55593 to 55561. [2025-01-09 03:49:05,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55561 states, 45800 states have (on average 1.6264847161572051) internal successors, (74493), 45807 states have internal predecessors, (74493), 9707 states have call successors, (9707), 50 states have call predecessors, (9707), 53 states have return successors, (10043), 9703 states have call predecessors, (10043), 9703 states have call successors, (10043) [2025-01-09 03:49:05,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55561 states to 55561 states and 94243 transitions. [2025-01-09 03:49:05,338 INFO L78 Accepts]: Start accepts. Automaton has 55561 states and 94243 transitions. Word has length 120 [2025-01-09 03:49:05,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:49:05,339 INFO L471 AbstractCegarLoop]: Abstraction has 55561 states and 94243 transitions. [2025-01-09 03:49:05,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:49:05,340 INFO L276 IsEmpty]: Start isEmpty. Operand 55561 states and 94243 transitions. [2025-01-09 03:49:05,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-01-09 03:49:05,391 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:49:05,391 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:49:05,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 03:49:05,392 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:49:05,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:49:05,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1218908970, now seen corresponding path program 1 times [2025-01-09 03:49:05,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:49:05,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789918751] [2025-01-09 03:49:05,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:49:05,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:49:05,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 03:49:05,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 03:49:05,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:49:05,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:49:05,464 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-09 03:49:05,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:49:05,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789918751] [2025-01-09 03:49:05,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789918751] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:49:05,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:49:05,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:49:05,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609281865] [2025-01-09 03:49:05,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:49:05,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:49:05,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:49:05,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:49:05,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:49:05,468 INFO L87 Difference]: Start difference. First operand 55561 states and 94243 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:49:07,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:49:07,914 INFO L93 Difference]: Finished difference Result 155069 states and 263772 transitions. [2025-01-09 03:49:07,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:49:07,914 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 121 [2025-01-09 03:49:07,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:49:08,509 INFO L225 Difference]: With dead ends: 155069 [2025-01-09 03:49:08,509 INFO L226 Difference]: Without dead ends: 103233 [2025-01-09 03:49:08,703 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-01-09 03:49:08,703 INFO L435 NwaCegarLoop]: 339 mSDtfsCounter, 91 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 672 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-01-09 03:49:08,704 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 672 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:49:08,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103233 states. [2025-01-09 03:49:12,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103233 to 103201. [2025-01-09 03:49:12,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103201 states, 85589 states have (on average 1.6206521866127657) internal successors, (138710), 85596 states have internal predecessors, (138710), 17558 states have call successors, (17558), 50 states have call predecessors, (17558), 53 states have return successors, (18168), 17554 states have call predecessors, (18168), 17554 states have call successors, (18168) [2025-01-09 03:49:13,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103201 states to 103201 states and 174436 transitions. [2025-01-09 03:49:13,108 INFO L78 Accepts]: Start accepts. Automaton has 103201 states and 174436 transitions. Word has length 121 [2025-01-09 03:49:13,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:49:13,108 INFO L471 AbstractCegarLoop]: Abstraction has 103201 states and 174436 transitions. [2025-01-09 03:49:13,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:49:13,109 INFO L276 IsEmpty]: Start isEmpty. Operand 103201 states and 174436 transitions. [2025-01-09 03:49:13,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-01-09 03:49:13,167 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:49:13,167 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:49:13,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 03:49:13,168 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:49:13,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:49:13,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1051283944, now seen corresponding path program 1 times [2025-01-09 03:49:13,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:49:13,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163437005] [2025-01-09 03:49:13,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:49:13,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:49:13,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 03:49:13,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 03:49:13,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:49:13,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:49:13,245 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-09 03:49:13,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:49:13,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163437005] [2025-01-09 03:49:13,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163437005] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:49:13,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:49:13,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:49:13,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116297645] [2025-01-09 03:49:13,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:49:13,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:49:13,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:49:13,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:49:13,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:49:13,247 INFO L87 Difference]: Start difference. First operand 103201 states and 174436 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:49:18,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:49:18,101 INFO L93 Difference]: Finished difference Result 292764 states and 495866 transitions. [2025-01-09 03:49:18,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:49:18,102 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 122 [2025-01-09 03:49:18,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:49:19,127 INFO L225 Difference]: With dead ends: 292764 [2025-01-09 03:49:19,127 INFO L226 Difference]: Without dead ends: 194479 [2025-01-09 03:49:19,398 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-01-09 03:49:19,398 INFO L435 NwaCegarLoop]: 340 mSDtfsCounter, 89 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 673 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-01-09 03:49:19,399 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 673 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:49:19,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194479 states. [2025-01-09 03:49:25,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194479 to 194447. [2025-01-09 03:49:25,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194447 states, 162316 states have (on average 1.6134330565070603) internal successors, (261886), 162323 states have internal predecessors, (261886), 32077 states have call successors, (32077), 50 states have call predecessors, (32077), 53 states have return successors, (33219), 32073 states have call predecessors, (33219), 32073 states have call successors, (33219) [2025-01-09 03:49:26,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194447 states to 194447 states and 327182 transitions. [2025-01-09 03:49:26,334 INFO L78 Accepts]: Start accepts. Automaton has 194447 states and 327182 transitions. Word has length 122 [2025-01-09 03:49:26,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:49:26,334 INFO L471 AbstractCegarLoop]: Abstraction has 194447 states and 327182 transitions. [2025-01-09 03:49:26,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:49:26,334 INFO L276 IsEmpty]: Start isEmpty. Operand 194447 states and 327182 transitions. [2025-01-09 03:49:26,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-01-09 03:49:26,411 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:49:26,411 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:49:26,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 03:49:26,412 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:49:26,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:49:26,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1304511862, now seen corresponding path program 1 times [2025-01-09 03:49:26,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:49:26,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019681321] [2025-01-09 03:49:26,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:49:26,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:49:26,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-09 03:49:26,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-09 03:49:26,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:49:26,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:49:26,490 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-09 03:49:26,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:49:26,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019681321] [2025-01-09 03:49:26,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019681321] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:49:26,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:49:26,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:49:26,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421695510] [2025-01-09 03:49:26,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:49:26,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:49:26,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:49:26,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:49:26,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:49:26,494 INFO L87 Difference]: Start difference. First operand 194447 states and 327182 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12)